Compiling collapsing rules in certain constructor systems

DOI10.1007/978-3-319-27436-2_4zbMATH Open1473.68042OpenAlexW2256007883MaRDI QIDQ5743585FDOQ5743585

Authors: Sergio Antoy, Andy Jost 

Publication date: 5 February 2016

Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL: https://pdxscholar.library.pdx.edu/compsci_fac/137

Recommendations

• Needed computations shortcutting needed steps
• Implementing first-order rewriting with constructor systems
• Lazy context cloning for non-deterministic graph rewriting
• Collapsed tree rewriting: Completeness, confluence, and modularity
• Compiling a functional logic language: \textit{The Fair Scheme}

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42)

Cites Work

• LEAN: An intermediate language based on graph rewriting
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Mechanical Evaluation of Expressions
• The integration of functions into logic programming: From theory to practice
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Evaluation strategies for functional logic programming
• Inductively Sequential Term-Graph Rewrite Systems
• Functional Logic Programming: From Theory to Curry
• Programming with narrowing: a tutorial
• Bisimilarity in term graph rewriting.
• Essentials of term graph rewriting

Cited In (3)

• On the Correctness of Bubbling
• Needed computations shortcutting needed steps
• Constructions of copy rules

Uses Software

• DACTL
• Curry
• PAKCS

This page was built for publication: Compiling collapsing rules in certain constructor systems

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