The universal resolving algorithm: Inverse computation in a functional language
From MaRDI portal
Recommendations
- The universal resolving algorithm and its correctness: Inverse computation in a functional language
- An universal resolving algorithm for inverse computation of lazy languages
- scientific article; zbMATH DE number 1953282
- Reverse universal resolving algorithm and inverse driving
- Metacomputation and logic programming
Cited in
(15)- Metacomputation and logic programming
- On the synthesis of function inverses
- Reversible computing from a programming language perspective
- Merging hierarchically-structured documents in workflow systems
- Relations as executable specifications: taming partiality and non-determinism using invariants
- An universal resolving algorithm for inverse computation of lazy languages
- scientific article; zbMATH DE number 1953282 (Why is no real title available?)
- Reverse universal resolving algorithm and inverse driving
- A categorical foundation for structured reversible flowchart languages: soundness and adequacy
- scientific article; zbMATH DE number 7455733 (Why is no real title available?)
- Polynomial-time inverse computation for accumulative functions with multiple data traversals
- The narrowing-driven approach to functional logic program specialization
- The universal resolving algorithm and its correctness: Inverse computation in a functional language
- PEARL: a partial evaluation toolbox for a reversible language
- Solving and analyzing PDOL inverse process
This page was built for publication: The universal resolving algorithm: Inverse computation in a functional language
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2721101)