Sciweavers

54 search results - page 5 / 11
» Inductive Synthesis of Recursive Functional Programs
Sort
View
89
Voted
TACAS
2010
Springer
225views Algorithms» more  TACAS 2010»
15 years 6 months ago
Automated Termination Analysis for Programs with Second-Order Recursion
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
Markus Aderhold
CIE
2007
Springer
15 years 5 months ago
Input-Dependence in Function-Learning
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...
Sanjay Jain, Eric Martin, Frank Stephan
AAIP
2009
15 years 25 days ago
Automated Method Induction: Functional Goes Object Oriented
The development of software engineering has had a great deal of benefits for the development of software. Along with it came a whole new paradigm of the way software is designed a...
Thomas Hieber, Martin Hofmann 0008
POPL
2010
ACM
15 years 9 months ago
Nominal System T
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...
Andrew M. Pitts
ICFP
2008
ACM
15 years 11 months ago
Pattern minimization problems over recursive data types
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
Alexander Krauss