Name
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.
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.
|
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-78769-3_7 | Logic Program Synthesis and Transformation |
Keywords | Field | DocType |
original program,denotational semantics,relation algebra,one-to-one mapping,functional logic languagesin,point-free styleof programming,functional logic program,relation algebraic model,algebraic logic,arbitrary functional logic program,functional logic programming | Denotational semantics of the Actor model,Operational semantics,Programming language,Axiomatic semantics,Normalisation by evaluation,Computer science,Action semantics,Denotational semantics,Algorithm,Theoretical computer science,Higher-order logic,Well-founded semantics | Conference |
Volume | ISSN | Citations |
4915 | 0302-9743 | 1 |
PageRank | References | Authors |
0.37 | 11 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bernd Braßel | 1 | 181 | 12.47 |
| Jan Christiansen | 2 | 1 | 0.37 |