365 search results - page 15 / 73 » Using Types as Approximations for Type Checking Prolog Progr... |
PADL
2012
Springer
12 years 3 months ago
2012
Springer
In the past, the creators of numerical programs had to choose between simple expression of mathematical formulas and static type checking. While the Lisp family and its dynamically...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
We introduce a generic type system (based on Milner's sort system) for the synchronous polyadic -calculus, allowing us to mechanise the analysis of input/output capabilities o...
ICTCS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Non-interference is a desirable property of systems in a multilevel security architecture, stating that confidential information is not disclosed in public output. The c...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
ASPLOS
2006
ACM
13 years 11 months ago
2006
ACM
We report our experience in implementing type and memory safety in an efficient manner for sensor network nodes running TinyOS: tiny embedded systems running legacy, C-like code. ...