000K utf8 1100 $c2007 1500 eng 2050 urn:nbn:de:101:1-201205096973 3000 Brassel, Bernd 3010 Christiansen, Jan 4000 Denotation by Transformation$dTowards Obtaining a Denotational Semantics by Transformation to Point-free Style [Brassel, Bernd] 4209 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 resulting programs are strict but, nevertheless, the semantics of the original program is preserved. There is a one-to-one mapping from the primitives introduced by the transformation to operations in relation algebra. This mapping can be extended to obtain a relation algebraic model for the whole program. This yields a denotational semantics which is on one hand closely related to point-free functional logic programs and on the other hand connects to the well developed field of algebraic logic including automatic proving. 4950 https://nbn-resolving.org/urn:nbn:de:101:1-201205096973$xR$3Volltext$534 4961 https://macau.uni-kiel.de/receive/macau_mods_00001878 5051 004