Binding-Time Analysis for Mercury

Binding-Time Analysis for Mercury (1999)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Wim Vanhoof , Maurice Bruynooghe

Venue:	16th International Conference on Logic Programming, pages 500 { 514
Citations:	8 - 4 self

BibTeX

@INPROCEEDINGS{Vanhoof99binding-timeanalysis,
    author = {Wim Vanhoof and Maurice Bruynooghe},
    title = {Binding-Time Analysis for Mercury},
    booktitle = {16th International Conference on Logic Programming, pages 500 { 514},
    year = {1999},
    pages = {500--514},
    publisher = {MIT Press}
}

Bookmark

OpenURL

Abstract

. In this paper, we describe a binding-time analysis (BTA) for a statically typed and strongly moded pure logic programming language, in casu Mercury. Binding-time analysis is the key concept in achieving o-line program specialisation: the analysis starts from a description of the program's input available for specialisation, and propagates this information throughout the program, deriving directives for when and how to perform specialisation. 1

Citations

593	Partial Evaluation and Automatic Program Generation - Jones, Gomard, et al. - 1993
175	The execution algorithm of Mercury, an efficient purely declarative logic programming language - Somogyi, Henderson, et al. - 1996
160	Partial Evaluation of Computation Process - an Approach to a Compiler-Compiler. Systems - Futamura - 1971
131	A polymorphic type system for Prolog - Mycroft, O’Keefe - 1984
114	Deriving Description of Possible Values of Program Variables by Means of Abstract Interpretation - Janssens, Bruynooghe - 1992
114	An experiment in partial evaluation: The generation of a compiler generator - Jones, Sestoft, et al.
108	Set-based analysis of ML programs - Heintze - 1994
90	A partial evaluator for the untyped lambda-calculus - Gomard, Jones - 1991
89	Automatic autoprojection of higher order recursive equations - Bondorf - 1991
86	Efficient type inference for higher-order binding-time analysis - Henglein - 1991
82	Static Analysis of Logic Programs for Independent AndParallelism - Jacobs, Langen - 1992
74	Declarative error diagnosis - Lloyd - 1987
68	N.: A uniform approach for compile-time and run-time specialization - Consel, Hornof, et al. - 1996
67	Binding time analysis for higher order untyped functional languages - Consel - 1990
61	The derivation of an algorithm for program specialisation - Gallagher, Bruynooghe - 1991
59	Ensuring global termination of partial deduction while allowing flexible polyvariance - Martens, Gallagher - 1995
57	Improving Homeomorphic Embedding for Online Termination - Leuschel
57	Controlling generalisation and polyvariance in partial deduction of normal logic programs - Leuschel, Martens, et al. - 1998
55	Typed Prolog: A semantic reconstruction of the Mycroft-O’Keefe type system - Lakshman, Reddy - 1991
55	Closure analysis in constraint form - Palsberg - 1995
54	The execution algorithm of Mercury, an ecient purely declarative logic programming language - Somogyi, Henderson, et al. - 1996
53	Mercury: an efficient purely declarative logic programming language - Somogyi, Henderson, et al. - 1995
46	Efficient analyses for realistic off-line partial evaluation - Bondorf, Jørgensen - 1993
37	Accurate binding-time analysis for imperative languages: ow, context, and return sensitivity - Hornof, Noyé
35	Polymorphic binding-time analysis - Henglein, Mossin - 1994
35	Logimix: A self-applicable partial evaluator for Prolog - Mogensen, Bondorf
28	Some low-level source transformations for logic programs - Gallagher, Bruynooghe
27	Binding-time analysis and the taming of C pointers - Andersen - 1993
27	An automatic program generator for multi-level specialization - Glück, Jørgensen - 1997
25	Charlier. Type analysis of prolog using type graphs - Hentenryck, Cortesi, et al. - 1995
21	A System of Precise Modes for Logic Programs - Somogyi - 1986
19	A model for inter-module analysis and optimizing compilation - Bueno, Banda, et al. - 2001
18	Binding time analysis for polymorphically typed higher order languages - Mogensen - 1989
18	Some Issues in Analysis and Specialization of Modular Ciao-Prolog Programs. In Special Issue on Optimization and Implementation of Declarative Programming Languages, volume 30 - Puebla, Hermenegildo - 2000
16	Simple closure analysis - Henglein - 1992
15	Specialisation of logic programs: A tutorial - Gallagher - 1993
15	Efficiently generating efficient generating extensions in Prolog - Jørgensen, Leuschel - 1996
15	Mode analysis domains for typed logic programs - Smaus, Hill, et al. - 2000
14	A polyvariant binding-time analysis for off-line partial deduction - Bruynooghe, Leuschel, et al. - 1998
13	Code generation for Mercury - Conway, Henderson, et al. - 1995
12	Binding-Time Analysis for Both Static and Dynamic Expressions - Asai - 1999
12	Binding-time analysis by constraint solving: a modular and higherorder approach for mercury, in M. Parigot and A. Voronkov (eds - Vanhoof - 2000
11	Termination analysis with types is more accurate - Lagoon, Mesnard, et al. - 2003
10	Ecient analyses for realistic o-line partial evaluation - Bondorf, Jrgensen - 1993
9	Binding-Time Annotations Without Binding-Time Analysis - Vanhoof, Bruynooghe - 2001
7	Logic programming in the real world - Somogyi, Henderson, et al. - 1995
7	Status of the Mercury system - Somogyi, Henderson, et al. - 1996
6	Module-sensitive program specialisation - Dussart, Heldal, et al.
6	When size does matter - Termination analysis for typed logic programs - Vanhoof, Bruynooghe - 2001
5	A polyvariant binding-time analysis for o-line partial deduction - Bruynooghe, Leuschel, et al. - 1998