Sciweavers

54 search results - page 4 / 11
» Inductive Synthesis of Recursive Functional Programs
Sort
View
FSTTCS
1993
Springer
13 years 11 months ago
Induce-Statements and Induce-Expressions: Constructs for Inductive Programming
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
Theodore S. Norvell
POPL
2012
ACM
12 years 3 months ago
Recursive proofs for inductive tree data-structures
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
Parthasarathy Madhusudan, Xiaokang Qiu, Andrei Ste...
ESOP
2009
Springer
13 years 11 months ago
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
Matthew R. Lakin, Andrew M. Pitts
APLAS
2007
ACM
13 years 11 months ago
Mixed Inductive/Coinductive Types and Strong Normalization
Abstract. We introduce the concept of guarded saturated sets, saturated sets of strongly normalizing terms closed under folding of corecursive functions. Using this tool, we can mo...
Andreas Abel
ASIAN
2003
Springer
109views Algorithms» more  ASIAN 2003»
14 years 23 days ago
Deaccumulation - Improving Provability
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automated verification usually fails for functions with accumulating ar...
Jürgen Giesl, Armin Kühnemann, Janis Voi...