The universal resolving algorithm and its correctness: Inverse computation in a functional language
From MaRDI portal
Publication:700978
Recommendations
Cited in
(14)- Tail recursion transformation for invertible functions
- An universal resolving algorithm for inverse computation of lazy languages
- Semi-inversion of conditional constructor term rewriting systems
- scientific article; zbMATH DE number 1612493 (Why is no real title available?)
- Completion after program inversion of injective functions
- scientific article; zbMATH DE number 1953282 (Why is no real title available?)
- Reversible computing from a programming language perspective
- Reverse universal resolving algorithm and inverse driving
- Solving and analyzing PDOL inverse process
- Jeopardy: an invertible functional programming language
- Polynomial-time inverse computation for accumulative functions with multiple data traversals
- A categorical foundation for structured reversible flowchart languages: soundness and adequacy
- scientific article; zbMATH DE number 7455733 (Why is no real title available?)
- Characterizing Compatible View Updates in Syntactic Bidirectionalization
This page was built for publication: The universal resolving algorithm and its correctness: 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 Q700978)
