An abstract machine based system for a lazy narrowing calculus

DOI10.1007/3-540-44716-4_14MaRDI QIDQ2763698zbMATH OpenFDO

Authors T. Hortalá-González, Eva Ullán

Publication date 22 January 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44716-4_14

zbMATH Keywords

JUMP-machinelazy narrowing calculus

Mathematics Subject Classification ID

Logic programming (68N17) Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42) Computing methodologies and applications (68U99)

Recommendations

• Graph-based implementation of a functional logic language
• A deterministic lazy narrowing calculus
• Lazy narrowing in a graph machine
• scientific article; zbMATH DE number 1822269
• An abstract concurrent machine for rewriting

Cited in

(7)

• A residualizing semantics for the partial evaluation of functional logic programs.
• A functional correspondence between call-by-need evaluators and lazy abstract machines
• Operational semantics for declarative multi-paradigm languages
• Boosting Lazy Abstraction for SystemC with Partial Order Reduction
• Graph-based implementation of a functional logic language
• Lazy narrowing in a graph machine
• The narrowing-driven approach to functional logic program specialization

This page was built for publication: An abstract machine based system for a lazy narrowing calculus

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