3 search results - page 1 / 1 » Decidability of Type-Checking in the Calculus of Algebraic C... |
CSL
2005
Springer
13 years 10 months ago
2005
Springer
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...
LPAR
2010
Springer
13 years 3 months ago
2010
Springer
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-bas...
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, ...