A computational formalization for partial evaluation

Authors:
John Hatcliff;Olivier Danvy
Affiliations:
Department of Computer Science, Oklahoma State University, 219 Mathematical Sciences, Stillwater, OK, 74078-1053, USA. E-mail: hatcliff@a.cs.okstate.edu;BRICS, Department of Computer Science, Aarhus University, Ny Munkegade, Building 540, DK-8000 Aarhus C, Denmark. E-mail: danvy@brics.dk
Venue:
Mathematical Structures in Computer Science
Year:
1997

Citing 41
Cited 26

Proofs and types

Proofs and types
Partial evaluation is fuller laziness

PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Notions of computation and monads

Information and Computation
Automatic autoprojection of recursive equations with global variable and abstract data types

Science of Computer Programming
A strongly-typed self-applicable partial evaluator

Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
For a better support of static data flow

Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
A self-applicable partial evaluator for the lambda calculus: correctness and pragmatics

ACM Transactions on Programming Languages and Systems (TOPLAS)
Semantics with applications: a formal introduction

Semantics with applications: a formal introduction
Two-level functional languages

Two-level functional languages
Semantics of programming languages: structures and techniques

Semantics of programming languages: structures and techniques
A theory for program and data type specification

Theoretical Computer Science - Selected papers on theoretical issues of design and implementation of symbolic computation systems
Improving binding times without explicit CPS-conversion

LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
The essence of functional programming

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
CPS-transformation after strictness analysis

ACM Letters on Programming Languages and Systems (LOPLAS)
Partial evaluation and automatic program generation

Partial evaluation and automatic program generation
A tour of Schism: a partial evaluation system for higher-order applicative languages

PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
The essence of compiling with continuations

PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
Tutorial notes on partial evaluation

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic

Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Synthesis of ML programs in the system Coq

Journal of Symbolic Computation - Special issue on automatic programming
Representing monads

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A generic account of continuation-passing styles

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Building interpreters by composing monads

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Is continuation-passing useful for data flow analysis?

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Continuation-based partial evaluation

LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
Reasoning about programs in continuation-passing style

Lisp and Symbolic Computation - Special issue on continuations—part I
Monad transformers and modular interpreters

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The structure of continuation-passing styles

The structure of continuation-passing styles
A reflection on call-by-value

Proceedings of the first ACM SIGPLAN international conference on Functional programming
Cogen in six lines

Proceedings of the first ACM SIGPLAN international conference on Functional programming
Eta-expansion does The Trick

ACM Transactions on Programming Languages and Systems (TOPLAS)
Type-directed partial evaluation

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A modal analysis of staged computation

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Towards Unifying Partial Evaluation, Deforestation, Supercompilation, and GPC

ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
Efficient Multi-level Generating Extensions for Program Specialization

PLILPS '95 Proceedings of the 7th International Symposium on Programming Languages: Implementations, Logics and Programs
Mechanically Verifying the Correctness of an Offline Partial Evaluator

PLILPS '95 Proceedings of the 7th International Symposium on Programming Languages: Implementations, Logics and Programs
Proving the Correctness of Recursion-Based Automatic Program Transformations

TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Call-By-Name CPS-Translation as a Binding-Time Improvement

SAS '95 Proceedings of the Second International Symposium on Static Analysis
Occam's Razor in Metacompuation: the Notion of a Perfect Process Tree

WSA '93 Proceedings of the Third International Workshop on Static Analysis
Deriving Mixed Evaluation from Standard Evaluation for a Simple Functional Language

Proceedings of the International Conference on Mathematics of Program Construction, 375th Anniversary of the Groningen University
A temporal-logic approach to binding-time analysis

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science

Foundations for partial evaluation of functional programs with computational effects

ACM Computing Surveys (CSUR) - Special issue: electronic supplement to the September 1998 issue
A core calculus of dependency

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A sound reduction semantics for untyped CBN mutli-stage computation. Or, the theory of MetaML is non-trival (extended abstract)

PEPM '00 Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
A Hybrid Approach to Online and Offline Partial Evaluation

Higher-Order and Symbolic Computation
The Second Futamura Projection for Type-Directed Partial Evaluation

Higher-Order and Symbolic Computation
CPS Translations and Applications: The Cube and Beyond

Higher-Order and Symbolic Computation
Type-Directed Partial Evaluation

Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School
Partial Evaluation for the Lambda Calculus

Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School
An Introduction to Online and Offline Partial Evaluation using a Simple Flowchart Language

Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School
On the Logical Content of Computational Type Theory: A Solution to Curry's Problem

TYPES '00 Selected papers from the International Workshop on Types for Proofs and Programs
Closed Types as a Simple Approach to Safe Imperative Multi-stage Programming

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Modular control-flow analysis with rank 2 intersection types

Mathematical Structures in Computer Science
Special issue: Modalities in type theory

Mathematical Structures in Computer Science
Syntactic accidents in program analysis: on the impact of the CPS transformation

Journal of Functional Programming
Closed types for a safe imperative MetaML

Journal of Functional Programming
Program specialization for execution monitoring

Journal of Functional Programming
The essence of compiling with continuations

ACM SIGPLAN Notices - Best of PLDI 1979-1999
Polymorphic specialization for ML

ACM Transactions on Programming Languages and Systems (TOPLAS)
A monadic approach for avoiding code duplication when staging memoized functions

Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
A modal type system for multi-level generating extensions with persistent code

Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Continuation-based partial evaluation without continuations

SAS'03 Proceedings of the 10th international conference on Static analysis
A new one-pass transformation into monadic normal form

CC'03 Proceedings of the 12th international conference on Compiler construction
Three syntactic theories for combinatory graph reduction

LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
Cut-free Gentzen calculus for multimodal CK

Information and Computation
PE-KeY: a partial evaluator for java programs

IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
Three syntactic theories for combinatory graph reduction

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We formalize a partial evaluator for Eugenio Moggi's computational metalanguage. This formalization gives an evaluation-order independent view of binding-time analysis and program specialization, including a proper treatment of call unfolding. It also enables us to express the essence of ‘control-based binding-time improvements’ for let expressions. Specifically, we prove that the binding-time improvements given by ‘continuation-based specialization’ can be expressed in the metalanguage via monadic laws.