20 search results - page 1 / 4 » Strict bidirectional type checking |
TLDI
2005
ACM
13 years 10 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, ...
GI
1999
Springer
13 years 9 months ago
1999
Springer
We discuss the properties of strictly typed languages on the one hand and soft typing of the other and identify disadvantages of these approaches to type checking in the context of...
ICFP
2006
ACM
14 years 4 months ago
2006
ACM
Languages with rich type systems are beginning to employ a blend of type inference and type checking, so that the type inference engine is guided by programmer-supplied type annot...
ENTCS
2008
13 years 4 months ago
2008
We present a type system extending the dependent type theory LF, whose terms are more amenable to compact representation. This is achieved by carefully omitting certain subterms w...
PEPM
2009
ACM
14 years 1 months ago
2009
ACM
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...