Efficient type inference for higher-order binding-time analysis-Reference-Cited by-同舟云学术

Efficient type inference for higher-order binding-time analysis

Published:1991 Issue: Volume: Page:448-472
ISSN:0302-9743
Container-title:Functional Programming Languages and Computer Architecture
language:
Short-container-title:

Author:

Henglein Fritz

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3540543961_22.pdf

Reference43 articles.

1. A. Aho, J. Hopcroft, and J. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.

2. A. Aho, R. Sethi, and J. Ullman. Compilers: Principles, Techniques, and Tools. Addison Wesley, 1986. Addison-Wesley, 1986, Reprinted with corrections, March 1988.

3. A. Bondorf, N. Jones, T. Mogensen, and P. Sestoft. Binding time analysis and the taming of self-application. Sep. 1988. To appear in Transactions on Programming Languages and Systems (TOPLAS).

4. A. Bondorf. Automatic autoprojection of higher order recursive equations. In N. Jones, editor, Proc. 3rd European Symp. on Programming (ESOP '90), Copenhagen, Denmark, pages 70–87, Springer, May 1990. Lecture Notes in Computer Science, Vol. 432.

5. A. Bondorf. Self-Applicable Partial Evaluation. PhD thesis, DIKU, University of Copenhagen, Dec. 1990.

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

1. On-the-Fly Static Analysis via Dynamic Bidirected Dyck Reachability;Proceedings of the ACM on Programming Languages;2024-01-05

2. Enhanced type inference for binding-time analysis;Acta Universitatis Sapientiae, Informatica;2020-12-01

3. A Type Inference System Based on Saturation of Subtyping Constraints;Lecture Notes in Computer Science;2019

4. Dynamic Flow Analysis for JavaScript;Lecture Notes in Computer Science;2019

5. Selective CPS transformation for shift and reset;Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation - PEPM '18;2018