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.
|Name||Electronic Notes in Theoretical Computer Science|
|Symposium||International Workshop on Implementation and Optimization of Declarative Languages|
|City||Las Cruces, New Mexico (USA)|
|Period||2/12/99 → …|