On the logical foundations of staged computation (invited talk)
Page 33
Abstract
Dividing a computation into stages and optimizing later phases using information from earlier phases is a familiar technique in algorithm design. In the realm of programming languages, staged computation has found two important realizations: partial evaluation and run-time code generation. A priori, these are fundamentally operational concepts, concerned with how a program executes, but not what it computes.
In this talk we provide a logical foundation for staged computation which is consistent with the operational intuition. We concentrate on run-time code generation which is related to modal logic via an interpretation of constructive proofs as programs. This correspondence yields new insights into issues of language design and leads to a static type system in which staging errors become type errors. We sketch the language PML (for Phased ML), whose design has been directly motivated by our foundational reconstruction, and discuss our ongoing compiler construction effort [1; 2; 3; 4].
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.
[2]
Rowan Davies and Frank Pfenning. A modal analysis of staged computation. Submitted. Available as Technical Report CMU-CS-99-153, August 1999. A preliminary version appeared 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.
[3]
Philip Wickline, Peter Lee, and Frank Pfenning. Run-time code generation and modal-ML. In Keith D. Cooper, editor, Proceedings of the Conference on Programming Language Design and Implementation (PLDI'98), pages 224-235, Montreal, Canada, June 1998. ACM Press.
[4]
Philip Wickline, Peter Lee, Frank Pfenning, and Rowan Davies. Modal types as staging specifications for run-time code generation. A CM Computing Surveys, 30(3es), September 1998.
Index Terms
- On the logical foundations of staged computation (invited talk)
Recommendations
On the logical foundations of staged computation (invited talk)
Dividing a computation into stages and optimizing later phases using information from earlier phases is a familiar technique in algorithm design. In the realm of programming languages, staged computation has found two important realizations: partial ...
POPLMark reloaded: mechanizing logical relations proofs (invited talk)
CPP 2018: Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and ProofsMechanizing formal systems, given via axioms and inference rules, together with proofs about them plays an important role in establishing trust in formal developments. Over the past decade, the POPLMark challenge popularized the use of proof assistants ...
A linear logical framework in Hybrid (invited talk)
CPP 2019: Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and ProofsWe present a linear logical framework implemented within the Hybrid system [Felty and Momigliano 2012]. Hybrid is designed to support the use of higher-order abstract syntax for representing and reasoning about formal systems, implemented in the Coq ...
Comments
Information & Contributors
Information
Published In
Nov. 1999113 pages
Copyright © 1999 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 November 1999
Check for updates
Qualifiers
- Article
Conference
PEPM00
Sponsor:
PEPM00: 2000 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Manipulation
January 22 - 23, 2000
Massachusetts, Boston, USA
Acceptance Rates
PEPM '00 Paper Acceptance Rate 11 of 20 submissions, 55%;
Overall Acceptance Rate 66 of 120 submissions, 55%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 280Total Downloads
- Downloads (Last 12 months)49
- Downloads (Last 6 weeks)9
Reflects downloads up to 09 Nov 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in