research-article

Toward introducing binding-time analysis to MetaOCaml

Author:

Kenichi AsaiAuthors Info & Claims

PEPM '16: Proceedings of the 2016 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation

Pages 97 - 102

https://doi.org/10.1145/2847538.2847547

Published: 11 January 2016 Publication History

Get Access

Abstract

This paper relates 2-level lambda-calculus and staged lambda-calculus (restricted to 2 stages) to obtain monovariant binding-time analysis for lambda-calculus that produces the output in the form of staging annotations. The relationship between the two lambda-calculi provides us with a precise and easy instruction on how to implement binding-time analysis to be incorporated in the staged lambda-calculus. It forms a basis for introducing binding-time analysis to full-fledged staged languages such as MetaOCaml.

Supplementary Material

Auxiliary Archive (p97-asai-s.zip)

The appendix presents all the proofs omitted in the main content of the paper.

Download
116.48 KB

References

[1]

Asai, K. “Compiling a Reflective Language using MetaOCaml,” Proceedings of the 2014 International Conference on Generative Programming: Concepts and Experiences (GPCE ’14), pp. 113–122 (September 2014).

Digital Library

Google Scholar

[2]

Glück, R., and J. Jørgensen “An Automatic Program Generator for Multi-Level Specialization,” Lisp and Symbolic Computation, Vol. 10, No. 2, pp. 113–158, Kluwer Academic Publishers (July 1997).

Digital Library

Google Scholar

[3]

Gomard, C. K. “A Self-Applicable Partial Evaluator for the Lambda Calculus: Correctness and Pragmatics,” ACM Transactions on Programming Languages and Systems, Vol. 14, No. 2, pp. 147–172 (April 1992).

Digital Library

Google Scholar

[4]

Henglein, F. “Efficient Type Inference for Higher-Order Binding-Time Analysis,” In J. Hughes, editor, Functional Programming Languages and Computer Architecture (LNCS 523), pp. 448–472 (August 1991).

Digital Library

Google Scholar

[5]

Jones, N. D., C. K. Gomard, and P. Sestoft Partial Evaluation and Automatic Program Generation, New York: Prentice-Hall (1993).

Digital Library

Google Scholar

[6]

Kiselyov, O. “The Design and Implementation of BER MetaOCaml, System Description,” In M. Codish, and E. Sumii, editors, Functional and Logic Programming (LNCS 8475), pp. 86–102 (June 2014).

Crossref

Google Scholar

[7]

Linger, N., and T. Sheard “Binding-Time Analysis for MetaML via Type Inference and Constraint Solving,” In K. Jensen and A. Podelski, editors, Tools and Algorithms for the Construction and Analysis of Systems (LNCS 2988), pp. 266–279 (March 2004).

Google Scholar

[8]

Sheard, T., N. Linger “Search-Based Binding Time Analysis using Type-Directed Pruning,” Proceedings of the Asian Symposium on Partial Evaluation and Semantics-Based Program Manipulation (ASIAPEPM’02), pp. 20–31 (September 2002).

Digital Library

Google Scholar

[9]

Taha, W. “A Gentle Introduction to Multi-stage Programming,” In C. Lengauer, D. Batory, C. Consel, and M. Odersky, editors, Domain-Specific Program Generation (LNCS 3016), pp. 30–50 (2004).

Crossref

Google Scholar

Cited By

View all

Szokoli MKiss A(2021)Enhanced type inference for binding-time analysisActa Universitatis Sapientiae, Informatica10.2478/ausi-2020-001412:2(232-250)Online publication date: 29-Jan-2021
https://doi.org/10.2478/ausi-2020-0014
Leißa RBoesche KHack SPérard-Gayot AMembarth RSlusallek PMüller ASchmidt B(2018)AnyDSL: a partial evaluation framework for programming high-performance librariesProceedings of the ACM on Programming Languages10.1145/32764892:OOPSLA(1-30)Online publication date: 24-Oct-2018
https://dl.acm.org/doi/10.1145/3276489

Index Terms

Toward introducing binding-time analysis to MetaOCaml
1. Theory of computation

Recommendations

Compiling a reflective language using MetaOCaml
GPCE 2014: Proceedings of the 2014 International Conference on Generative Programming: Concepts and Experiences

A reflective language makes the language semantics open to user programs and allows them to access, extend, and modify it from within the same language framework. Because of its high flexibility and expressiveness, it can be an ideal platform for ...
Compiling a reflective language using MetaOCaml
GPCE '14

A reflective language makes the language semantics open to user programs and allows them to access, extend, and modify it from within the same language framework. Because of its high flexibility and expressiveness, it can be an ideal platform for ...
A Two-Phase Binding-Time Analysis in Partial Evaluation for XQuery
CSIE '09: Proceedings of the 2009 WRI World Congress on Computer Science and Information Engineering - Volume 07

Since a binding-time analysis determines how an off-line partial evaluation system will specialize a program, the accuracy of the binding-time analysis directly determines the degree of specialization. In this paper, a binding-time analysis for the ...

Comments

Information & Contributors

Information

Published In

PEPM '16: Proceedings of the 2016 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation

January 2016

108 pages

ISBN:9781450340977

DOI:10.1145/2847538

Program Chairs:
Martin Erwig
Oregon State University, USA
,
Tiark Rompf
Purdue University, USA

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]

In-Cooperation

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 January 2016

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Japan Society for the Promotion of Science

Conference

POPL '16

Sponsor:

SIGPLAN

POPL '16: The 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

January 18 - 19, 2016

FL, St. Petersburg, USA

Acceptance Rates

Overall Acceptance Rate 66 of 120 submissions, 55%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
102
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)3

Reflects downloads up to 16 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Szokoli MKiss A(2021)Enhanced type inference for binding-time analysisActa Universitatis Sapientiae, Informatica10.2478/ausi-2020-001412:2(232-250)Online publication date: 29-Jan-2021
https://doi.org/10.2478/ausi-2020-0014
Leißa RBoesche KHack SPérard-Gayot AMembarth RSlusallek PMüller ASchmidt B(2018)AnyDSL: a partial evaluation framework for programming high-performance librariesProceedings of the ACM on Programming Languages10.1145/32764892:OOPSLA(1-30)Online publication date: 24-Oct-2018
https://dl.acm.org/doi/10.1145/3276489

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.

Cited By

Index Terms

Recommendations

Compiling a reflective language using MetaOCaml

Compiling a reflective language using MetaOCaml

A Two-Phase Binding-Time Analysis in Partial Evaluation for XQuery