6 citations found. Retrieving documents...
Consel, C., P. Jouvelot, and P. rbaek "Separate Polyvariant Binding Time Reconstruction, " Ecole des Mines, CRI Report A/261 (October 1994).

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Integrating Partial Evaluators into Interpreters - Asai (2001)   (Correct)

....process. The offline approach where availability of values are analyzed beforehand in a separate phase (called a binding time analysis) was not employed because it usually requires a whole program text for the global program analysis. If we made use of a separate binding time analysis [8], we might be able to employ the offline approach as well. We formalize the specializer in store passing style to make special emphasis on the behavior of heap. We then state its correctness: the execution of programs with and without specialization produce a congruent result and store. Three ....

Consel, C., P. Jouvelot, and P. rbaek "Separate Polyvariant Binding Time Reconstruction, " Ecole des Mines, CRI Report A/261 (October 1994).


Polymorphic Specialization for ML - Helsen, Thiemann (2001)   (Correct)

....instantiations allow for different binding time descriptions, the analysis is monovariant. Also, Mogensen s binding time analysis is not directly related (or proven correct) to an actual specializer. The rst use of e ects in a binding time analysis seems to be in a paper by Consel and others [14]. Starting from the simply typed lambda calculus, they annotate function arrows with boolean functions that determine the binding time of the result of the function from the binding times of the function s parameters. They prove a result comparable with subject reduction, give an inference algo4 ....

Charles Consel, Pierre Jouvelot, and Peter rbk. Separate polyvariant bindingtime reconstruction. Technical Report CRI-A/261, Ecole des Mines, Paris, October 1994.


Polymorphic Specialization for ML - Helsen, Thiemann (2002)   (Correct)

....instantiations allow for different binding time descriptions, the analysis is monovariant. Also, Mogensen s binding time analysis is not directly related (or proven correct) to an actual specializer. The first use of e#ects in a binding time analysis seems to be in a paper by Consel and others [14]. Starting from the simply typed lambda calculus, they annotate function arrows with boolean functions that determine the binding time of the result of the function from the binding times of the function s parameters. They prove a result comparable with subject reduction, give an inference algo4 ....

Charles Consel, Pierre Jouvelot, and Peter rbk. Separate polyvariant bindingtime reconstruction. Technical Report CRI-A/261, Ecole des Mines, Paris, October 1994.


A Syntactic Approach to Inferring the Life-Time of Data-Regions - Talpin, Tang (1995)   (1 citation)  (Correct)

....formulate a decidable inference system and present its correct implementation. Our syntactic representation of data regions naturally supports subtyping to approximate sharing properties. Whereas other inference techniques usually make explicit use of subtyping constraints [Aiken al. 1995, Consel al. 1994, Henglein al. 1994, Tang 1994] ours comes with the formulation of the first constraintfree subtype inference algorithm, section 8. Furthermore, it allows using a decidable account to type polymorphism for recursive functions, introduced in [Talpin al. 1995] In association with a ....

....uniform in its results and simpler to reason with: the inference system is decidable, it accepts all well typed expressions, its algorithm is syntactically correct. In conclusion, our technique largely improves over previous techniques in that area [Talpin al. 1994, Tang 1994, Tofte al. 1994, Consel al. 1994] and other type based analysis techniques [Henglein al. 1994, Nielson 1994] It provides a degree of expressiveness which allows reasoning about properties of functional programs with much more precision. Our inference and resolution algorithms are both more precise (using fixed point iteration ....

[Article contains additional citation context not shown here]

Consel, C., Jouvelot, P., and Orbaek, P. Separate Polyvariant Binding-Time Reconstruction. Technical Report A-261, Ecole des Mines de Paris, July 1994.


A Semantic Model of Binding Times for Safe Partial Evaluation - Henglein, Sands (1995)   (3 citations)  (Correct)

.... based on a denotationally specified partial evaluator for a lambda calculus with constants ( mix ) Wand [Wan93] and Palsberg [Pal93] based on the pure lambda calculus, Henglein and Mossin [HM94] for a typed functional language and a denotationally specified partial evaluator, Consel et al. [CJ 94] for a rewriting based approach, and more recently [Hat95] who considers the mechanical verification of the correctness proof for a mix style partial evaluator. Model based The model based approach has its roots in Jones definition of congruence [Jon88] which specifies correctness of ....

....properties of functions. This can be modelled by taking intersections of ideals. Finitary conjunctive properties of functions capture the polyvariant binding time analyses of Gengler and Rytz [GR92] and Consel [Con93] Infinitary conjunctive properties can be expressed as binding time functions [HS91, CJ 94] or polymorphic types [HM94] We plan on extending the monovariant internalisation of this paper to a sound and complete polyvariant internalisation using infinitary conjunction. This, we hope, will enable us to justify both polyvariant analyses as well as the safety of partial evaluators driven ....

Charles Consel, Pierre Jouvelot, and Peter Ørbaek. Separate polyvariant binding time reconstruction. CRI Report A/261, Ecole des Mines, Oct. 1994.


Effect Systems with Subtyping - Tang, Jouvelot (1995)   (8 citations)  Self-citation (Jouvelot)   (Correct)

....to type systems by allowing type coercions to be performed if necessary in the presence of type mismatches. It is often used to captures aspects of object oriented programming [Wand87, Stansifer88] Subtyping in effect systems has been previously introduced in explicitly typed languages [Gifford87, Consel94]. There, a subsumption rule similar to the one presented above was used, but since only type checking was performed, its treatment was simpler than ours. This paper shows that type and effect reconstruction may be performed in an implicitly typed language. Previous implicit effect systems ....

Consel, C., Jouvelot, P., and Orbaek, P. Separate Polyvariant Binding-Time Reconstruction. Technical Report A-261, Ecole des Mines de Paris, July 1994.

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