Rewriting and Call-Time Choice: The HO Case

DOI10.1007/978-3-540-78969-7_12zbMath1137.68338OpenAlexW4214478546MaRDI QIDQ5458434

Francisco 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

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

Related Items (4)

Safe typing of functional logic programs with opaque patterns and local bindings ⋮ A liberal type system for functional logic programs ⋮ Rewriting and Call-Time Choice: The HO Case ⋮ On the correctness of pull-tabbing

Cites Work

• Operational semantics for declarative multi-paradigm languages
• Lazy Context Cloning for Non-Deterministic Graph Rewriting
• Equivalence of Two Formal Semantics for Functional Logic Programs
• On the Correctness of Bubbling
• Multi-paradigm Declarative Languages
• A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
• The call-by-need lambda calculus
• 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
• Essentials of Term Graph Rewriting
• Rewriting and Call-Time Choice: The HO Case
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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