38 search results - page 1 / 8 » A completeness result for a realisability semantics for an i... |
128
Voted
APAL
2007
15 years 3 months ago
2007
In this paper we consider a type system with a universal type ω where any term (whether open or closed, β-normalising or not) has type ω. We provide this type system with a rea...
124
Voted
FSTTCS
1993
Springer
15 years 7 months ago
1993
Springer
This paper will show the usefulness and elegance of strict intersection types for the Lambda Calculus; these are strict in the sense that they are the representatives of equivalen...
148
Voted
ICFP
1999
ACM
15 years 8 months ago
1999
ACM
d Abstract) Assaf J. Kfoury∗ Boston University http://www.cs.bu.edu/˜kfoury Harry G. Mairson† Brandeis University http://www.cs.brandeis.edu/˜mairson Franklyn A. Turbak‡ We...
168
Voted
ENTCS
2002
15 years 3 months ago
2002
A program analysis is compositional when the analysis result for a particular program fragment is obtained solely from the results for its immediate subfragments via some composit...
123
Voted
OOPSLA
2007
Springer
15 years 9 months ago
2007
Springer
Dependent Classes Vaidas Gasiunas and Mira Mezini Technische Universit¨at Darmstadt, Germany Abstract. Dependent classes are parameterized classes, the interface and implementatio...