Semi-inversion of conditional constructor term rewriting systems
From MaRDI portal
Recommendations
- Partial inversion of constructor term rewriting systems
- Program inversion for tail recursive functions
- A program inverter for a functional language with equality and constructors.
- Completion after program inversion of injective functions
- Automatic Partial Inversion of Inductively Sequential Functions
Cites work
- A method for automatic program inversion based on LR(0) parsing
- A program inverter for a functional language with equality and constructors.
- Advanced topics in term rewriting
- Automatic Partial Inversion of Inductively Sequential Functions
- Determinization of conditional term rewriting systems
- scientific article; zbMATH DE number 3716761 (Why is no real title available?)
- Partial inversion of constructor term rewriting systems
- Program inversion for tail recursive functions
- Programming with narrowing: a tutorial
- Reversible computation in term rewriting
- Reversible Machine Code and Its Abstract Processor Architecture
- Term Rewriting and All That
- The integration of functions into logic programming: From theory to practice
- The universal resolving algorithm and its correctness: Inverse computation in a functional language
- Transforming conditional rewrite systems with extra variables into unconditional systems
Cited in
(6)- Statement inversion and strongest postcondition
- Reversible computing from a programming language perspective
- Completion after program inversion of injective functions
- Program inversion for tail recursive functions
- Partial inversion of constructor term rewriting systems
- Automatic generation of generators for property-based testing with inverse interpretation
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)