119 search results - page 13 / 24 » Alpha-Structural Recursion and Induction |
POPL
2010
ACM
15 years 9 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
CIE
2007
Springer
15 years 5 months ago
2007
Springer
In the standard model of inductive inference, a learner gets as input the graph of a function, and has to discover (in the limit) a program for the function. In this paper, we cons...
129
click to vote
ACL2
2006
ACM
15 years 5 months ago
2006
ACM
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...
100
click to vote
TYPES
2004
Springer
15 years 5 months ago
2004
Springer
We present four constructions for standard equipment which can be generated for every inductive datatype: case analysis, structural recursion, no confusion, acyclicity. Our constru...
ASIAN
2003
Springer
15 years 5 months ago
2003
Springer
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automated verification usually fails for functions with accumulating ar...