Denotational versus declarative semantics for functional programming

From MaRDI portal





The authors define a kind of higher-order conditional rewriting systems as a computational paradigm for integrating the semantics of functional and logic programming languages. For these systems, the higher-order denotational semantics of functional languages and the first-order declarative semantics of logic programs (given by the least Herbrand model) become instances of a generic least fixed point construction over continuous applicative algebras (CAAs) within an algebraic semantics framework. Section 2 develops the basic facts about applicative expressions and CAAs. Section 3 defines a Simple Functional Language (SFL) and explains how to use a kind of infinite higher-order rewriting as its operational semantics. Section 4 shows that CCAs and least fixed- point technique can be used to specify both a first-order declarative and a higher-order denotational semantics for SFL programs. An initiality result for the declarative semantics is obtained. Section 5 provides soundness and completeness results of rewriting for declarative semantics, these results failing for denotational semantics. A restricted completeness for denotational semantics is conjectured, concluding that declarative semantics offers an adequate framework for integrating functional and logic programming. For the entire collection see [Zbl 0772.68004].





Describes a project that uses

Uses Software






This page was built for publication: Denotational versus declarative semantics for functional programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4202938)