119 search results - page 12 / 24 » Alpha-Structural Recursion and Induction |
TPHOL
2008
IEEE
14 years 5 months ago
2008
IEEE
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
CSL
2008
Springer
14 years 21 days ago
2008
Springer
Type-based termination is a semantically intuitive method that ensures termination of recursive definitions by tracking the size of datatype elements, and by checking that recursiv...
TLCA
2007
Springer
14 years 5 months ago
2007
Springer
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
TLCA
2009
Springer
14 years 5 months ago
2009
Springer
Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanis...
LPAR
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. This paper provides a new, decidable definition of the higherorder recursive path ordering in which type comparisons are made only when needed, therefore eliminating the...