Lazy context cloning for non-deterministic graph rewriting

DOI10.1016/J.ENTCS.2006.10.026MaRDI QIDQ2867896zbMATH OpenOpenAlexFDO

Authors Sergio Antoy, Daniel W. Brown, Su-Hui Chiang

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.2006.10.026

zbMATH Keywords

bubblingfunctional logic programminggraph transformationsnon-deterministic computations

Mathematics Subject Classification ID

Logic programming (68N17) Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Lazy rewriting and eager machinery
• On term-graph rewrite strategies
• Extending graph rewriting with copying
• scientific article; zbMATH DE number 1420819
• Non Strict Confluent Rewrite Systems for Data-Structures with Pointers

Cites work

• A needed narrowing strategy
• A Virtual Machine for Functional Logic Computations
• An approach to declarative programming based on a rewriting logic
• Evaluation strategies for functional logic programming
• scientific article; zbMATH DE number 4037157 (Why is no real title available?)
• scientific article; zbMATH DE number 4074466 (Why is no real title available?)
• scientific article; zbMATH DE number 599028 (Why is no real title available?)
• scientific article; zbMATH DE number 1088020 (Why is no real title available?)
• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• scientific article; zbMATH DE number 1889386 (Why is no real title available?)
• scientific article; zbMATH DE number 1420819 (Why is no real title available?)
• Implementing functional logic languages using multiple threads and stores
• Nondeterministic algebraic specifications and nonconfluent term rewriting
• On the Correctness of Bubbling
• Overlapping Rules and Logic Variables in Functional Logic Programs
• Specialization of functional logic programs based on needed narrowing
• The integration of functions into logic programming: From theory to practice

Cited in

(9)

• On term-graph rewrite strategies
• Compiling a functional logic language: \textit{The Fair Scheme}
• On the Correctness of Bubbling
• Inductively Sequential Term-Graph Rewrite Systems
• Needed computations shortcutting needed steps
• Lazy rewriting and eager machinery
• Non Strict Confluent Rewrite Systems for Data-Structures with Pointers
• Rewriting and Call-Time Choice: The HO Case
• Compiling collapsing rules in certain constructor systems

Describes a project that uses

Uses Software

• TOY
• PAKCS

This page was built for publication: Lazy context cloning for non-deterministic graph rewriting

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