期刊文献+

Inverse Computation and the Universal Resolving Algorithm

Inverse Computation and the Universal Resolving Algorithm
下载PDF
导出
摘要 We survey fundamental concepts for inverse programming and then present the Universal Resolving Algorithm, an algorithm for inverse computation in a first order, functional programming language. We discuss the key concepts of the algorithm, including a three step approach based on the notion of a perfect process tree, and demonstrate our implementation with several examples of inverse computation. We survey fundamental concepts for inverse programming and then present the Universal Resolving Algorithm, an algorithm for inverse computation in a first order, functional programming language. We discuss the key concepts of the algorithm, including a three step approach based on the notion of a perfect process tree, and demonstrate our implementation with several examples of inverse computation.
出处 《Wuhan University Journal of Natural Sciences》 CAS 2001年第Z1期31-45,共15页 武汉大学学报(自然科学英文版)
关键词 inverse programming perfect process tree program transformation inverse interpretation program inversion functional languages inverse programming perfect process tree program transformation inverse interpretation program inversion functional languages
  • 相关文献

参考文献15

  • 1Robert Glück,Andrei Klimov.On the degeneration of program generators by program composition[J]. New Generation Computing . 1998 (1)
  • 2Brian J. Ross.Running programs backwards: The logical inversion of imperative computation[J]. Formal Aspects of Computing . 1997 (3)
  • 3P. G. Harrison,H. Khoshnevisan.On the synthesis of function inverses[J]. Acta Informatica . 1992 (3)
  • 4Hanus M.The Integration of Functions Into Logic Programming: From Theory to Practice. J ournal of Logic Programming . 1994
  • 5Turchin V F.The Concept of a Supercompiler. Transactions on Programming Languages and Systems . 1986
  • 6Gl ck R,Klimov A V.A Regeneration Scheme for Generating Extensions. I nformation Processing Letters . 1997
  • 7Wadler P.Deforestation: Transforming Programs to Eliminate Trees. Theoretical Computer Science . 1990
  • 8Sterling L,Shapiro E.The Art of Prolog. . 1986
  • 9van de Snepscheut J L A.What Computing is all About. . 1993
  • 10McCarthy J.Recursive Functions of Symbolic Expressions. Communications of the ACM . 1960

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部