13 search results - page 1 / 3 » The Complexity of Type Inference for Higher-Order Typed Lamb... |
POPL
1991
ACM
13 years 8 months ago
1991
ACM
ESOP
2009
Springer
13 years 11 months ago
2009
Springer
This paper explores the surprisingly rich design space for the simply typed lambda calculus with casts and a dynamic type. Such a calculus is the target intermediate language of th...
WFLP
2009
Springer
13 years 11 months ago
2009
Springer
This paper shows that type-checking and type-inference problems are equivalent in domain-free lambda calculi with existential types, that is, type-checking problem is Turing reduci...
ENTCS
2002
13 years 4 months ago
2002
The last few years have seen the development of a new calculus which can be considered as an outcome of the last decade of various researches on (higher order) term rewriting syst...
CADE
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Formulas are often monotonic in the sense that if the formula is satisfiable for given domains of discourse, it is also satisfiable for all larger domains. Monotonicity i...