Sciweavers

69 search results - page 3 / 14
» Explaining Algebraic Theory with Functional Programs
Sort
View
ESOP
2001
Springer
13 years 12 months ago
Modeling an Algebraic Stepper
Programmers rely on the correctness of the tools in their programming environments. In the past, semanticists have studied the correctness of compilers and compiler analyses, which...
John Clements, Matthew Flatt, Matthias Felleisen
ICLP
1995
Springer
13 years 11 months ago
A Method for Implementing Equational Theories as Logic Programs
Equational theories underly many elds of computing, including functional programming, symbolic algebra, theorem proving, term rewriting and constraint solving. In this paper we sh...
Mantis H. M. Cheng, Douglas Stott Parker Jr., Maar...
CORR
2010
Springer
156views Education» more  CORR 2010»
13 years 7 months ago
On CSP and the Algebraic Theory of Effects
We consider CSP from the point of view of the algebraic theory of effects, which classifies operations as effect constructors and effect deconstructors; it also provides a link wit...
Rob J. van Glabbeek, Gordon D. Plotkin
ICFP
1998
ACM
13 years 11 months ago
Fold and Unfold for Program Semantics
In this paper we explain how recursion operators can be used to structure and reason about program semantics within a functional language. In particular, we show how the recursion...
Graham Hutton
JMLR
2006
78views more  JMLR 2006»
13 years 7 months ago
Inductive Synthesis of Functional Programs: An Explanation Based Generalization Approach
We describe an approach to the inductive synthesis of recursive equations from input/outputexamples which is based on the classical two-step approach to induction of functional Li...
Emanuel Kitzelmann, Ute Schmid