Michael Leuschel, Bern Martens, Danny De Schreye  Home/Search
Context Related
| cs.kuleuven.ac.be/publica...CW248.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.kuleuven.ac.be/public...CW1997 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper, we further elaborate global control for partial deduction: For which atoms, among possibly infinitely many, should partial deductions be produced, meanwhile guaranteeing correctness as well as termination, and providing ample opportunities for finegrained polyvariance? Our solution is based on two ingredients. First, we use the wellknown concept of a characteristic tree to guide abstraction (or generalisation) and polyvariance, and aim for producing one specialised... (Update)
Context of citations to this paper: More
.... have been developed, analysing issues of termination and of code and search explosion, and efficiency gains have been obtained [17, 27, 21]. Several fully automated systems (sp, sage, paddy, mixtus, ecce) as well as semi automated ones (logimix, leupel, logen) have been...
...contain only a finite number of atoms. A similar classification can be done for most other program specialisation techniques (cf. e.g. [39]) An A1 Gamma Gamma Psi R Gamma Gamma Psi R R Gamma Gamma Psi An : A1 A local termination: each tree is...
Cited by: More
Questions and Answers about Ten Formal Methods - Hartel, Butler, Currie.. (1999) (Correct)
Advanced Techniques for Logic Program Specialisation - Leuschel (1997) (Correct)
Homeomorphic Embedding for Online Termination - Leuschel (1998) (Correct)
Similar documents (at the sentence level):
19.1%: Controlling Generalization and Polyvariance in Partial .. - Leuschel, Martens, De .. (1998) (Correct)
8.3%: Constrained Partial Deduction and the Preservation of.. - Leuschel, De Schreye (1997) (Correct)
Active bibliography (related documents): More All
1.1: Ecological Partial Deduction: Preserving Characteristic Trees.. - Leuschel (1995) (Correct)
1.1: The ECCE Partial Deduction System - Leuschel (Correct)
1.0: Efficient Specialisation in Prolog Using a Hand-Written.. - Leuschel, Jørgensen (1999) (Correct)
Similar documents based on text: More All
0.6: Some Achievements and Prospects in Partial Deduction - Leuschel, Martens, De Schreye (1998) (Correct)
0.5: Offline Specialisation in Prolog Using a Hand-Written .. - Leuschel.. (Correct)
0.3: Ensuring Global Termination of Partial Deduction while.. - Martens, Gallagher (1995) (Correct)
Related documents from co-citation: More All
21: Partial evaluation in logic programming (context) - Lloyd, Shepherdson - 1991
16: The ecce partial deduction system and the dppd library of benchmarks (context) - Leuschel - 1996
15: The derivation of an algorithm for program specialisation (context) - Gallagher, Bruynooghe - 1991
BibTeX entry: (Update)
M. Leuschel, B. Martens, and D. De Schreye. Controlling generalisation and polyvariance in partial deduction of normal logic programs. ACM Transactions on Programming Languages and Systems. To appear. Preliminary version as Technical Report CW 248, Departement Computerwetenschappen, K.U. Leuven, Belgium, February 1996. http://citeseer.ist.psu.edu/leuschel97controlling.html More
@misc{ leuschel96controlling,
author = "M. Leuschel and B. Martens and D. De Schreye",
title = "Controlling generalisation and polyvariance in partial deduction of normal
logic programs",
text = "M. Leuschel, B. Martens, and D. De Schreye. Controlling generalisation
and polyvariance in partial deduction of normal logic programs. ACM Transactions
on Programming Languages and Systems. To appear. Preliminary version as
Technical Report CW 248, Departement Computerwetenschappen, K.U. Leuven,
Belgium, February 1996.",
year = "1996",
url = "citeseer.ist.psu.edu/leuschel97controlling.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
1838 Foundations of Logic Programming (context) - Lloyd - 1987
866 Techniques and Tools (context) - Aho, Sethi et al. - 1986
788 Rewrite systems - Dershowitz, Jouannaud - 1990
638 Partial Evaluation and Automatic Program Generation (context) - Jones, Gomard et al. - 1993
224 Partial evaluation in logic programming (context) - Lloyd, Shepherdson - 1991
218 Abstract interpretation and application to logic programs (context) - Cousot, Cousot - 1992
206 Tutorial notes on partial evaluation (context) - Consel, Danvy - 1993
172 Journal of Symbolic Computation (context) - Dershowitz, rewriting - 1987
166 Unification revisited (context) - Lassez, Maher et al. - 1988
129 Transformation of logic programs: Foundations and techniques (context) - Pettorossi, Proietti - 1994
108 A practical framework for the abstract interpretation of log.. (context) - Bruynooghe - 1991
98 Mix: a self-applicable partial evaluator for experiments in .. (context) - Jones, Sestoft et al. - 1989
89 Deriving descriptions of possible values of program variable.. (context) - Janssens, Bruynooghe - 1992
82 Tutorial on specialisation of logic programs (context) - Gallagher - 1993
82 ACM Transactions on Programming Languages and Systems (context) - Debray, Lin et al. - 1993
70 ACM Transactions on Programming Languages and Systems (context) - Turchin, of et al. - 1986
58 Ensuring global termination of partial deduction while allow.. - Martens, Gallagher - 1995
48 Automatic online partial evaluation (context) - Weise, Conybeare et al. - 1991
47 An Automatic Partial Evaluator for Full Prolog - Sahlin - 1991
46 Mixtus: An automatic partial evaluator for full Prolog (context) - Sahlin - 1993
44 The derivation of an algorithm for program specialisation (context) - Gallagher, Bruynooghe - 1991
39 Journal of Functional Programming (context) - Gluck, generation - 1994
38 A general criterion for avoiding infinite unfolding during p.. (context) - Bruynooghe, De Schreye et al. - 1992
38 Loop checking in partial deduction (context) - Bol - 1993
32 The ecce partial deduction system and the dppd library of be.. (context) - Leuschel - 1996
30 A system for specialising logic programs - Gallagher - 1991
30 Unfolding-definition-folding (context) - Proietti, Pettorossi - 1991
30 The algorithm of generalization in the supercompiler (context) - Turchin - 1988
30 An algorithm of generalization in positive supercompilation (context) - Srensen, Gluck - 1995
29 Practical aspects of set based analysis - Heintze - 1992
29 An introduction to partial deduction (context) - Komorowski - 1992
28 A Self-Applicable Partial Evaluator for the Logic Programmin.. (context) - Gurr - 1994
28 Logimix: A self-applicable partial evaluator for Prolog (context) - Mogensen, Bondorf - 1992
26 A partial evaluation procedure for logic programs (context) - Benkerimi, Lloyd - 1990
23 Sound and complete partial deduction with unfolding based on.. (context) - Martens, De Schreye et al. - 1994
23 Redundant argument filtering of logic programs - Leuschel, Srensen - 1996
21 Implementation of multiple specialization in logic programs - Puebla, Hermenegildo - 1995
21 the Semantics of Meta-Programming and the Control of Partial.. (context) - Martens - 1994
21 Ecological partial deduction: Preserving characteristic tree.. - Leuschel - 1995
19 Supporting transformations for the partial evaluation of log.. (context) - Benkerimi, Hill - 1993
19 Online partial deduction of large programs (context) - Prestwich - 1993
16 The applicability of logic program analysis and transformati.. - de Waal, Gallagher - 1994
16 Regular approximations of computation paths in logic and fun.. - Gallagher, Lafave - 1996
13 The PADDY partial deduction system - Prestwich - 1992
13 real thing (context) - Leuschel, of - 1994
12 Estimating the computational cost of logic programs - Debray, Garc'ia et al. - 1994
12 Deletion of redundant unary type predicates from logic progr.. (context) - Gallagher, de Waal - 1992
12 Towards creating specialised integrity checks through partia.. - Leuschel, De Schreye - 1995
11 Gracefully adding negation and disjunction to Prolog (context) - Poole, Goebel - 1986
10 Specialisation of a unification algorithm (context) - de Waal, Gallagher - 1991
10 Some low-level transformations for logic programs (context) - Gallagher, Bruynooghe - 1990
9 To be published in Handbook of Logic in Artificial Intellige.. (context) - Hill, Gallagher et al. - 1994
8 An almost perfect abstraction operation for partial deductio.. (context) - Leuschel, De Schreye - 1995
6 Vers une Formalisation de l' ' Evaluation Partielle (context) - Marlet - 1994
5 Tutorial on program specialisation (context) - De Schreye, Leuschel et al. - 1995
5 Computational Problems in Equational Theorem Proving (context) - Stillman - 1988
4 Analysis and Transformation of Proof Procedures - de Waal - 1994
2 Partiele deductie: Een substantiele vergelijkende studie (context) - Meulemans - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.kuleuven.ac.be/publicaties/rapporten/CW1997.html): More
To Parse or Not To Parse - Vanhoof, Martens (1997) (Correct)
Compositionality of Normal Open Logic Programs - Verbaeten, Denecker, De Schreye (1997) (Correct)
Extending Homeomorphic Embedding in the Context of Logic.. - Leuschel (1997) (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