Abstract
The work reported in this paper represents the convergence of ideas stemming from two areas of research. In the hardware field there has been significant interest in developing the techniques of Wafer Scale Integration to provide large assemblies of tightly-coupled simple processors that can act cooperatively in the execution of a task. In the software field there has been a growing awareness that declarative languages lead to higher programmer productivity and offer more potential for parallel evaluation than the traditional, imperative languages.
This paper describes the first machine in a family called COBWEB. The common denominator of the family is that all of the machines are targetted to supporting functional languages and all execute some form of combinator code. The first machine employs normal order reduction to evaluate pure functional programs. The next machine will use a parallel reduction strategy and later members will support progressively more sophisticated facilities. All of the machine are intended to exploit the potential of Wafer Scale Integration.
Preview
Unable to display preview. Download preview PDF.
References
Aubusson R C, Catt I "Wafer Scale Integration — A Fault Tolerant Procedure", IEEE Journal of Solid State Circuits, Vol Sc-13, June 1978.
Aubusson R C, Gledhill R J "Wafer Scale Integration — Some Approaches to the Interconnection Problem", Microelectronics, Vol 9, 1978.
Backus J "Can programming be liberated from the von Neumann Style?", CACM, Vol 21 No 8, 1978.
Burn G L, Hankin C L, Abramsky S "The Theory and Practice of Strictness Analysis for Higher Order Functions", Imperial College Research Report DoC 85/6, 1985.
Burstall R M, McQueen D B, Sanella D T "HOPE: An experimental Applicative Language", University of Edinburgh, 1980.
Clarke T J W, Gladstone P J S, Maclean C D, Norman A C "SKIM — The S, K, I Reduction Machine", ACM Conference on LISP and Functional Programming Languages, 1980.
Cousineau G, Curien P-L, Mauny M "The Categorical Abstract Machine", Universite Paris VII Report 85-8, 1985.
Darlington J, Reeve M "A Multi-processor Reduction Machine for the Parallel Evaluation of Applicative Languages", Proceedings of the ACM/MIT Conference on Functional Programming Languages and Computer Architecture, 1981.
French E F, Glaser H W "Tuki, A Data Flow Processor", Computer Architecture News, March 1983.
Glaser H W, Hankin C L, Till D R "Principles of Functional Programming" Prentice Hall International, September 1984.
Hankin C L "A data flow model of parallel processing", Ph.D. thesis, University of London, 1979.
Lea R M, Streetharan M "VLSI — DLMs: A structured approach to Chip Architecture", Brunel University.
Lea R M, Streetharan M "WSI Distributed Logic Memories", Caltech Conference on VLSI, 1979.
Mago G A "A Cellular Computer Architecture for Functional Programming", Compcon, 1980.
Mycroft A "Abstract Interpretation and Optimising Transformations for Applicative Programs", PhD thesis, University of Edinburgh, October 1984.
Osmon P E "Hierarchical Language Derived Data Flow Architectures", ICS 81, IPC Science and Technology Press, 1981.
Peyton Jones S L, Clack C, Harris N "GRIP — A parallel graph reduction machine", University College Internal Note 1665, 1985.
Shute M J "The Role of Simulation in the Study of Multiprocessor, Control Flow and Data Flow Systems", PhD thesis(2 vols), University of London, 1983.
Turner D A "A New Implementation Technique for Applicative Languages", Software Practice and Experience, January 1979.
Turner D A "Another Algorithm for Bracket Abstraction", Journal of Symbolic Logic, Vol 44 No 2, June 1979.
Watson I, Gurd J "A Practical Data Flow Computer", IEEE Computer, February 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hankin, C., Osmon, P., Shute, M. (1985). Cobweb — A combinator reduction architecture. In: Jouannaud, JP. (eds) Functional Programming Languages and Computer Architecture. FPCA 1985. Lecture Notes in Computer Science, vol 201. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15975-4_32
Download citation
DOI: https://doi.org/10.1007/3-540-15975-4_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15975-9
Online ISBN: 978-3-540-39677-2
eBook Packages: Springer Book Archive