Principles of inverse computation and the universal resolving algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2566 LNCS, Issue , 2002, Pages 269-295

  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

PROGRAM INTERPRETERS; SEMANTICS; TREES (MATHEMATICS);

FIRST ORDER; FUNDAMENTAL CONCEPTS; INVERSE COMPUTATION; THREE-STEP APPROACH;

FUNCTIONAL PROGRAMMING;

EID: 84887888563     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36377-7_13     Document Type: Article

References (52)

1. S. M. Abramov. Metavychislenija i logicheskoe programmirovanie (Metacomputation and logic programming). Programmirovanie, 3:31-44, 1991. (In Russian).
2. S. M. Abramov, R. Gluck. Combining semantics with non-standard interpreter hierarchies. In S. Kapoor, S. Prasad (eds.), Foundations of Software Technology and Theoretical Computer Science. Proceedings, LNCS 1974, 201-213. Springer-Verlag, 2000.
3. S. M. Abramov, R.Gluck. The universal resolving algorithm: inverse computation in a functional language. In R. Backhouse, J. N. Oliveira (eds.), Mathematics of Program Construction. Proceedings, LNCS 1837, 187-212. Springer-Verlag, 2000.
4. S. M. Abramov, R.Gluck. From standard to non-standard semantics by semantics modifiers. International Journal of Foundations of Computer Science, 12(2):171-211, 2001.
5. S. M. Abramov, R. Gluck. The universal resolving algorithm and its correctness: inverse computation in a functional language. Science of Computer Programming, 43(2-3):193-229, 2002.
6. E. Albert, G. Vidal. The narrowing-driven approach to functional logic program specialization. New Generation Computing, 20(1):3-26, 2002.
7. R. Bird, O. de Moor. Algebra of Programming. Prentice Hall International Series in Computer Science. Prentice Hall, 1997.
8. W. Chen, J. T. Udding. Program inversion: More than fun! Science of Computer Programming, 15:1-13, 1990.
9. M. Davis, H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7(3):201-215, 1960.
10. E. W. Dijkstra. EWD671: Program inversion. In Selected Writings on Computing: A Personal Perspective, 351-354. Springer-Verlag, 1982.
11. D. Eppstein. A heuristic approach to program inversion. In Int. Joint Conference on Artificial Intelligence (IJCAI-85), 219-221. Morgan Kaufmann, Inc., 1985.
12. Y. Futamura. Partial evaluation of computing process-an approach to a compilercompiler. Systems, Computers, Controls, 2(5):45-50, 1971.
13. Y. Futamura, K. Nogi. Generalized partial computation. In D. Bjørner, A. P. Ershov, N. D. Jones (eds.), Partial Evaluation and Mixed Computation, 133-151. North-Holland, 1988.
14. P. C. Gilmore. A proof method for quantification theory: its justification and realization. IBM Journal of Research and Development, 4:28-35, 1960.
15. R. Gluck, A. V. Klimov. Occam's razor in metacomputation: the notion of a perfect process tree. In P. Cousot, M. Falaschi, G. File, A. Rauzy (eds.), Static Analysis. Proceedings, LNCS 724, 112-123. Springer-Verlag, 1993.
16. R. Gluck, A. V. Klimov. Metacomputation as a tool for formal linguistic modeling. In R. Trappl (ed.), Cybernetics and Systems '94, Vol. 2, 1563-1570. World Scientific, 1994.
17. R. Gluck, A. V. Klimov. A regeneration scheme for generating extensions. Information Processing Letters, 62(3):127-134, 1997.
18. R. Gluck, A. V. Klimov. On the degeneration of program generators by program composition. New Generation Computing, 16(1):75-95, 1998.
19. R. Gluck, M. Leuschel. Abstraction-based partial deduction for solving inverse problems-a transformational approach to software verification (extended abstract). In D. Bjørner, M. Broy, A. V. Zamulin (eds.), Perspectives of System Informatics. Proceedings, LNCS 1755, 93-100. Springer-Verlag, 2000.
20. R. Gluck, M. H. Sørensen. Partial deduction and driving are equivalent. In M. Hermenegildo, J. Penjam (eds.), Programming Language Implementation and Logic Programming. Proceedings, LNCS 844, 165-181. Springer-Verlag, 1994.
21. R. Gluck, M. H. Sørensen. A roadmap to metacomputation by supercompilation. In O. Danvy, R. Gluck, P. Thiemann (eds.), Partial Evaluation. Proceedings, LNCS 1110, 137-160. Springer-Verlag, 1996.
22. R. Gluck, V. F. Turchin. Application of metasystem transition to function inversion and transformation. In Int. Symposium on Symbolic and Algebraic Computation (ISSAC'90), 286-287. ACM Press, 1990.
23. C. Green. Application of theorem proving to problem solving. In D. E. Walker, L. M. Norton (eds.), Int. Joint Conference on Artificial Intelligence (IJCAI-69), 219-239. William Kaufmann, Inc., 1969.
24. D. Gries. The Science of Programming. Texts and Monographs in Computer Science. Springer-Verlag, 1981.
25. D. Gries, J. L. A. van de Snepscheut. Inorder traversal of a binary tree and its inversion. In E. W. Dijkstra (ed.), Formal Development of Programs and Proofs, 37-42. Addison Wesley, 1990.
26. M. Hanus. The integration of functions into logic programming: from theory to practice. Journal of Logic Programming, 19&20:583-628, 1994.
27. P. G. Harrison, H. Khoshnevisan. On the synthesis of function inverses. Acta Informatica, 29:211-239, 1992.
28. J. Hatcliff. An introduction to online and offline partial evaluation using a simple flowchart language. In J. Hatcliff, T. Mogensen, P. Thiemann (eds.), Partial Evaluation. Practice and Theory, LNCS 1706, 20-82. Springer-Verlag, 1999.
29. N. D. Jones. The essence of program transformation by partial evaluation and driving. In N. D. Jones, M. Hagiya, M. Sato (eds.), Logic, Language and Computation, LNCS 792, 206-224. Springer-Verlag, 1994.
30. N.D. Jones, C.K.Gomard, P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall, 1993.
31. H. Khoshnevisan, K. M. Sephton. InvX: An automatic function inverter. In N. Dershowitz (ed.), Rewriting Techniques and Applications (RTA'89), LNCS 355, 564-568. Springer-Verlag, 1989.
32. A. V. Klimov, S. A. Romanenko. Metavychislitel' dlja jazyka Refal. Osnovnye ponjatija i primery. (A metaevaluator for the language Refal. Basic concepts and examples). Preprint 71, Keldysh Institute of Applied Mathematics, Academy of Sciences of the USSR, Moscow, 1987. (in Russian).
33. R. E. Korf. Inversion of applicative programs. In Int. Joint Conference on Artificial Intelligence (IJCAI-81), 1007-1009. William Kaufmann, Inc., 1981.
34. R. Kowalski. Predicate logic as programming language. In J. L. Rosenfeld (ed.), Information Processing 74, 569-574. North-Holland, 1974.
35. M. Leuschel, T. Massart. Infinite state model checking by abstract interpretation and program specialisation. In A. Bossi (ed.), Logic-Based Program Synthesis and Transformation. Proceedings, LNCS 1817, 62-81. Springer-Verlag, 2000.
36. J. W. Lloyd. Foundations of Logic Programming. Second, extended edition. Springer-Verlag, 1987.
37. K. Marriott, P. J. Stuckey. Programming with Constraints. MIT Press, 1998.
38. J. McCarthy. The inversion of functions defined by Turing machines. In C. E. Shannon, J. McCarthy (eds.), Automata Studies, 177-181. Princeton University Press, 1956.
39. S.-C. Mu, R. Bird. Inverting functions as folds. In E. A. Boiten, B. Moller (eds.), Mathematics of Program Construction. Proceedings, LNCS 2386, 209-232. Springer-Verlag, 2002.
40. A. P. Nemytykh, V. A. Pinchuk. Program transformation with metasystem transitions: experiments with a supercompiler. In D. Bjørner, M. Broy, I. V. Pottosin (eds.), Perspectives of System Informatics. Proceedings, LNCS 1181, 249-260. Springer-Verlag, 1996.
41. J. A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1):23-41, 1965.
42. A. Y. Romanenko. The generation of inverse functions in Refal. In D. Bjørner, A. P. Ershov, N. D. Jones (eds.), Partial Evaluation and Mixed Computation, 427-444. North-Holland, 1988.
43. J. P. Secher, M. H. Sørensen. On perfect supercompilation. In D. Bjørner, M. Broy, A. Zamulin (eds.), Perspectives of System Informatics. Proceedings, LNCS 1755, 113-127. Springer-Verlag, 2000.
44. J. P. Secher, M. H. Sørensen. From checking to inference via driving and DAG grammars. In ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, 41-51. ACM Press, 2002.
45. P. Sestoft. The structure of a self-applicable partial evaluator. Technical Report 85/11, DIKU, University of Copenhagen, Denmark, Nov. 1985.
46. M. H. Sørensen, R. Gluck, N. D. Jones. A positive supercompiler. Journal of Functional Programming, 6(6):811-838, 1996.
47. L. Sterling, E. Shapiro. The Art of Prolog. Second Edition. MIT Press, 1994.
48. V. F. Turchin. Ehkvivalentnye preobrazovanija rekursivnykh funkcij na Refale (Equivalent transformations of recursive functions defined in Refal). In Teorija Jazykov i Metody Programmirovanija (Proceedings of the Symposium on the Theory of Languages and Programming Methods), 31-42, 1972. (In Russian).
49. V. F. Turchin. The use of metasystem transition in theorem proving and program optimization. In J. W. de Bak ker, J. van Leeuwen (eds.), Automata, Languages and Programming, LNCS 85, 645-657. Springer-Verlag, 1980.
50. V. F. Turchin. The concept of a supercompiler. ACM Transactions on Programming Languages and Systems, 8(3):292-325, 1986.
51. J. L. A. van de Snepscheut. What Computing is All About. Texts and Monographs in Computer Science. Springer-Verlag, 1993.
52. P. Wadler. Deforestation: transforming programs to eliminate trees. Theoretical Computer Science, 73:231-248, 1990.