Statistics on graph reduction of SASL programs-Reference-Cited by-同舟云学术

Statistics on graph reduction of SASL programs

Published:1988-03 Issue:3 Volume:18 Page:239-253
ISSN:0038-0644
Container-title:Software: Practice and Experience
language:en
Short-container-title:Softw: Pract. Exper.

Author:

Hartel Pieter H.,Veen Arthur H.

Publisher

Wiley

Subject

Software

Reference24 articles.

1. , , , and , ‘The Dutch parallel reduction machine project’, Proceedings of the International Conference on Frontiers in Computing, Amsterdam, North Holland, December 1987.

2. ‘Analytic modeling of a parallel graph reducer’, Technical Report 79, Sectie informatica, University of Nijmegen, 1986.

3. A new implementation technique for applicative languages

4. ‘Super combinators — a new implementation method for applicative languages’, Programmings of the ACM Symposium on Lisp and Functional Programming, Pittsburgh, 1982.

5. and , ‘Serial combinators: optimal grains of parallelism’, in Functional Programming Languages and Computer Architectures, Springer Verlag, Berlin, 1985.

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

1. Structured Combinators for Efficient Graph Reduction;IEEE Computer Architecture Letters;2022-07-01

2. Two-pass heap profiling: A matter of life and death;Implementation of Functional Languages;1997

3. New dimensions in heap profiling;Journal of Functional Programming;1996-07

4. Heap profiling for space efficiency;Advanced Functional Programming;1996

5. Improving Granularity in Parallel Functional Programs: A Graphical Winnowing System for Haskell;Functional Programming, Glasgow 1994;1995