A unified framework for binding-time analysis-Reference-Cited by-同舟云学术

A unified framework for binding-time analysis

Published:1997 Issue: Volume: Page:742-756
ISSN:0302-9743
Container-title:TAPSOFT '97: Theory and Practice of Software Development
language:
Short-container-title:

Author:

Thiemann Peter

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0030638

Reference34 articles.

1. R. M. Amadio and L. Cardelli. Subtyping recursive types. ACM Trans. Prog. Lang. Syst., 15(4):575–631, 1993.

2. L. Birkedal and M. Welinder. Binding-time analysis for Standard-ML. In P. Sestoft and H. SØndergaard, editors, Proc. ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation PEPM '94, pages 61–71, Orlando, Fla., June 1994. ACM.

3. A. Bondorf. Automatic autoprojection of higher order recursive equations. Science of Programming, 17:3–34, 1991.

4. A. Bondorf and J. JØrgensen. Efficient analysis for realistic off-line partial evaluation. Journal of Functional Programming, 3(3):315–346, July 1993.

5. C. Consel. Binding time analysis for higher order untyped functional languages. In LFP 1990 [23], pages 264–272.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Dependent Dependency Calculus;Programming Languages and Systems;2022

2. Continuation-Based Partial Evaluation without Continuations;Static Analysis;2003

3. Program Generation, Termination, and Binding-Time Analysis;Generative Programming and Component Engineering;2002

4. Fragmental Specialization;Lecture Notes in Computer Science;2000

5. Two Flavors of Offine Partial Evaluation;Advances in Computing Science ASIAN 98;1998