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

Science of Computer Programming

Volumn 43, Issue 2-3, 2002, Pages 193-229

  Abramov, Sergei ^a   Glück, Robert ^b  

^a PROGRAM SYSTEMS INSTITUTE   (Russian Federation)

^b WASEDA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; GRAPH THEORY; LOGIC PROGRAMMING; PROGRAM INTERPRETERS;

FUNCTIONAL PROGRAMMING LANGUAGES;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0036568699     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6423(02)00023-0     Document Type: Conference Paper

References (43)

1. Metavychislenija i logicheskoe programmirovanie
2. Metavychislenija i ikh prilozhenija
3. Semantics modifiers: An approach to non-standard semantics of programming languages
4. Combining semantics with non-standard interpreter hierarchies
5. The universal resolving algorithm: Inverse computation in a functional language
6. From standard to non-standard semantics by semantics modifiers
7. The narrowing-driven approach to functional logic program specialization
8. Program inversion: More than fun!
9. EWD671: Program inversion
10. A heuristic approach to program inversion
11. Generalized partial computation
12. Occam's razor in metacomputation: The notion of a perfect process tree
13. Metacomputation as a tool for formal linguistic modeling
14. Abstraction-based partial deduction for solving inverse problems - A transformational approach to software verification (extended abstract)
15. Partial deduction and driving are equivalent
16. A roadmap to metacomputation by supercompilation
17. Application of metasystem transition to function inversion and transformation
18. Inverting programs
19. Inorder traversal of a binary tree and its inversion
20. The integration of functions into logic programming : From theory to practice
21. On the synthesis of function inverses
22. An introduction to online and offline partial evaluation using a simple flowchart language
23. The essence of program transformation by partial evaluation and driving
24. InvX: An automatic function inverter
25. Inversion of applicative programs
26. Predicate logic as programming language
27. The inversion of functions defined by turing machines
28. Recursive functions of symbolic expressions
29. Program transformation with metasystem transitions: Experiments with a supercompiler
30. The generation of inverse functions in Refal
31. Inversion and metacomputation
32. Running programs backwards : The logical inversion of imperative computation
33. Inorder traversal of a binary heap and its inversion in optimal time and space
34. On perfect supercompilation
35. A positive supercompiler
36. Ehkvivalentnye preobrazovanija rekursivnykh funkcij na Refale
37. The use of metasystem transition in theorem proving and program optimization
38. The concept of a supercompiler
39. Program transformation with metasystem transitions