A modal analysis of staged computation

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn Conference Record of the Annual ACM Symposium on Principles of Programming Languages, Issue , 1996, Pages 258-270

  Davies, Rowan ^a   Pfenning, Frank ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTATIONAL LINGUISTICS; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; FORMAL LOGIC; PROGRAM COMPILERS;

FUNCTIONAL LANGUAGES; MODAL CORRECTNESS; MODAL RESTRICTIONS; PARTIAL EVALUATION; RUN TIME CODE GENERATION; STAGED COMPUTATION; STANDARD BINDING TIME ANALYSIS; SYNTACTIC STRUCTURING;

MODAL ANALYSIS;

EID: 0029712699     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237721.237788     Document Type: Conference Paper

References (23)

1. Gavin Bierman and Valeria de Paiva. Intuitionistic necessity revisited. In Proceedings of the Logic at Work Conference, Amsterdam, Holland, December 1992.
2. Lars Birkedal and Morten Welinder. Partial evaluation of Standard ML. Master's thesis, University of Copenhagen, Department of Computer Science, 1993. Available as Technical Report DIKU-report 93/22.
3. Dominique Clément, Joëlle Despeyroux, Thierry Despeyroux, and Gilles Kahn. A simple applicative language: Mini-ML. In Proceedings of the 1986 Conference on LISP and Functional Programming, pages 13-27. ACM Press, 1986.
4. Rowan Davies. A temporal-logic approach to binding-time analysis. Research Series RS-95-51, BRICS, Department of Computer Science, University of Aarhus, October 1995.
5. Tim Freeman and Frank Pfenning. Refinement types for ML. In Proceedings of the SIGPLAN'91 Symposzum on Language Design and Imlementation, Toronto, Ontario, pages 268-277. ACM Press, June 1991.
6. Carsten Gomard and Neil Jones. A partial evaluator for the untyped lambda-calculus. Journal of Functional Programming, 1(1):21-69, January 1991.
7. Robert Glück and Jesper Jørgensen. Efficient multi-level generating extensions for program specialization. In S.D. Swierstra and M. Hermenegildo, editors, Programming Languages, Implementations, Logics and Programs, pages 259-278. Springer-Verlag LNCS 982, September 1995.
8. John Hatcliff. Mechanically verifying the correctness of an offline partial evaluator. In S.D. Swierstra and M. Hermenegildo, editors, Programmmg Languages, Implementations, Logics and Programs. Springer-Verlag LNCS 982, September 1995.
9. Fritz Henglein. Efficient type inference for higher-order binding-time analysis. In J. Hughes, editor, Functional Programming Languages and Computer Architecture, 5th ACM Conference, pages 448-472. Springer-Verlag LNCS 523, 1991.
10. Neil D. Jones, Carsten Gomard, and Peter Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall, 1993.
11. Neil D. Jones. Efficient algebraic operations on programs. In T. Rus, editor, AMAST Preliminary Proceedings, University of Iowa, April 1991. A version appears as a chapter in [JGS93].
12. Ulrik Jørring and William L. Scherlis. Compilers and staging transformations. In Conference Record of the Thirteenth Annual ACM Symposium on Principles of Programming Languages, pages 86-96, St. Petersburg Beach, Florida, January 1986.
13. David Keppel, Susan J. Eggers, and Robert R. Henry. A case for runtime code generation. Technical Report TR 93-11-02, Department of Computer Science and Engineering, University of Washington, November 1993.
14. Saul A. Kripke. Semantic analysis of modal logic. I: Normal propositional calculi. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 9:67-96, 1963.
15. Mark Leone and Peter Lee. Deferred compilation: The automation of run-time code generation. In Proceedings of the Workshop on Partial Evaluation and Semantics-based Program Mampulation (PEPM'94), Orlando, June 1994. An earlier version appears as Carnegie Mellon School of Computer Science Technical Report CMU-CS-93-225, November 1993.
16. Simone Martini and Andrea Masini. A computational interpretation of modal proofs. In H. Wansing, editor, Proof theory of Modal Logics. Kluwer, 1994. Workshop proceedings.
17. Eugenio Moggi. Computational lambda calculus and monads. In Proceedings of the Fourth Symposium on Logic in Computer Science, pages 14-23, Asilomar, California, June 1989. IEEE Computer Society Press.
18. Flemming Nielson and Hanne Riis Nielson. Two-Level Functional Languages. Cambridge University Press, 1992.
19. Jens Palsberg. Correctness of binding time analysis. Journal of Functional Programming, 3(3):347-363, July 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 and Hao-Chi Wong. On a modal λ-calculus for S4. In S. Brookes and M. Main, editors, Proceedings of the Eleventh Conference on Mathematical Foundations of Programming Sematics, New Orleans, Louisiana, March 1995.
22. Brian Cantwell Smith. Reflection and semantics in Lisp. In Proceedings of the Eleuenth Annual ACM Symposium on Principles of Programming Languages, Salt Lake City, pages 23-35. ACM, January 1984.
23. Tim Sheard and Neal Nelson. Type safe abstractions using program generators. Technical Report OGI-TR-95-013, Oregon Graduate Institute of Science and Technology, Department of Computer Science, 1995.