Evaluation transformers — A model for the parallel evaluation of functional languages (extended abstract)-Reference-Cited by-同舟云学术

Evaluation transformers — A model for the parallel evaluation of functional languages (extended abstract)

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

Author:

Burn Geoffrey L.

Publisher

Springer Berlin Heidelberg

Link

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

Reference21 articles.

1. Abramsky, S., Strictness Analysis and Polymorphic Invariance, Workshop on Programs as Data Objects, DIKU, Denmark, 17–19 October, 1985, Ganzinger, H., and Jones, N.D., (eds.) Springer-Verlag LNCS 217, pp. 1–23.

2. Abramsky, S., Abstract Interpretation, Logical Relations and Kan Extensions, Draft Manuscript, Imperial College,University of London, October, 1985.

3. Bevan, D.I., Burn, G.L., Karia, R.J., and Robson, J.D., Design Principles of a Distributed Memory Architecture for Parallel Graph Reduction, Draft Manuscript, January, 1987.

4. Burn, G.L., Abstract Interpretation and the Parallel Evaluation of Functional Languages, PhD Thesis, Department of Computing, Imperial College of Science and Technology, University of London, 1987.

5. Burn, G.L., Head-strictness and its Determination Using Abstract Interpretation, In Preparation, June 1987.

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

1. Proving Properties of Lazy Functional Programs with Sparkle;Central European Functional Programming School;2008

2. Proof Tool Support for Explicit Strictness;Implementation and Application of Functional Languages;2006

3. Compilation of functional languages using flow graph analysis;Software: Practice and Experience;1994-02

4. Lazy type inference for the strictness analysis of lists;Programming Languages and Systems — ESOP '94;1994

5. Partially strict non-recursive data types;Journal of Functional Programming;1993-04