Lazy context cloning for non-deterministic graph rewriting

DOI10.1016/J.ENTCS.2006.10.026zbMATH Open1278.68116OpenAlexW2130379877MaRDI QIDQ2867896FDOQ2867896

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

Recommendations

• Lazy rewriting and eager machinery
• On term-graph rewrite strategies
• Extending graph rewriting with copying
• Publication:4944885
• Non Strict Confluent Rewrite Systems for Data-Structures with Pointers

zbMATH Keywords

graph transformationsbubblingfunctional logic programmingnon-deterministic computations

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A needed narrowing strategy
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The integration of functions into logic programming: From theory to practice
• Title not available (Why is that?)
• Title not available (Why is that?)
• An approach to declarative programming based on a rewriting logic
• Nondeterministic algebraic specifications and nonconfluent term rewriting
• Evaluation strategies for functional logic programming
• Specialization of functional logic programs based on needed narrowing
• Implementing functional logic languages using multiple threads and stores
• A Virtual Machine for Functional Logic Computations
• Overlapping Rules and Logic Variables in Functional Logic Programs
• Title not available (Why is that?)
• On the Correctness of Bubbling

Cited In (9)

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

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)