135 search results - page 21 / 27 » A typed lambda calculus with intersection types |
DLS
2008
13 years 9 months ago
2008
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides the benefits of both in a single language by giving the programmer control over w...
TLDI
2005
ACM
14 years 1 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, ...
FOSSACS
2005
Springer
14 years 1 months ago
2005
Springer
The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of cou...
POPL
1989
ACM
13 years 11 months ago
1989
ACM
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
This paper proposes a type-and-effect system called Teq, which distinguishes terminating terms and total functions from possibly diverging terms and partial functions, for a lambd...