Equivalence of Two Formal Semantics for Functional Logic Programs

DOI10.1016/j.entcs.2007.05.042zbMath1278.68051OpenAlexW2017855559MaRDI QIDQ2867964

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

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

zbMATH Keywords

functional logic programmingequivalence of semantics

Mathematics Subject Classification ID

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

Related Items

An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry ⋮ Rewriting and narrowing for constructor systems with call-time choice semantics ⋮ Rewriting and Call-Time Choice: The HO Case

Uses Software

• Curry
• TOY

Cites Work

• Unnamed Item
• Operational semantics for declarative multi-paradigm languages
• Extra Variables Can Be Eliminated from Functional Logic Programs
• A needed narrowing strategy
• Nondeterministic algebraic specifications and nonconfluent term rewriting
• 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
• Functional Logic Programming: From Theory to Curry
• Overlapping Rules and Logic Variables in Functional Logic Programs