(Enter summary)
Abstract: Staging is a programming technique for dividing the computation in order to exploit the
early availability of some arguments. In the early stages the program uses the available
arguments to generate, at run time, the code for the late stages. The late stages may then
be explicitly evaluated when appropriate. A type system for staging should ensure that
only well-typed expressions are generated, and that only expressions with no free variables
are permitted for evaluation. (Update)
Cited by: More
Contextual Model Type Theory - Nanevski, Pfenning, Pientka (2005)
(Correct)
Similar documents (at the sentence level):
23.4%: Meta-Programming with Names and Necessity - Nanevski, Pfenning (2002)
(Correct)
Active bibliography (related documents): More All
0.5: FreshML: Programming with Binders Made Simple - Shinwell, Pitts, Gabbay (2003)
(Correct)
0.3: Type-Safe Update Programming - Martin Erwig And
(Correct)
0.3: A Rule-Based Language for Programming Software Updates - Martin Erwig Erwig (2002)
(Correct)
Similar documents based on text:
5.0: Unknown -
(Correct)
BibTeX entry: (Update)
Nanevski, A. and Pfenning, F. 2002. Staged computation with names and necessity. Journal of Functional Programming. To appear. http://citeseer.ist.psu.edu/nanevski05staged.html More
@misc{ nanevski02staged,
author = "A. Nanevski and F. Pfenning",
title = "Staged computation with names and necessity",
text = "Nanevski, A. and Pfenning, F. 2002. Staged computation with names and necessity.
Journal of Functional Programming. To appear.",
year = "2002",
url = "citeseer.ist.psu.edu/nanevski05staged.html" }
Citations (may not include all citations):
982
Theoretical computer science (context) - Jean-Yves, system et al. - 1986
176
Notes on formalizing context
- John - 1993
147
abstraction and parametric polymorphism (context) - John, Types - 1983
143
A modal analysis of staged computation
- Rowan, Frank - 2001
133
Multi-stage programming with explicit annotations
- Walid, Tim - 1997
123
Optimizing ML with run-time code generation
- Peter, Mark - 1996
112
Partial evaluation of computation process - an approach to a..
- Yoshihiko - 1971
106
Observable properties of higher order functions that dynamic..
- Pitts, Stark - 1993
85
An experiment in partial evaluation: the generation of a com.. (context) - Neil, Sestoft et al. - 1985
80
A temporal logic approach to binding-time analysis
- Rowan - 1996
69
Abstract syntax and variable binding (context) - Marcelo, Gordon et al. - 1999
66
Primitive recursion for higher-order abstract syntax (context) - Joelle, Frank et al. - 1997
59
Semantical analysis of higher-order abstract syntax (context) - Martin - 1999
59
Naming and necessity (context) - Saul - 1980
59
Multi-stage programming: Its theory and applications
- Walid - 1999
45
A new approach to abstract syntax with variable binding
- Murdoch, Pitts - 2002
43
Identity and existence in intuitionistic logic (context) - Dana - 1979
38
A sound reduction semantics for untyped CBN multi-stage comp..
- Walid - 2000
38
A metalanguage for programming with bound names modulo renam..
- Andrew, Gabbay - 2000
35
Two-level semantics and code generation (context) - Flemming, Hanne - 1988
34
An idealized MetaML: Simpler (context) - Eugenio, Walid et al. - 1999
28
Run-time code generation and Modal-ML
- Philip, Peter et al. - 1998
27
Closed types for a safe imperative MetaML
- Cristiano, Eugenio et al. - 2003
24
Accomplishments and research challenges in meta-programming
- Tim - 2001
24
A functional theory of local names
- Martin - 1994
23
Self-reference and modal logic (context) - Smorynski - 1985
22
An extension to ML to handle bound variables in data structu.. (context) - Dale - 1990
22
Meta-programming with names and necessity
- Aleksandar - 2002
22
and proof irrelevance in modal type theory (context) - Frank, extensionality - 2001
22
Logical modalities and multi-stage programming
- Zine, Moggi et al. - 1999
21
First-order modal logic (context) - Melvin, Richard - 1999
20
Modal types as staging specifications for run-time code gene..
- Philip, Peter et al. - 1998
18
Implementing multi-stage languages using ASTs (context) - Cristiano, Walid et al. - 2003
16
Environment classifiers (context) - Walid, Michael - 2003
15
Automating the meta-theory of deductive systems (context) - Carsten - 2000
12
the partial computation principle (context) - Ershov - 1977
11
Nominal logic: A first order theory of names and binding
- Andrew - 2001
10
A formalization of viewpoints
- Giuseppe, Maria - 1995
9
ML-like inference for classifiers
- Cristiano, Eugenio et al. - 2004
9
Advice on modal logic (context) - Dana - 1970
6
A judgmental reconstruction of modal logic
- Frank, Rowan - 2001
6
Proof-directed debugging
- Robert - 1999
6
cient multi-level generating extensions for program speciali.. (context) - Robert, Jesper - 1995
5
Syntactical treatment of modalities (context) - Richard - 1963
3
Type checking meta programs (context) - Nikolaj - 1999
3
A theory of inductive definitions with #-equivalence (context) - Murdoch, August - 2000
3
A modal foundation for meta variables
- Aleksandar, Brigitte et al. - 2003
1
Propositions as [Types
- Steve, Andrej - 2001
1
An automatic program generator for multilevel specialization (context) - Robert, Jesper - 1997
1
Semantic analysis of normalization by evaluation for typed l.. (context) - Marcelo - 2002
Documents on the same site (http://www.cs.cmu.edu/~fp/publications.html): More
Verifying Uniqueness in a Logical Framework - Anderson, Pfenning (2004)
(Correct)
Compiler Verification in LF - Hannan, Pfenning (1992)
(Correct)
Meta-Programming with Names and Necessity - Nanevski, Pfenning (2002)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC