640 search results - page 37 / 128 » Logical types for untyped languages |
TBILLC
2005
Springer
14 years 1 months ago
2005
Springer
We implement the extension of the logical consequence relation to a partial order ≤ on arbitary types built from e (entities) and t (Booleans) that was given in [1], and the deï...
POPL
2010
ACM
14 years 5 months ago
2010
ACM
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
CADE
2001
Springer
14 years 8 months ago
2001
Springer
Canonical propositional Gentzen-type systems are systems which in addition to the standard axioms and structural rules have only pure logical rules with the subformula property, in...
POPL
2011
ACM
12 years 10 months ago
2011
ACM
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...