Equivalence of two formal semantics for functional logic programs
DOI10.1016/J.ENTCS.2007.05.042zbMATH Open1278.68051OpenAlexW2017855559MaRDI QIDQ2867964FDOQ2867964
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)
Full work available at URL: https://doi.org/10.1016/j.entcs.2007.05.042
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
Logic programming (68N17) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)
Cites Work
- A needed narrowing strategy
- Higher-order narrowing with definitional trees
- The integration of functions into logic programming: From theory to practice
- An approach to declarative programming based on a rewriting logic
- Title not available (Why is that?)
- Nondeterministic algebraic specifications and nonconfluent term rewriting
- Extra variables can be eliminated from functional logic programs
- Functional Logic Programming: From Theory to Curry
- Overlapping Rules and Logic Variables in Functional Logic Programs
- Operational semantics for declarative multi-paradigm languages
Cited In (11)
- Singular and plural functions for functional logic programming
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Rewriting and Call-Time Choice: The HO Case
- A decision procedure for semantical equivalence of thin FM specifications
- Title not available (Why is that?)
- Equivalence of two fixed-point semantics for definitional higher-order logic programs
- Semantic determinism and functional logic program properties
Uses Software
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)
