Mechanically verifying the correctness of an offline partial evaluator

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

Volumn 982, Issue , 1995, Pages 279-298

  Hatcliff, John ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

BINS; COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING LANGUAGES; LOGIC PROGRAMMING; OBJECT ORIENTED PROGRAMMING; RECONFIGURABLE HARDWARE; SEMANTICS;

BINDING TIME ANALYSIS; CORRECTNESS PROOFS; DEDUCTIVE SYSTEMS; LOGIC PROGRAMS; LOGICAL FRAMEWORKS; META PROGRAMMING; NATURAL DEDUCTION; PROTOTYPE IMPLEMENTATIONS;

COMPUTER CIRCUITS;

EID: 84958617909     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0026826     Document Type: Conference Paper

References (28)

1. Yves Bertot and Ranan Fraer. Reasoning with executable specifications. In TAPSOFT’95 [27], pages 531-545.
2. Sandrine Blazy and Philippe Facon. Formal specification and prototyping of a program specializer. In TAPSOFT’95 [27], pages 666-680.
3. Charles Consel and Olivier Danvy. Tutorial notes on partial evaluation. In Susan L. Graham, editor, Proceedings of the Twentieth Annual A CM Symposium on Principles of Programming Languages, pages 493-501, Charleston, South Carolina, January 1993. ACM Press.
4. Rowan Davies and Frank Pfenning. A modal analysis of staged compuation. In Proceedings of the Workshop on Types for Program Analysis, Aarhus, Denmark, 1995.
5. Jöelle Despeyroux. Proof of translation in natural semantics. In Proceedings of the First Annual IEEE Symposium on Logic in Computer Science, pages 193-205, Cambridge, Massachusetts, 1986. IEEE Computer Society Press.
6. Robert Glück and Jesper Jørgensen. Efficient multi-level generating extensions. 1995. To appear in The Proceedings of the Seventh International Symposium on Programming Languages, Implementations, Logics and Programs. Utrecht, The Netherlands, September 20-22, 1995.
7. Carsten K. Gomard and Neil Jones. A partial evaluator for the untyped lambdacalculus. Journal of Functional Programming, 1(1):21-69, 1991.
8. Carl A. Gunter. Semantics of Programming Languages: Structures and Techniques. MIT Press, 1992.
9. John Hannah. Extended natural semantics. Journal of Functional Programming, 3(2):123-152, 1993.
10. John Hannah and Dale Miller. Deriving mixed evaluation from standard evaluation for a simple functional language. In J. van de Snepscheut, editor, Mathematics of Program Construction, number 375 in Lecture Notes in Computer Science, pages 239-255, 1989.
11. John Hannan and Frank Pfenning. Compiler verification in LF. In Proceedings of the Seventh Symposium on Logic in Computer Science, pages 407-418. IEEE, 1992.
12. Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. Journal of the ACM, 40 (1):143-184, 1993. A preliminary version appeared in the proceedings of the First IEEE Symposium on Logic in Computer Science, pages 194 204, June 1987.
13. John Hateliff. Mechanically verifying the correctness of an offline partial evaluator (extended version). DIKU Report 95/14, University of Copenhagen, Copenhagen, Denmark, 1995.
14. John Hatcliff and Olivier Danvy. A computational formalization for partial evaluation. DIKU Report 95/15, Univdrsity of Copenhagen, Copenhagen, Denmark, 1995. Presented at the Workshop on Logic, Domains, and Programming Languages. Darmstadt, Germany. May, 1995.
15. Neil D. Jones, Carsten K. Gomard, and Peter Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-HM1 International, 1993.
16. Julia L. Lawall and Olivier Danvy. Continuation-based partial evaluation. Technical Report CS-95-178, Computer Science Department, Brandeis University, Waltham, Massachusetts, January 1995. An earlier version appeared in the proceedings of the 1994 ACM Conference on Lisp and Functional Programming.
17. Spiro Michaylov and Frank Pfenning. Natural semantics and some of its metatheory in Elf. Report MPI-I-91-211, Max-Planck-Institute for Computer Science, Saarbrücken, Germany, August 1991.
18. T. Mogensen. Self-applicable partial evaluation for the pure lambda calculus. In Charles Consel, editor, ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, Research Report 909, Department of Computer Science, Yale University, pages 116-121, San Francisco, California, June 1992.
19. Jens Palsberg. Correctness of binding-time analysis. Journal of Functional Programming, 3(3):347-363, 1993.
20. Frank Pfenning. Logic programming in the LF logical framework. In Gérard Huet and Gordon Plotkin, editors, Logical Frameworks, pages 149-181. Cambridge University Press, 1991.
21. Frank Pfenning. A proof of the church-rosser theorem and its representation in a logical framework. Technical Report CMU-CS-92-186, Carnegie Mellon University, Pittsburgh, Pennsylvania, September 1992. To appear in Journal of Automated Reasoning.
22. Frank Pfenning and Conal Elliott. Higher-order abstract syntax. In Proceedings of the A CM SIGPLAN’88 Conference on Programming Languages Design and Implementation, pages 199-208, June 1988.
23. Frank Pfenning and Ekkehard Rohwedder. Implementing the meta-theory of deductive systems. In D. Kapur, editor, Proceedings of the 11th Eleventh International Conference on Automated Deduction, number 607 in Lecture Notes in Artificial Intelligence, pages 537-551, Saratoga Springs, New York, 1992. Springer-Verlag.
24. Dag Prawitz. Natural Deduction. Almquist and Wiksell, Uppsala, 1965.
25. David Sands. Total correctness by local improvement in program transformation. In Ron Cytron, editor, Proceedings of the Twenty-first Annual A CM Symposium on Principles of Programming Languages, pages 221-232, San Francisco, California, January 1995. ACM Press.
26. Morten Heine Sørensen, Robert Glück, and Neil Jones. Towards unifying partial evaluation, deforestation, supercompilation, and GPC. In Proceedings of the Fifth European Symposium on Programming, pages 485-500, Edinburgh, U.K., April 1994.
27. TAPSOFT’95: Theory and Practice of Software Development, number 915 in Lecture Notes in Computer Science, Aarhus, Denmark, May 1995.
28. Mitchell Wand. Specifying the correctness of binding-time analysis. Journal of Functional Programming, 3(3):365-387, 1993.