Peter Thiemann, Michael Sperber  @ NUS Home/Search
Context Related
| pu.informatik.unituebinge...poly.ps.gz informatik.unifreiburg.de...poly.ps.gz Cached: PS.gz PS PDF Image Update Help From: pu.informatik.unituebingen.de... (more) From: informatik.unifreiburg.de/~th... (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Polyvariant expansion is a binding-time-improving transformation for offline partial evaluation. We show how to achieve it automatically for a higher-order functional language using the interpretive approach. We have designed and implemented an interpreter that statically propagates binding times. When specialized with respect to a source program, it performs polyvariant expansion. Extending the interpreter to an online specializer allows us to generate a binding-time-polyvariant compiler... (Update)
Context of citations to this paper: More
.... in [8] where polyvariance is achieved by instrumenting programs with explicit bt values and performing partial evaluation in two passes; [24] used the interpretive approach to the same e#ect. These works deal with higher order functional languages. Strategies for guaranteeing...
.... Inserting an interpreter between a source program and a program transformer can achieve certain powerful transformations [34, 49, 53]. Our use of the interpretive approach is di#erent from this work: our primary goal is not to expose more information to a program...
Cited by: More
Jones Optimality, Binding-Time Improvements, and the Strength of.. - Glück (Correct)
Polymorphic Specialization for ML - Helsen, Thiemann (2001) (Correct)
From Standard To Non-Standard Semantics By Semantics Modifiers - Abramov, Glück (2001) (Correct)
Active bibliography (related documents): More All
0.3: Bootstrapping Higher-Order Program Transformers from.. - Sperber, Glück, Thiemann (1996) (Correct)
0.3: Separate Polyvariant Binding Time Reconstruction - Consel, Jouvelot, Ĝrbĉk (1994) (Correct)
0.2: Partial Evaluation: Principles and Perspectives - Consel, Danvy (1993) (Correct)
Similar documents based on text: More All
0.4: Program Generation With Class - Thiemann, Sperber (1997) (Correct)
0.4: First-Class Polyvariant Functions and Co-Arity Raising - Thiemann (Correct)
0.3: Correctness of a Region-Based Binding-Time Analysis - Thiemann (1997) (Correct)
Related documents from co-citation: More All
7: Partial Evaluation and Automatic Program Generation (context) - Jones, Gomard et al. - 1993
4: Extracting polyvariant binding time analysis from polyvariant specializer (context) - Bulyonkov - 1993
4: Polyvariant binding-time analysis for applicative languages - Consel - 1993
BibTeX entry: (Update)
P. Thiemann and M. Sperber. Polyvariant expansion and compiler generators. In D. Bjĝrner et al., editors. Perspectives of System Informatics. Proceedings. LNCS, Vol. 1181, 285--296 (Springer-Verlag, 1996). http://citeseer.comp.nus.edu.sg/12072.html More
@inproceedings{ thiemann96polyvariant,
author = "Peter Thiemann and Michael Sperber",
title = "Polyvariant Expansion and Compiler Generators",
booktitle = "Ershov Memorial Conference",
pages = "285--296",
year = "1996",
url = "citeseer.comp.nus.edu.sg/12072.html" }
Citations (may not include all citations):815 Abstract interpretation: A unified lattice model for static .. (context) - Cousot, Cousot - 1977
638 Partial Evaluation and Automatic Program Generation (context) - Jones, Gomard et al. - 1993
206 Tutorial notes on partial evaluation (context) - Consel, Danvy - 1993
112 Partial evaluation of computation process---an approach to a.. - Futamura - 1971
99 A partial evaluator for the untyped lambda-calculus - Gomard, Jones - 1991
83 Automatic autoprojection of higher order recursive equations (context) - Bondorf - 1991
65 Binding time analysis for higher order untyped functional la.. (context) - Consel - 1992
64 Efficient type inference for higher-order binding-time analy.. - Henglein - 1991
51 grammar and set-constraint-based program analysis by abstrac.. (context) - Cousot, Cousot - 1995
48 Comparing the galois connection and widening/narrowing appro.. - Cousot, Cousot - 1992
39 Journal of Functional Programming (context) - Gluck, generation - 1994
38 Efficient analyses for realistic off-line partial evaluation (context) - Bondorf, Jorgensen - 1993
37 Flow Analysis of Lazy Higher-Order Functional Programs (context) - Jones - 1987
35 Partial type inference for untyped functional programs (context) - Gomard - 1990
28 Polyvariant binding-time analysis for applicative lanuages - Consel
27 Mixed computation: Potential applications and problems for s.. (context) - Ershov - 1980
27 Mixed computation: Potential applications and problems for s.. (context) - Ershov - 1982
25 Binding time analysis for polymorphically typed higher order.. (context) - AE - 1989
23 Separating binding times in language specifications (context) - AE - 1989
18 Generating optimizing specializers (context) - Gluck, Jorgensen - 1994
15 A tour of Schism (context) - Consel
14 A polyvariant binding time analysis (context) - Rytz, Gengler - 1992
14 A grammar-based data-flow analysis to stop deforestation (context) - Sorensen - 1994
11 A supercompiler system based on the language Refal (context) - Turchin - 1979
7 A polyvariant binding time analysis handling partially known.. (context) - Gengler, Rytz - 1992
5 Bootstrapping higher-order program transformers from interpr.. - Sperber, Gluck et al. - 1996
1 Extracting polyvariant binding times from polyvariant specia.. (context) - Bulyonkov
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-pu.informatik.uni-tuebingen.de/users/thiemann/papers/): More
Towards Partial Evaluation of Full Scheme - Thiemann (1996) (Correct)
Bootstrapping Higher-Order Program Transformers from.. - Sperber, Glück, Thiemann (1996) (Correct)
Cogen in Six Lines - Thiemann (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.