Rewriting and Call-Time Choice: The HO Case

DOI10.1007/978-3-540-78969-7_12MaRDI QIDQ5458434zbMATH OpenOpenAlexFDO

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

Publication date 11 April 2008

Published in Functional and Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78969-7_12

Mathematics Subject Classification ID

Logic programming (68N17) Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42)

Recommendations

• Rewriting and narrowing for constructor systems with call-time choice semantics
• A hierarchy of semantics for non-deterministic term rewriting systems
• Optimal non-deterministic functional logic computations
• Equivalence of two formal semantics for functional logic programs
• Singular and plural functions for functional logic programming

Cites work

• A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
• An approach to declarative programming based on a rewriting logic
• Equivalence of two formal semantics for functional logic programs
• Essentials of term graph rewriting
• Functional and constraint logic programming
• Higher-order narrowing with definitional trees
• scientific article; zbMATH DE number 515736 (Why is no real title available?)
• scientific article; zbMATH DE number 1952947 (Why is no real title available?)
• scientific article; zbMATH DE number 1420819 (Why is no real title available?)
• scientific article; zbMATH DE number 234027 (Why is no real title available?)
• Lazy context cloning for non-deterministic graph rewriting
• Multi-paradigm Declarative Languages
• On the Correctness of Bubbling
• Operational semantics for declarative multi-paradigm languages
• Rewriting and Call-Time Choice: The HO Case
• Semantics and types in functional logic programming
• The call-by-need lambda calculus
• The integration of functions into logic programming: From theory to practice
• Typed higher-order narrowing without higher-order strategies

Cited in

(6)

• Safe typing of functional logic programs with opaque patterns and local bindings
• On the correctness of pull-tabbing
• A hierarchy of semantics for non-deterministic term rewriting systems
• Rewriting and narrowing for constructor systems with call-time choice semantics
• Rewriting and Call-Time Choice: The HO Case
• A liberal type system for functional logic programs

This page was built for publication: Rewriting and Call-Time Choice: The HO Case

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