Equivalence of two formal semantics for functional logic programs

DOI10.1016/J.ENTCS.2007.05.042MaRDI QIDQ2867964zbMATH OpenOpenAlexFDO

Authors F. J. López-Fraguas, Juan Rodríguez-Hortalá, Jaime Sánchez-Hernández

Publication date 20 December 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/j.entcs.2007.05.042

zbMATH Keywords

equivalence of semanticsfunctional logic programming

Mathematics Subject Classification ID

Logic programming (68N17) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

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

• 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
• scientific article; zbMATH DE number 1688813 (Why is no real title available?)
• 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

(12)

• A decision procedure for semantical equivalence of thin FM specifications
• scientific article; zbMATH DE number 1696583 (Why is no real title available?)
• Semantic determinism and functional logic program properties
• An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry
• scientific article; zbMATH DE number 5677418 (Why is no real title available?)
• A Relation Algebraic Semantics for a Lazy Functional Logic Language
• scientific article; zbMATH DE number 1332638 (Why is no real title available?)
• scientific article; zbMATH DE number 1941934 (Why is no real title available?)
• Equivalence of two fixed-point semantics for definitional higher-order logic programs
• Singular and plural functions for functional logic programming
• Rewriting and narrowing for constructor systems with call-time choice semantics
• Rewriting and Call-Time Choice: The HO Case

Describes a project that uses

Uses Software

• TOY
• Curry

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)