The universal resolving algorithm and its correctness: Inverse computation in a functional language

DOI10.1016/S0167-6423(02)00023-0zbMath1014.68037DBLPjournals/scp/AbramovG02OpenAlexW2038870167WikidataQ62038268 ScholiaQ62038268MaRDI QIDQ700978

Robert Glück, Sergey A. Abramov

Publication date: 16 October 2002

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6423(02)00023-0

zbMATH Keywords

S-graphuniversal resolving algorithm

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Related Items (8)

Semi-inversion of Conditional Constructor Term Rewriting Systems ⋮ Tail recursion transformation for invertible functions ⋮ Reversible computing from a programming language perspective ⋮ Reverse universal resolving algorithm and inverse driving ⋮ Unnamed Item ⋮ Completion after Program Inversion of Injective Functions ⋮ A categorical foundation for structured reversible flowchart languages: Soundness and adequacy ⋮ 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