research-article

Free access

Prescriptive Frameworks for Multi-Level Lambda-Calculi

Authors:

Flemming Nielson,

Hanne Riis NielsonAuthors Info & Claims

PEPM '97: Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation

Pages 193 - 202

https://doi.org/10.1145/258993.259018

Published: 01 August 1997 Publication History

PDF eReader

Abstract

Two-level A-calculi have been heavily utilised for applications such as partial evaluation, abstract interpretation and code generation. Each of these applications pose different demands on the exact details of the twolevel structure and the corresponding inference rules. In a previous paper we have developed a descriptive framework for characterizing the key ingredients used in the various applications. Based on the insights offered by this characterisation we now develop a prescriptive framework that offers firm guidelines on what we regard as "good" definitions of multi-level lambda-calculi.

References

[1]

R. Davies and F. Pfenning: A Modal Analysis of Staged Computation. Proc. POPL'96 pp. 258-270, ACM Press, 1996.]]

Digital Library

Google Scholar

[2]

R. Glfick and J. Jcrgensen: Efficient Multi-level Generating Extensions for Program Specialization. PLILP'95, Springer Lecture Notes in Computer Science, vol. 982: pp. 259-278, 1995.]]

Digital Library

Google Scholar

[3]

J. A. Goguen and J. W. Thatcher and E. G. Wagner: An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract Data Types. Current Trends in Programming Methodology, vol. 4, (R. T. Yeh, editor), Prentice-Hall, 1978.]]

Google Scholar

[4]

F. Henglein and C. Mossin: Polyrnorphic Binding- Time Analysis. ESOP'94, Springer Lecture Notes in Computer Science, vol. 788: pp. 287-301, 1994.]]

Digital Library

Google Scholar

[5]

N. D. Jones and P. Sestoft and H. Sondergaard: An Experiment in Partial Evaluation: the Generation of a Compiler Generator. Rewriting Techniques and Applications, Springer Lecture Notes in Computer Science, vol. 202: pp. 124-140, 1985.]]

Digital Library

Google Scholar

[6]

N. D. Jones and F. Nielson: Abstract Interpretation: a Semantics-Based Tool for Program Analysis. Handbook of Logic in Computer Science, vol. 4: 527-636, Oxford University Press, 1995.]]

Digital Library

Google Scholar

[7]

F. Nielson: Two-Level Semantics and Abstract interpretation. Theoretical Computer Science Fundamental Studies, 69: 117-242, 1989.]]

Digital Library

Google Scholar

[8]

F. Nielson and H. R. Nielson: Two-level semantics and code generation. Theoretical Computer Science, 56(1): 59-133, 1988.]]

Digital Library

Google Scholar

[9]

H. R. Nielson and F. Nielson: Automatic Binding Time Analysis for a Typed,~-calculus. Science of Computer Programming, 10: 139-176, 1988.]]

Digital Library

Google Scholar

[10]

F. Nielson and H. R. Nielson: Two-Level Functional Languages. Vol. 34 of Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, 1992.]]

Digital Library

Google Scholar

[11]

F. Nielson and H. R. Nielson: Multi-Level Lambda- Calculi: an Algebraic Description. Partial Evaluation, Springer Lecture Notes in Computer Science, vol. 1110: pp. 338-354, 1996.]]

Digital Library

Google Scholar

[12]

F. Nielson and H. R. Nielson: Multi-Level Languages: a Descriptive Framework. Technical Report DAIMI PB-510, Computer Science Department, Aarhus University, 1996.]]

Crossref

Google Scholar

[13]

C. Strachey: The Varieties of Programming Languages. Technical Monograph PRG-10, Programming Research Group, University of Oxford, 1973.]]

Google Scholar

[14]

M. Wirsing: Algebraic Specification. Handbook of Theoretical Computer Science: Formal Models and Semantics, vol. B: 675-788, Elsevier (and MIT Press), 1990.]]

Digital Library

Google Scholar

Cited By

View all

Lee PLeone M(2004)Optimizing ML with run-time code generationACM SIGPLAN Notices10.1145/989393.98944839:4(540-553)Online publication date: 1-Apr-2004
https://dl.acm.org/doi/10.1145/989393.989448
Wang ZMuntz RCzarnecki KPfenning FSmaragdakis Y(2003)On stage ordering in staged computationProceedings of the 2nd international conference on Generative programming and component engineering10.5555/954186.954191(77-96)Online publication date: 22-Sep-2003
https://dl.acm.org/doi/10.5555/954186.954191
Taha WNielsen M(2003)Environment classifiersACM SIGPLAN Notices10.1145/640128.60413438:1(26-37)Online publication date: 15-Jan-2003
https://dl.acm.org/doi/10.1145/640128.604134
Show More Cited By

Index Terms

Prescriptive Frameworks for Multi-Level Lambda-Calculi
1. Mathematics of computing
  1. Continuous mathematics
    1. Calculus
      1. Lambda calculus
  2. Mathematical analysis
    1. Calculus
      1. Lambda calculus

Recommendations

Prescriptive Frameworks for Multi-Level Lambda-Calculi

Two-level A-calculi have been heavily utilised for applications such as partial evaluation, abstract interpretation and code generation. Each of these applications pose different demands on the exact details of the twolevel structure and the ...
Natural Deduction Calculi and Sequent Calculi for Counterfactual Logics

In this paper we present labelled sequent calculi and labelled natural deduction calculi for the counterfactual logics CK + {ID, MP}. As for the sequent calculi we prove, in a semantic manner, that the cut-rule is admissible. As for the natural ...
Infinitary Lambda Calculi from a Linear Perspective
LICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science

We introduce a linear infinitary λ-calculus, called ℓΛ∞, in which two exponential modalities are available, the first one being the usual, finitary one, the other being the only construct interpreted coinductively. The obtained calculus embeds the ...

Comments

Information & Contributors

Information

Published In

PEPM '97: Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation

December 1997

217 pages

ISBN:0897919173

DOI:10.1145/258993

Chairmen:
John Gallagher
Univ. of Bristol
,
Charles Consel
Univ. of Rennes/Irisa
,
Editor:
A. Michael Berman
Rowan Univ., Glassboro, NJ

ACM SIGPLAN Notices Volume 32, Issue 12
Dec. 1997
217 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/258994
Chairmen:
John Gallagher
Univ. of Bristol
,
Charles Consel
Univ. of Rennes/Irisa
,
Editor:
A. Michael Berman
Rowan Univ., Glassboro, NJ
Issue’s Table of Contents

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1997

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article
Refereed

Conference

PEPM97

Sponsor:

SIGPLAN

PEPM97: Symposium on Partial Evaluation and Semantics-Based Program Manipulation

June 12 - 13, 1997

Amsterdam, The Netherlands

Acceptance Rates

Overall Acceptance Rate 66 of 120 submissions, 55%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
292
Total Downloads

Downloads (Last 12 months)56
Downloads (Last 6 weeks)18

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Lee PLeone M(2004)Optimizing ML with run-time code generationACM SIGPLAN Notices10.1145/989393.98944839:4(540-553)Online publication date: 1-Apr-2004
https://dl.acm.org/doi/10.1145/989393.989448
Wang ZMuntz RCzarnecki KPfenning FSmaragdakis Y(2003)On stage ordering in staged computationProceedings of the 2nd international conference on Generative programming and component engineering10.5555/954186.954191(77-96)Online publication date: 22-Sep-2003
https://dl.acm.org/doi/10.5555/954186.954191
Taha WNielsen M(2003)Environment classifiersACM SIGPLAN Notices10.1145/640128.60413438:1(26-37)Online publication date: 15-Jan-2003
https://dl.acm.org/doi/10.1145/640128.604134
Taha WNielsen MAiken AMorrisett G(2003)Environment classifiersProceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/604131.604134(26-37)Online publication date: 15-Jan-2003
https://dl.acm.org/doi/10.1145/604131.604134
Taha WSheard T(2000)MetaML and multi-stage programming with explicit annotationsTheoretical Computer Science10.1016/S0304-3975(00)00053-0248:1-2(211-242)Online publication date: 6-Oct-2000
https://dl.acm.org/doi/10.1016/S0304-3975%2800%2900053-0
Glück RJørgensen J(1999)Multi-Level SpecializationPartial Evaluation10.1007/3-540-47018-2_13(326-337)Online publication date: 1999
https://doi.org/10.1007/3-540-47018-2_13
Glück RJørgensen J(1998)Multi-Level Specialization (Extended Abstract)Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School10.5555/645795.665907(326-337)Online publication date: 29-Jun-1998
https://dl.acm.org/doi/10.5555/645795.665907
Leone MLee P(1998)Dynamic specialization in the Fabius systemACM Computing Surveys10.1145/289121.28914430:3es(23-es)Online publication date: 1-Sep-1998
https://dl.acm.org/doi/10.1145/289121.289144
Wang ZMuntz R(2003)On Stage Ordering in Staged ComputationGenerative Programming and Component Engineering10.1007/978-3-540-39815-8_5(77-96)Online publication date: 2003
https://doi.org/10.1007/978-3-540-39815-8_5

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Prescriptive Frameworks for Multi-Level Lambda-Calculi

Natural Deduction Calculi and Sequent Calculi for Counterfactual Logics

Infinitary Lambda Calculi from a Linear Perspective