57 search results - page 4 / 12 » Syntactic Type Soundness Results for the Region Calculus |
CORR
2008
Springer
13 years 6 months ago
2008
Springer
A type-based approach to termination uses sized types: an ordinal bound for the size of a data structure is stored in its type. A recursive function over a sized type is accepted i...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
Reasoning about imperative programs requires the ability to track aliasing and ownership properties. We present a type system that provides this ability, by using regions, capabil...
TAPSOFT
1997
Springer
13 years 11 months ago
1997
Springer
The SML-like module systems are small typed languages of their own. As is, one would expect a proof of their soundness following from a proof of subject reduction. Unfortunately, t...
ICFP
1999
ACM
13 years 11 months ago
1999
ACM
Programs are often structured around the idea that different pieces of code comprise distinct principals, each with a view of its environment. Typical examples include the module...
GI
2009
Springer
14 years 1 days ago
2009
Springer
: This paper describes a syntactical method for contextual equivalence in polymorphically typed lambda-calculi. Our specific calculus has letrec as cyclic let, data constructors, ...