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

DOI10.1016/S0167-6423(02)00023-0zbMATH Open1014.68037DBLPjournals/scp/AbramovG02OpenAlexW2038870167WikidataQ62038268 ScholiaQ62038268MaRDI QIDQ700978FDOQ700978

S. A. Abramov, Robert Glück

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

Recommendations

• scientific article; zbMATH DE number 1612493
• An universal resolving algorithm for inverse computation of lazy languages
• scientific article; zbMATH DE number 1953282
• Reverse universal resolving algorithm and inverse driving
• scientific article; zbMATH DE number 4011905

zbMATH Keywords

S-graphuniversal resolving algorithm

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Cited In (12)

• Title not available (Why is that?)
• Characterizing Compatible View Updates in Syntactic Bidirectionalization
• Tail recursion transformation for invertible functions
• Semi-inversion of Conditional Constructor Term Rewriting Systems
• Title not available (Why is that?)
• Reversible computing from a programming language perspective
• Solving and analyzing PDOL inverse process
• Reverse universal resolving algorithm and inverse driving
• Title not available (Why is that?)
• Completion after Program Inversion of Injective Functions
• Jeopardy: an invertible functional programming language
• A categorical foundation for structured reversible flowchart languages: Soundness and adequacy

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)