In this paper we present the semantics of a functional logic language with parametric and order-sorted polymorphism. Typed programs consist of a polymorphic signature and a set of constructor-based conditional rewriting rules for which we define a semantic calculus. The denotational semantics of the language is based on Scott domains interpreting constructors and functions by monotonic and continuous mappings, respectively, in every instance of the declared type. We prove initiality results for the free ground term algebra. We also prove that the free term algebra with variables is freely generated in the category of models. The semantic calculus is proved to be sound and complete w.r.t. the denotational semantics. As in logic programming, we define the immediate consequence operator, proving that the Hebrand model is the least model of a program.
CITATION STYLE
Almendros-Jiménez, J. M., Gavilanes-Franco, A., & Gil-Luezas, A. (1996). Algebraic semantics for functional logic programming with polymorphic order-sorted types. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1139, pp. 299–313). Springer Verlag. https://doi.org/10.1007/3-540-61735-3_20
Mendeley helps you to discover research relevant for your work.