640 search results - page 50 / 128 » Logical types for untyped languages |
ICFP
2006
ACM
14 years 9 months ago
2006
ACM
We describe an s-expression based syntax-extension framework much like Scheme macros, with a key additional facility: the ability to define static semantics, such as type systems ...
ISSTA
2004
ACM
14 years 2 months ago
2004
ACM
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
PPDP
2009
Springer
14 years 3 months ago
2009
Springer
We introduce a logic programming framework for data type transformations based on isomorphisms between elementary data types (natural numbers, finite functions, sets and permutat...
TLDI
2005
ACM
14 years 2 months ago
2005
ACM
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...
TLDI
2005
ACM
14 years 2 months ago
2005
ACM
Atomicity is a fundamental correctness property in multithreaded programs. This paper presents an algorithm for verifying atomicity via type inference. The underlying type system ...