TY - CPAPER
AU - Bernd Braßel
AU - Jan Christiansen
AU - Andy King
AB - It has often been observed that a point-free style of programming provides a more abstract view on programs. We aim to use the gain in abstraction to obtain a denotational semantics for functional logic languages in a straightforward way. Here we propose a set of basic operations based on which arbitrary functional logic programs can be transformed to point-free programs. The semantics of the resulting programs are strict but, nevertheless, the semantics of the original program is preserved.
BT - Logic-Based Program Synthesis and Transformation
N2 - It has often been observed that a point-free style of programming provides a more abstract view on programs. We aim to use the gain in abstraction to obtain a denotational semantics for functional logic languages in a straightforward way. Here we propose a set of basic operations based on which arbitrary functional logic programs can be transformed to point-free programs. The semantics of the resulting programs are strict but, nevertheless, the semantics of the original program is preserved.
PB - Springer Berlin Heidelberg
PY - 2008
SN - 978-3-540-78769-3
SP - 90
EP - 105
T2 - Logic-Based Program Synthesis and Transformation
TI - Denotation by Transformation
ER -