135 search results - page 19 / 27 » A typed lambda calculus with intersection types |
POPL
2003
ACM
14 years 7 months ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
PPDP
2005
Springer
14 years 29 days ago
2005
Springer
We study contexts (terms with holes) by proposing a ‘λcalculus with holes’. It is very expressive and can encode programming constructs apparently unrelated to contexts, incl...
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
PLDI
2005
ACM
14 years 1 months ago
2005
ACM
Today’s module systems do not effectively support information hiding in the presence of shared mutable objects, causing serious problems in the development and evolution of larg...
ICFP
2002
ACM
14 years 7 months ago
2002
ACM
We propose an extension of Haskell's type class system with bstractions in the type language. Type inference for our extension relies on a novel constrained unification proce...