Why functional programming matters
Research topics in functional programming
Relation algebraic domain constructions
Theoretical Computer Science
Relations and graphs: discrete mathematics for computer scientists
Relations and graphs: discrete mathematics for computer scientists
Theoretical Computer Science
Relational semantics of functional programs
Relational methods in computer science
Admissible graph rewriting and narrowing
JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
Narrowing Failure in Functional Logic Programming
FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
A simple rewrite notion for call-time choice semantics
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Operational semantics for declarative multi-paradigm languages
Journal of Symbolic Computation
Multi-paradigm declarative languages
ICLP'07 Proceedings of the 23rd international conference on Logic programming
On a tighter integration of functional and logic programming
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Declarative programming with function patterns
LOPSTR'05 Proceedings of the 15th international conference on Logic Based Program Synthesis and Transformation
Hi-index | 0.00 |
We propose a relation algebraic semantics along with a concrete model for lazy functional logic languages. The resulting semantics provides several interesting advantages over former approaches for this class of languages. On the one hand, the high abstraction level of relation algebra allows equational reasoning leading to concise proofs about functional logic programs. On the other hand the proposed approach features, in contrast to former approaches with a comparable level of abstraction, an explicit modeling of sharing. The latter property gives rise to the expectation that the presented framework can be used to clarify notions currently discussed in the field of functional logic languages, like constructive negation, function inversion and encapsulated search. All of these topics have proved to involve subtle problems in the context of sharing and laziness in the past.