Abstract
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.
This work has been partially supported by the German Reasearch Concil (DFG) under grant Ha 2457/5-2.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Albert, E., Hanus, M., Huch, F., Oliver, J., Vidal, G.: Operational semantics for declarative multi-paradigm languages. Journal of Symbolic Computation 40(1), 795–829 (2005)
Antoy, S., Hanus, M.: Declarative programming with function patterns. In: Hill, P.M. (ed.) LOPSTR 2005. LNCS, vol. 3901, pp. 6–22. Springer, Heidelberg (2006)
Antoy, S., Braßel, B.: Computing with subspaces. In: Podelski, A. (ed.) Proceedings of the 9th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, pp. 121–30 (2007)
Berghammer, R., von Karger, B.: Relational semantics of functional programs. In: Relational Methods in Computer Science, Advances in Computing Science, pp. 115–130. Springer, Heidelberg (1997)
Braßel, B., Christiansen, J.: Denotation by transformation - towards obtaining a denotational semantics by transformation to point-free style. In: King, A. (ed.) LOPSTR 2007. LNCS, vol. 4915, Springer, Heidelberg (2008)
Braßel, B., Huch, F.: On a tighter integration of functional and logic programming. In: Shao, Z. (ed.) APLAS 2007. LNCS, vol. 4807, pp. 122–138. Springer, Heidelberg (2007)
Chin, L.H., Tarski, A.: Distributive and modular laws in the arithmetic of relation algebras. Univ. of California, Publ. of Mathematics 1, 341–384 (1951)
Echahed, R., Janodet, J.-C.: Admissible graph rewriting and narrowing. In: Proc. Joint International Conference and Symposium on Logic Programming (JICSLP 1998), pp. 325–340 (1998)
González-Moreno, J.C., Hortalá-González, M.T., López-Fraguas, F.J., Rodríguez-Artalejo, M.: An approach to declarative programming based on a rewriting logic. J. Log. Program. 40(1), 47–87 (1999)
Hanus, M.: Multi-paradigm declarative languages. In: Dahl, V., Niemelä, I. (eds.) ICLP 2007. LNCS, vol. 4670, pp. 45–75. Springer, Heidelberg (2007)
Hughes, J.: Why functional programming matters. In: Turner, D.A. (ed.) Research Topics in Functional Programming, pp. 17–42. Addison-Wesley, Reading (1990)
López-Fraguas, F.J., Rodríguez-Hortalá, J., Sánchez-Hernández, J.: A simple rewrite notion for call-time choice semantics. In: Proceedings of the 9th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP 2007), pp. 197–208. ACM Press, New York (2007)
López-Fraguas, F.J., Sánchez-Hernández, J.: Narrowing failure in functional logic programming. In: Hu, Z., Rodríguez-Artalejo, M. (eds.) FLOPS 2002. LNCS, vol. 2441, pp. 212–227. Springer, Heidelberg (2002)
Maddux, R.D.: Relation-algebraic semantics. Theoretical Computer Science 160(1–2), 1–85 (1996)
Schmidt, G., Ströhlein, T.: Relations and Graphs - Discrete Mathematics for Computer Scientists. In: EATCS Monographs on Theoretical Computer Science, Springer, Heidelberg (1993)
Zierer, H.: Programmierung mit Funktionsobjekten: Konstruktive Erzeugung semantischer Bereiche und Anwendung auf die partielle Auswertung. PhD thesis, Technische Universität München, Fakultät für Informatik (1988)
Zierer, H.: Relation algebraic domain constructions. Theor. Comput. Sci. 87(1), 163–188 (1991)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Braßel, B., Christiansen, J. (2008). A Relation Algebraic Semantics for a Lazy Functional Logic Language. In: Berghammer, R., Möller, B., Struth, G. (eds) Relations and Kleene Algebra in Computer Science. RelMiCS 2008. Lecture Notes in Computer Science, vol 4988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78913-0_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-78913-0_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78912-3
Online ISBN: 978-3-540-78913-0
eBook Packages: Computer ScienceComputer Science (R0)