Equivalence of two formal semantics for functional logic programs
From MaRDI portal
Publication:2867964
Recommendations
- Equivalence of two fixed-point semantics for definitional higher-order logic programs
- Equivalence of two fixed-point semantics for definitional higher-order logic programs
- Equivalences among logics of programs
- scientific article; zbMATH DE number 3956409
- On the equivalence of semantics for normal logic programs
- scientific article; zbMATH DE number 3846863
- Inductive Logic Programming
- Equivalence checking of two functional programs using inductive theorem provers
- scientific article; zbMATH DE number 3852428
Cites work
- scientific article; zbMATH DE number 1688813 (Why is no real title available?)
- A needed narrowing strategy
- An approach to declarative programming based on a rewriting logic
- Extra variables can be eliminated from functional logic programs
- Functional Logic Programming: From Theory to Curry
- Higher-order narrowing with definitional trees
- Nondeterministic algebraic specifications and nonconfluent term rewriting
- Operational semantics for declarative multi-paradigm languages
- Overlapping Rules and Logic Variables in Functional Logic Programs
- The integration of functions into logic programming: From theory to practice
Cited in
(11)- Singular and plural functions for functional logic programming
- scientific article; zbMATH DE number 5677418 (Why is no real title available?)
- An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry
- A Relation Algebraic Semantics for a Lazy Functional Logic Language
- Rewriting and narrowing for constructor systems with call-time choice semantics
- scientific article; zbMATH DE number 1941934 (Why is no real title available?)
- Rewriting and Call-Time Choice: The HO Case
- A decision procedure for semantical equivalence of thin FM specifications
- scientific article; zbMATH DE number 1696583 (Why is no real title available?)
- Equivalence of two fixed-point semantics for definitional higher-order logic programs
- Semantic determinism and functional logic program properties
This page was built for publication: Equivalence of two formal semantics for functional logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867964)