Projections for strictness analysis-Reference-Cited by-同舟云学术

Projections for strictness analysis

Published:1987 Issue: Volume: Page:385-407
ISSN:0302-9743
Container-title:Functional Programming Languages and Computer Architecture
language:
Short-container-title:

Author:

Wadler Philip,Hughes R. J. M.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-18317-5_21.pdf

Reference30 articles.

1. S. Abramsky. Strictness analysis and polymorphic invariance. In N. Jones and H. Ganzinger, editors, Workshop on Programs as Data Objects, Springer-Verlag, Copenhagen, October 1985. LNCS 217.

2. S. Abramsky and C. Hankin. Abstract Interpretation of Declarative Languages. Ellis Horwood, 1987.

3. L. Augustsson. A compiler for lazy ML. In ACM Symposium on Lisp and Functional Programming, pages 218–227, Austin, 1984.

4. LNCS;G. L. Burn,1985

5. B. Bjerner. Complexity analysis of Programs in type theory. Programming Methodology Group, Chalmers University of Technology, Göteborg, Sweden, 1987.

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

1. Story of Your Lazy Function’s Life: A Bidirectional Demand Semantics for Mechanized Cost Analysis of Lazy Programs;Proceedings of the ACM on Programming Languages;2024-08-15

2. PureCake: A Verified Compiler for a Lazy Functional Language;Proceedings of the ACM on Programming Languages;2023-06-06

3. Resource Analysis for Lazy Evaluation with Polynomial Potential;IFL 2020: Proceedings of the 32nd Symposium on Implementation and Application of Functional Languages;2020-09-02

4. Call-by-need is clairvoyant call-by-value;Proceedings of the ACM on Programming Languages;2019-07-26

5. Cactus Environment Machine;Lecture Notes in Computer Science;2019