Abstract
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.
Zitieren
1.
Braßel B, Christiansen J. Denotation by Transformation. In: King A, Hrsg. Logic-Based Program Synthesis and Transformation. Springer Berlin Heidelberg; 2008:90-105.
Braßel, B. ., & Christiansen, J. . (2008). Denotation by Transformation. In A. . King (Hrsg.), Logic-Based Program Synthesis and Transformation (S. 90–105). Springer Berlin Heidelberg.
Braßel, Bernd, und Jan Christiansen. 2008. „Denotation by Transformation“. In Logic-Based Program Synthesis and Transformation, herausgegeben von Andy King, 90-105. Springer Berlin Heidelberg.
Braßel, Bernd, und Jan Christiansen. „Denotation by Transformation“. Logic-Based Program Synthesis and Transformation. Hg. von Andy King. Springer Berlin Heidelberg, 2008. 90–105. Print.
Braßel, Bernd, und Jan Christiansen. „Denotation by Transformation“. Logic-Based Program Synthesis and Transformation, herausgegeben von Andy King, Springer Berlin Heidelberg, 2008, S. 90–105.
Details
-
Number of Pages
90-105 -
Publisher
Springer Berlin Heidelberg -
ISBN Number
978-3-540-78769-3