Skip to main content
SpringerLink
Log in

Reasoning about Staged Computation

Abstract of Invited Talk

  • Conference paper
  • First Online:
Semantics, Applications, and Implementation of Program Generation (SAIG 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1924))

Abstract

We report on recent progress in the design of modal dependent type theories that integrate specifications into languages for expressing staged computation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Rowan Davies. A temporal logic approach to binding-time analysis. In E. Clarke, editor, Proceedings of the Eleventh Annual Symposium on Logic in Computer Science, pages 184–195, New Brunswick, New Jersey, July 1996. IEEE Computer Society Press.

    Google Scholar 

  2. Rowan Davies and Frank Pfenning. A modal analysis of staged computation. In Guy Steele, Jr., editor, Proceedings of the 23rd Annual Symposium on Principles of Programming Languages, pages 258–270, St. Petersburg Beach, Florida, January 1996. ACM Press.

    Google Scholar 

  3. Joëlle Despeyroux, Frank Pfenning, and Carsten Schürmann. Primitive recursion for higher-order abstract syntax. In R. Hindley, editor, Proceedings of the Third International Conference on Typed Lambda Calculus and Ap-plications (TLCA’97), pages 147–163, Nancy, France, April 1997. Springer-Verlag LNCL 1210. An extended version is available as Technical Report CMU-CS-96-172, Carnegie Mellon University.

    Google Scholar 

  4. M. Fairtlough and M.V. Mendler. Propositional lax logic. Information and Computation, 137(1):1–33, August 1997.

    Article  MATH  MathSciNet  Google Scholar 

  5. Per Martin-Löf. On the meanings of the logical constants and the justifications of the logical laws. Nordic Journal of Philosophical Logic, 1(1):11–60, 1996.

    MATH  MathSciNet  Google Scholar 

  6. Eugenio Moggi. Notions of computation and monads. Information and Computation, 93(1):55–92, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  7. Eugenio Moggi, Walid Taha, Zine-El-Abidine Benaissa, and Tim Sheard. An idealized MetaML: Simpler, and more expressive. In S. D. Swierstra,editor, Proceedings of the 8th European Symposium on Programming (ESOP’99), pages 193–207, Amsterdam, The Netherlands, March 1999. Springer-Verlag LNCL 1576.

    Google Scholar 

  8. Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 2000. To appear. Notes for an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA’99), Trento, Italy, July 1999.

    Google Scholar 

  9. Philip Wickline, Peter Lee, Frank Pfenning, and Rowan Davies. Modal types as staging specifications for run-time code generation. ACM Computing Surveys, 30(3es), September 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA

    Frank Pfenning

Authors
  1. Frank Pfenning
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science Eklandagatan 86, Chalmers University of Technology, 412 96, Gothenburg, Sweden

    Walid Taha

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pfenning, F. (2000). Reasoning about Staged Computation. In: Taha, W. (eds) Semantics, Applications, and Implementation of Program Generation. SAIG 2000. Lecture Notes in Computer Science, vol 1924. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45350-4_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-45350-4_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41054-6

  • Online ISBN: 978-3-540-45350-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation