Compiling Collapsing Rules in Certain Constructor Systems
From MaRDI portal
Publication:5743585
DOI10.1007/978-3-319-27436-2_4zbMath1473.68042OpenAlexW2256007883MaRDI QIDQ5743585
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
Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Programming with narrowing: a tutorial
- LEAN: An intermediate language based on graph rewriting
- Bisimilarity in term graph rewriting.
- Evaluation strategies for functional logic programming
- Inductively Sequential Term-Graph Rewrite Systems
- The integration of functions into logic programming: From theory to practice
- Functional Logic Programming: From Theory to Curry
- Essentials of Term Graph Rewriting
- The Mechanical Evaluation of Expressions
This page was built for publication: Compiling Collapsing Rules in Certain Constructor Systems