Strictness analysis — a practical approach-Reference-Cited by-同舟云学术

Strictness analysis — a practical approach

Published:1985 Issue: Volume: Page:35-49
ISSN:0302-9743
Container-title:Functional Programming Languages and Computer Architecture
language:
Short-container-title:

Author:

Clack Chris,Peyton Jones Simon L

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-15975-4_28.pdf

Reference12 articles.

1. Burn G, Hankin C, and Abramsky S, "Strictness analysis of higher order functions", Dept of Computer Science, Imperial College, Lone, June 1985.

2. Cousot P and Cousot R, "Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixed points", in Proc 4th ACM Symposium on Principles of Programming Languages, Los Angeles, 1977.

3. Hudak P and Kranz D, "A combinator-based compiler for a functional language", 11th Annual symposium on Principles of Programming Languages, January 1984.

4. Hudak P and Young J, "A set theoretic characterisation of function strictness", Proc Aspenas Workshop on Implementations of Functional Languages, Chalmers Inst, Goteborg, Sweden, Jan 1985.

5. Hughes RJM "Graph reduction with supercombinators", PRG-25, Programming Research Group, Oxford, June 1982.

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

1. Weaving Parallel Threads;Search-Based Software Engineering;2015

2. A Policy Iteration Algorithm for Computing Fixed Points in Static Analysis of Programs;Computer Aided Verification;2005

3. Context-Sensitive Rewriting Strategies;Information and Computation;2002-10

4. Time Stamps for Fixed-Point Approximation;Electronic Notes in Theoretical Computer Science;2001-11

5. Balloon types: Controlling sharing of state in data types;ECOOP'97 — Object-Oriented Programming;1997