Sciweavers

339 search results - page 14 / 68
» Constraint Functional Logic Programming for Origami Construc...
Sort
View
ESOP
2009
Springer
14 years 20 days 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
ENTCS
2007
104views more  ENTCS 2007»
13 years 8 months ago
Lazy Context Cloning for Non-Deterministic Graph Rewriting
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...
Sergio Antoy, Daniel W. Brown, Su-Hui Chiang
OOPSLA
2005
Springer
14 years 2 months ago
Generalized algebraic data types and object-oriented programming
Generalized algebraic data types (GADTs) have received much attention recently in the functional programming community. They generalize the (type) parameterized algebraic datatype...
Andrew Kennedy, Claudio V. Russo
VMCAI
2007
Springer
14 years 2 months ago
Constraint Solving for Interpolation
Interpolation is an important component of recent methods for program verification. It provides a natural and effective means for computing separation between the sets of ‘good...
Andrey Rybalchenko, Viorica Sofronie-Stokkermans
SNPD
2003
13 years 10 months ago
Deductive and Inductive Methods for Program Synthesis
The paper discusses simple functional constraint networks and a value propagation method for program construction. Structural synthesis of programs is described as an example of d...
Jaan Penjam, Elena Sanko