Rewriting and Call-Time Choice: The HO Case
From MaRDI portal
Publication:5458434
DOI10.1007/978-3-540-78969-7_12zbMATH Open1137.68338OpenAlexW4214478546MaRDI QIDQ5458434FDOQ5458434
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
Recommendations
- Rewriting and narrowing for constructor systems with call-time choice semantics
- A hierarchy of semantics for non-deterministic term rewriting systems
- scientific article; zbMATH DE number 1088020
- Equivalence of two formal semantics for functional logic programs
- Singular and plural functions for functional logic programming
Logic programming (68N17) Grammars and rewriting systems (68Q42) Functional programming and lambda calculus (68N18)
Cites Work
- Title not available (Why is that?)
- The call-by-need lambda calculus
- Equivalence of two formal semantics for functional logic programs
- Higher-order narrowing with definitional trees
- Multi-paradigm Declarative Languages
- The integration of functions into logic programming: From theory to practice
- A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
- An approach to declarative programming based on a rewriting logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Operational semantics for declarative multi-paradigm languages
- Title not available (Why is that?)
- Essentials of term graph rewriting
- Title not available (Why is that?)
- Rewriting and Call-Time Choice: The HO Case
- Title not available (Why is that?)
- Lazy context cloning for non-deterministic graph rewriting
- On the Correctness of Bubbling
- Title not available (Why is that?)
Cited In (6)
- A hierarchy of semantics for non-deterministic term rewriting systems
- Safe typing of functional logic programs with opaque patterns and local bindings
- On the correctness of pull-tabbing
- 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)
