Results 1  10
of
4,866,915
Polymorphic binding time analysis
 In Proceedings of ESOP'94, European Symposium on Programming
, 1994
"... Binding time analysis has proved to be a valuable preanalysis for partial evaluation. Until now (almost) all binding time analyses have been monovariant, such that binding time analysis could assign only one binding time description to each function definition. This means that if a function f(x) is ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Binding time analysis has proved to be a valuable preanalysis for partial evaluation. Until now (almost) all binding time analyses have been monovariant, such that binding time analysis could assign only one binding time description to each function definition. This means that if a function f
Polymorphic Binding Time Analysis
, 1993
"... Abstract Binding time analysis has proved to be a valuable preanalysis for partial evaluation. Until now (almost) all binding time analyses have been monovariant, such that binding time analysis could assign only one binding time description to each function definition. This means that if a functio ..."
Abstract
 Add to MetaCart
Abstract Binding time analysis has proved to be a valuable preanalysis for partial evaluation. Until now (almost) all binding time analyses have been monovariant, such that binding time analysis could assign only one binding time description to each function definition. This means that if a
BindingTime Analysis for Mercury
 16th International Conference on Logic Programming, pages 500 { 514
, 1999
"... . In this paper, we describe a bindingtime analysis (BTA) for a statically typed and strongly moded pure logic programming language, in casu Mercury. Bindingtime analysis is the key concept in achieving oline program specialisation: the analysis starts from a description of the program's ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
. In this paper, we describe a bindingtime analysis (BTA) for a statically typed and strongly moded pure logic programming language, in casu Mercury. Bindingtime analysis is the key concept in achieving oline program specialisation: the analysis starts from a description of the program
Correctness of Bindingtime Analysis
, 1993
"... A bindingtime analysis is correct if it always produces consistent bindingtime information. Consistency prevents partial evaluators from "going wrong". A sufficient and decidable condition for consistency, called wellannotatedness, was first presented by Gomard and Jones. In this paper ..."
Abstract

Cited by 18 (6 self)
 Add to MetaCart
A bindingtime analysis is correct if it always produces consistent bindingtime information. Consistency prevents partial evaluators from "going wrong". A sufficient and decidable condition for consistency, called wellannotatedness, was first presented by Gomard and Jones. In this paper
Binding Time Analysis for Bits
"... Using a high level language (HLL) to specify a computation for synthesis in ASIC or FPGA hardware requires aggressive compiler analysis to capture bitlevel program characteristics that cannot normally be expressed in a HLL but which are important to specializing and optimizing logic for size and sp ..."
Abstract
 Add to MetaCart
and speed. It is useful, for instance, to identify unchanging bits of a variable and subsequently remove using partial evaluation any logic which depends on them. We describe a bindingtime analysis for bits which can identify static and dynamic bits of computed expressions. The analysis proves
BindingTime Analysis for Standard ML
 Lisp and Symbolic Computation
, 1995
"... . We present an efficient base algorithm for bindingtime analysis based on constraint solving and the unionfind algorithm. In practice it has been used to handle all of Standard ML except modules and we show the principles of how constraints can be used for bindingtime analysis of Standard ML; in ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
. We present an efficient base algorithm for bindingtime analysis based on constraint solving and the unionfind algorithm. In practice it has been used to handle all of Standard ML except modules and we show the principles of how constraints can be used for bindingtime analysis of Standard ML
An Efficient Staging Algorithm for BindingTime Analysis
"... BindingTime Analysis (BTA) is one of the compile time program analyses which... ..."
Abstract
 Add to MetaCart
BindingTime Analysis (BTA) is one of the compile time program analyses which...
Higherorder Bindingtime Analysis
 In ACM Symposium on Partial Evaluation and SemanticsBased Program Manipulation (PEPM'93
, 1993
"... The partial evaluation process requires a bindingtime analysis. Bindingtime analysis seeks to determine which parts of a program's result is determined when some part of the input is known. Domain projections provide a very general way to encode a description of which parts of a data structur ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
The partial evaluation process requires a bindingtime analysis. Bindingtime analysis seeks to determine which parts of a program's result is determined when some part of the input is known. Domain projections provide a very general way to encode a description of which parts of a data
BindingTime Analysis for Standard ML
 Lisp and Symbolic Computation
, 1995
"... We present an efficient base algorithm for bindingtime analysis based on constraint solving and the unionfind algorithm. In practice it has been used to handle all of Standard ML except modules and we show the principles of how constraints can be used for bindingtime analysis of Standard ML; in p ..."
Abstract
 Add to MetaCart
We present an efficient base algorithm for bindingtime analysis based on constraint solving and the unionfind algorithm. In practice it has been used to handle all of Standard ML except modules and we show the principles of how constraints can be used for bindingtime analysis of Standard ML
Binding Time Analysis: A New PERspective
 In Proceedings of the ACM Symposium on Partial Evaluation and SemanticsBased Program Manipulation (PEPM'91
, 1991
"... Given a description of the parameters in a program that will be known at partial evaluation time, a binding time analysis must determine which parts of the program are dependent solely on these known parts (and therefore also known at partial evaluation time). In this paper a binding time analysis f ..."
Abstract

Cited by 35 (7 self)
 Add to MetaCart
Given a description of the parameters in a program that will be known at partial evaluation time, a binding time analysis must determine which parts of the program are dependent solely on these known parts (and therefore also known at partial evaluation time). In this paper a binding time analysis
Results 1  10
of
4,866,915