The universal resolving algorithm: Inverse computation in a functional language

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

Volumn 1837, Issue , 2000, Pages 187-212

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

^a RUSSIAN ACADEMY OF SCIENCES   (Russian Federation)

^b WASEDA UNIVERSITY   (Japan)

^c UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MATCHING;

FINITE TIME; FIRST-ORDER FUNCTIONAL LANGUAGES; FUNCTIONAL LANGUAGES; FUNCTIONAL PROGRAMS; INVERSE COMPUTATION; S-GRAPH; SOUND AND COMPLETE; WHILE-PROGRAMS;

TREES (MATHEMATICS);

EID: 84976489987     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722010_13     Document Type: Conference Paper

References (30)

1. S. M. Abramov. Metavychislenija i logicheskoe programmirovanie (Metacomputation and logic programming). Programmirovanie, 3: 31-44, 1991. (In Russian).
2. S. M. Abramov. Metavychislenija i ikh prilozhenija (Metacomputation and its applications). Nauka-Fizmatlit, Moscow 1995. (In Russian).
3. S. M. Abramov, R. Glück. From standard to non-standard semantics by semantics modifiers. International Journal of Foundations of Computer Science, to appear.
4. S. M. Abramov, R. Glück. Semantics modifiers: an approach to non-standard semantics of programming languages. In M. Sato, Y. Toyama (eds.), Third Intern. Symposium on Functional and Logic Programming, 247-270. World Scientific, 1998.
5. R. Bird, O. de Moor. Algebra of Programming. International Series in Computer Science. Prentice Hall, 1997.
6. W. Chen, J. T. Udding. Program inversion: More than fun! Science of Computer Programming, 15: 1-13, 1990.
7. E. W. Dijkstra. EWD671: Program inversion. In Selected Writings on Computing: A Personal Perspective, 351-354. Springer-Verlag, 1982.
8. P. Dybjer. Inverse image analysis generalises strictness analysis. Information and Computation, 90(2): 194-216, 1991.
9. D. Eppstein. A heuristic approach to program inversion. In Intern. Joint Conf. on Artificial Intelligence (IJCAI-85), 219-221. William Kaufmann Inc., 1985.
10. Y. Futamura, K. Nogi, A. Takano. Essence of generalized partial computation. Theoretical Computer Science, 90(1): 61-79, 1991.
11. R. Glück, J. Hatcliff, J. Jørgensen. Generalization in hierarchies of online program specialization systems. In P. Flener (ed.), Logic-Based Program Synthesis and Transformation. Proceedings, LNCS 1559, 179-198. Springer-Verlag, 1999.
12. R. Glück, A. V. Klimov. Occam’s razor in metacomputation: the notion of a perfect process tree. In P. Cousot et al. (eds.), Static Analysis. Proceedings, LNCS 724, 112-123. Springer-Verlag, 1993.
13. R. Glück, A. V. Klimov. Metacomputation as a tool for formal linguistic modeling. In R. Trappl (ed.), Cybernetics and Systems’94, 1563-1570. World Scientific, 1994.
14. R. Glück, 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.
15. R. Glück, M. H. Sørensen. A roadmap to metacomputation by supercompilation. In O. Danvy et al. (eds.), Partial Evaluation. Proceedings, LNCS 1110, 137-160. Springer-Verlag, 1996.
16. D. Gries. Inverting programs (chapter 21). In The Science of Programming, 265-274. Springer-Verlag, 1981.
17. 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.
18. P. G. Harrison, H. Khoshnevisan. On the synthesis of function inverses. Acta Informatica, 29: 211-239, 1992.
19. N. D. Jones. The essence of program transformation by partial evaluation and driving. In N. D. Jones et al. (eds.), Logic, Language and Computation. LNCS 792, 206-224. Springer-Verlag, 1994.
20. 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.
21. R. E. Korf. Inversion of applicative programs. In Proceedings of the Seventh Intern. Joint Conference on Artificial Intelligence (IJCAI-81), 1007-1009. William Kaufmann, Inc., 1981.
22. 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.
23. A. P. Nemytykh, V. A. Pinchuk. Program transformation with metasystem transitions: experiments with a supercompiler. In D. Bjørner et al. (eds.), Perspectives of System Informatics, LNCS 1181, 249-260. Springer-Verlag, 1996.
24. M. Ogawa. Automatic verification based on abstract interpretation. In A. Middeldorp, T. Sato (eds.), Functional and Logic Programming. Proceedings, LNCS 1722, 131-146. Springer-Verlag, 1999.
25. A. Y. Romanenko. The generation of inverse functions in Refal. In D. Bjørner et al. (eds.), Partial Evaluation and Mixed Computation, 427-444. North-Holland, 1988.
26. B. J. Ross. Running programs backwards: the logical inversion of imperative computation. Formal Aspects of Computing, 9: 331-348, 1997.
27. P. Sestoft. The structure of a self-applicable partial evaluator. Technical Report 85/11, DIKU, University of Copenhagen, Denmark, 1985.
28. 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 Symp. on the Theory of Languages and Programming Methods), 31-42, 1972. (In Russian).
29. V. F. Turchin. The concept of a supercompiler. ACM Transactions on Programming Languages and Systems, 8(3): 292-325, 1986.
30. V. F. Turchin. Program transformation with metasystem transitions. Journal of Functional Programming, 3(3): 283-313, 1993.