Measuring the effectiveness of a simple strictness analyser-Reference-Cited by-同舟云学术

Measuring the effectiveness of a simple strictness analyser

Published:1994 Issue: Volume: Page:201-221
ISSN:1431-1682
Container-title:Workshops in Computing
language:
Short-container-title:

Author:

Jones Simon Peyton,Partain Will

Publisher

Springer London

Link

http://link.springer.com/content/pdf/10.1007/978-1-4471-3236-3_17

Reference11 articles.

1. GL Burn [April 1990], “The evaluation transformer model of reduction and its correctness,” in TAPSOFT 91, Brighton.

2. GL Burn, CL Hankin & S Abramsky [Nov 1986], “Strictness analysis for higher order functions,” Science of Computer Programming 7, 249–278.

3. S Finne & G Burn [June 1993], “Assessing the evaluation transformer model of reduction on the spineless G-machine,” in Proc Functional Programming Languages and Computer Architecture, Copenhagen, ACM, 331–340.

4. CV Hall [July 1993], “A framework for optimising abstract data types,” in Glasgow Functional Programming Workshop, Ayr.

5. DB Howe & GL Burn [July 1993], “Using strictness in the STG machine,” in Glasgow Functional Programming Workshop, Ayr.

Cited by 11 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. Promises are made to be broken: migrating R to strict semantics;Proceedings of the ACM on Programming Languages;2021-10-20

4. Modular, higher order cardinality analysis in theory and practice;Journal of Functional Programming;2017

5. Modular, higher-order cardinality analysis in theory and practice;ACM SIGPLAN Notices;2014-01-13