Reverse universal resolving algorithm and inverse driving

DOI10.1016/j.jlap.2011.12.002zbMath1246.68076OpenAlexW2059605949MaRDI QIDQ444478

Thomas Pécseli

Publication date: 14 August 2012

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2011.12.002

zbMATH Keywords

drivingflowchart programminginverse drivinginverse interpretationreverse URAsupercompilation

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Semantics in the theory of computing (68Q55) General topics in the theory of software (68N01)

Uses Software

• Refal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The universal resolving algorithm and its correctness: Inverse computation in a functional language
• An Universal Resolving Algorithm for Inverse Computation of Lazy Languages
• The concept of a supercompiler
• A positive supercompiler
• FROM STANDARD TO NON-STANDARD SEMANTICS BY SEMANTICS MODIFIERS
• Functional and Logic Programming
• Programming Languages and Systems

This page was built for publication: Reverse universal resolving algorithm and inverse driving