Sciweavers

30 search results - page 2 / 6
» Fold and Unfold for Program Semantics
Sort
View
MPC
2010
Springer
177views Mathematics» more  MPC 2010»
13 years 10 months ago
Adjoint Folds and Unfolds
Abstract. Folds and unfolds are at the heart of the algebra of programming. They allow the cognoscenti to derive and manipulate programs rigorously and effectively. Fundamental la...
Ralf Hinze
FPCA
1995
13 years 9 months ago
Bananas in Space: Extending Fold and Unfold to Exponential Types
Fold and unfold are general purpose functionals for processing and constructing lists. By using the categorical approach of modelling recursive datatypes as fixed points of funct...
Erik Meijer, Graham Hutton
LOPSTR
1994
Springer
13 years 9 months ago
A Transformation System for Definite Programs Based on Termination Analysis
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
J. Cook, John P. Gallagher
FLOPS
2008
Springer
13 years 6 months ago
A Generalization of the Folding Rule for the Clark-Kunen Semantics
Abstract. In this paper, we propose more flexible applicability conditions for the folding rule that increase the power of existing unfold/fold systems for normal logic programs. O...
Javier Álvez, Paqui Lucio