In this paper, we describe work in progress on binding-time analysis (BTA) for a first-order subset of Mercury. BTA is the core part of any off-line specialisation system. We formulate BTA by constraint normalisation, enabling the analysis to be performed efficiently and in a modular way. The authors wish to thank Danny De Schreye and Karel De Vlaminck for their continuous interest in this work. They also wish to thank anonymous referees for valuable comments which helped to improve the current paper. © 2000 Published by Elsevier Science B.V.Also in ENTCS 30(2), Workshop at ICLP'99status: publishe
Binding time analysis is important in partial evaluators. Its task is to determine which parts of a...
Binding time analysis aims at determining which identifiers can be bound to their values at compile ...
First-order projection-based binding-time analysis has proven genuinely useful in partial evaluation...
AbstractIn this paper, we describe work in progress on binding-time analysis (BTA) for a first-order...
Technical Report Series, Department of Computer Science, University of Manchester, ISSN 1361-6161. R...
In this work, we develop a binding-time analysis for the logic programming language Mercury. We intr...
Weintroduce a new kind of Binding Time Analysis (BTA) based on search rather than constraint solving...
. We present an efficient base algorithm for binding-time analysis based on constraint solving and t...
Abstract. Binding time analysis is an important part of off-line partial evaluation, annotating expr...
. Binding-time analysis is a crucial part of offline partial evaluation. It is often specified as a ...
The partial evaluation process requires a binding-time analysis. Binding-time analysis seeks to dete...
A binding-time analysis is correct if it always produces consistent binding-time information. Consis...
Abstract: Binding Time Analysis (BTA, BT-analysis) is an essential part of the Partial Eva...
In this paper we will be taking a look at type inference and its uses for binding-time analysis, dyn...
The Curry-Howard isomorphism identifies proofs with typed lambda-calculus terms, and correspondingly...
Binding time analysis is important in partial evaluators. Its task is to determine which parts of a...
Binding time analysis aims at determining which identifiers can be bound to their values at compile ...
First-order projection-based binding-time analysis has proven genuinely useful in partial evaluation...
AbstractIn this paper, we describe work in progress on binding-time analysis (BTA) for a first-order...
Technical Report Series, Department of Computer Science, University of Manchester, ISSN 1361-6161. R...
In this work, we develop a binding-time analysis for the logic programming language Mercury. We intr...
Weintroduce a new kind of Binding Time Analysis (BTA) based on search rather than constraint solving...
. We present an efficient base algorithm for binding-time analysis based on constraint solving and t...
Abstract. Binding time analysis is an important part of off-line partial evaluation, annotating expr...
. Binding-time analysis is a crucial part of offline partial evaluation. It is often specified as a ...
The partial evaluation process requires a binding-time analysis. Binding-time analysis seeks to dete...
A binding-time analysis is correct if it always produces consistent binding-time information. Consis...
Abstract: Binding Time Analysis (BTA, BT-analysis) is an essential part of the Partial Eva...
In this paper we will be taking a look at type inference and its uses for binding-time analysis, dyn...
The Curry-Howard isomorphism identifies proofs with typed lambda-calculus terms, and correspondingly...
Binding time analysis is important in partial evaluators. Its task is to determine which parts of a...
Binding time analysis aims at determining which identifiers can be bound to their values at compile ...
First-order projection-based binding-time analysis has proven genuinely useful in partial evaluation...