Strictness analysis and polymorphic invariance-Reference-Cited by-同舟云学术

Strictness analysis and polymorphic invariance

Published:1986 Issue: Volume: Page:1-23
ISSN:0302-9743
Container-title:Programs as Data Objects
language:
Short-container-title:

Author:

Abramsky Samson

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-16446-4_1

Reference12 articles.

1. Barendregt, H. The Lambda Calculus: Syntax and Semantics 2nd. ed., North Holland, Amsterdam, 1984.

2. Burn, G. Hankin, C. and Abramsky, S. "Strictness Analysis For Higher Order Functions", to appear in Science Of Computer Programming, also Imperial College Department Of Computing Research Report DOC 85/6, 1985.

3. Clack, C. and Peyton Jones, S. "Generating Parallelism from Strictness Analysis", to appear in Proc. IFIP International Conference On Functional Languages and Computer Architectures, Springer LNCS, 1985.

4. Damas, L. and Milner, R. "Principal Type Schemes for Functional Programs", in Proc. 9th ACM Symposium On Principles Of Programming Languages, 1982.

5. Hennessy, M. C. B. and Ashcroft, E. A. "A Mathematical Semantics For A Nondeterministic Typed λ-Calculus", Theoretical Computer Science 11 (1980) pp. 227–245, 1980.

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

1. Payoffs, Intensionality and Abstraction in Games;Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky;2013

2. Efficient compile-time garbage collection for arbitrary data structures;Programming Languages: Implementations, Logics and Programs;1995

3. Efficient closure utilisation by higher-order inheritance analysis;Static Analysis;1995

4. Efficient strictness analysis of Haskell;Static Analysis;1994

5. Finiteness conditions for strictness analysis;Static Analysis;1993