Lazy Context Cloning for Non-Deterministic Graph Rewriting

DOI10.1016/j.entcs.2006.10.026zbMath1278.68116OpenAlexW2130379877MaRDI QIDQ2867896

Daniel W. Brown, Sergio Antoy, 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

graph transformationsbubblingfunctional logic programmingnon-deterministic computations

Mathematics Subject Classification ID

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

Related Items (5)

Compiling a Functional Logic Language: The Fair Scheme ⋮ Unnamed Item ⋮ Inductively Sequential Term-Graph Rewrite Systems ⋮ Rewriting and Call-Time Choice: The HO Case ⋮ On Term-Graph Rewrite Strategies

Uses Software

• TOY
• PAKCS

Cites Work

• Evaluation strategies for functional logic programming
• Specialization of functional logic programs based on needed narrowing
• A needed narrowing strategy
• On the Correctness of Bubbling
• Nondeterministic algebraic specifications and nonconfluent term rewriting
• The integration of functions into logic programming: From theory to practice
• An approach to declarative programming based on a rewriting logic
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lazy Context Cloning for Non-Deterministic Graph Rewriting