Semi-inversion of guarded equations

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

Volumn 3676 LNCS, Issue , 2005, Pages 189-204

  Mogensen, Torben A E ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; MATHEMATICAL OPERATORS; NUMERICAL ANALYSIS;

GUARDED EQUATIONS; SEMI-INVERSION; SEMI-INVERTED FUNCTIONS;

COMPUTER SOFTWARE;

EID: 33646152745     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11561347_14     Document Type: Conference Paper

References (14)

1. Anders Bondorf. Improving binding times without explicit CPS-conversion. In ACM Conference on Lisp and Functional Programming, pages 1-10. ACM Press, 1992.
2. Edsger W. Dijkstra. Program inversion. In F. L. Bauer and M. Broy, editors, Program Construction: International Summer School, LNCS 69, pages 54-57. Springer-Verlag, 1978.
3. Robert Glück. Jones optimality, binding-time improvements, and the strength of program specializers. In Proceedings of the Asian Symposium on Partial Evaluation and SemanticsBased Program Manipulation, pages 9-19. ACM Press, 2002.
4. Robert Glück and Masahiko Kawabe. Derivation of deterministic inverse programs based on LR parsing. In Yukiyoshi Kameyama and Peter J. Stuckey, editors, Functional and Logic Programming. Proceedings, LNCS 2998, pages 291-306. Springer-Verlag, 2004.
5. David Gries. The Science of Programming, chapter 21 Inverting Programs, pages 265-274. Texts and Monographs in Computer Science. Springer-Verlag, 1981.
6. Garsten Kehler Holst and John Hughes. Towards binding-time improvement for free. In [7], pages 83-100, 1991.
7. Simon L. Peyton Jones, Graham Hutton, and Garsten Kehler Holst, editors. Functional Programming, Glasgow 1990. Workshops in Computing. Springer-Verlag, August 1991.
8. Ed Knapen. Relational programming, program inversion and the derivation of parsing algorithms. Master's thesis, Eindhoven University of Technology, 1993.
9. J. Launchbury. Projection Factorisations in Partial Evaluation. Distinguished Dissertations in Computer Science. Cambridge University Press, 1991.
10. John Launchbury. Projections for specialisation. In Dines Bjørner, Andrei P. Ershov, and Neil D. Jones, editors, Partial Evaluation and Mixed Computation, pages 299-315. NorthHolland, 1988.
11. Shin-Cheng Mu, Zhenjiang Hu, and Masato Takeichi. An injective language for reversible computation. In Dexter Kozen, editor, Mathematics of Program Construction. Proceedings, LNCS 3125, pages 289-313. Springer-Verlag, 2004.
12. A. Y. Romanenko. The generation of inverse functions in Refal. In Dines Bjømer, Andrei P. Ershov, and Neil D. Jones, editors, Partial Evaluation and Mixed Computation, pages 427-444. North-Holland, 1988.
13. Leon Sterling and Ehud Shapiro. The Art of Prolog. Second Edition. MIT Press, Cambridge, Massachusetts, 1994.
14. Valentin F. Turchin. The use of metasystem transition in theorem proving and program optimization. In J. W. de Bakker and J. van Leeuwen, editors, Automata, Languages and Programming, LNCS 85, pages 645-657. Springer-Verlag, 1980.