596 search results - page 42 / 120 » Subtyping Recursive Types |
109
click to vote
LICS
1999
IEEE
15 years 5 months ago
1999
IEEE
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting the recursive path ordering definition to terms of a typed ...
115
click to vote
APLAS
2010
ACM
15 years 1 months ago
2010
ACM
Abstract. The type system of Objective Caml has many unique features, which make ensuring the correctness of its implementation difficult. One of these features is structurally pol...
106
click to vote
ICFP
2006
ACM
16 years 1 months ago
2006
ACM
d abstract) Keiko Nakata1 Jacques Garrigue2 1 Kyoto University Research Institute for Mathematical Sciences 2 Graduate School of Mathematics, Nagoya University The ML module syste...
107
click to vote
LPAR
2010
Springer
14 years 11 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...
APLAS
2005
ACM
15 years 7 months ago
2005
ACM
Abstract. Polymorphic recursion is a useful extension of HindleyMilner typing and has been incorporated in the functional programming language Haskell. It allows the expression of ...