Semi-inversion of conditional constructor term rewriting systems
From MaRDI portal
Publication:5097640
Recommendations
Cites work
- scientific article; zbMATH DE number 1729952 (Why is no real title available?)
- scientific article; zbMATH DE number 3716761 (Why is no real title available?)
- scientific article; zbMATH DE number 1405447 (Why is no real title available?)
- A method for automatic program inversion based on LR(0) parsing
- A program inverter for a functional language with equality and constructors.
- Automatic Partial Inversion of Inductively Sequential Functions
- Determinization of conditional term rewriting systems
- Program inversion for tail recursive functions
- Programming with narrowing: a tutorial
- Reversible Machine Code and Its Abstract Processor Architecture
- Reversible computation in term rewriting
- Term Rewriting and All That
- Term Rewriting and Applications
- The integration of functions into logic programming: From theory to practice
- The universal resolving algorithm and its correctness: Inverse computation in a functional language
Cited in
(5)
This page was built for publication: Semi-inversion of conditional constructor term rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5097640)