Export Citations
- Author:
- Budd Timothy A.
No abstract available.
Cited By
- Hammarlund P and Lisper B On the relation between functional and data parallel programming languages Proceedings of the conference on Functional programming languages and computer architecture, (210-219)
- Chatterjee S, Blelloch G and Fisher A Size and access inference for data-parallel programs Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation, (130-144)
- Chatterjee S, Blelloch G and Fisher A (2019). Size and access inference for data-parallel programs, ACM SIGPLAN Notices, 26:6, (130-144), Online publication date: 1-Jun-1991.
- Budd T and Pandey R Compiling APL for parallel and vector execution Proceedings of the international conference on APL '91, (80-87)
- Budd T and Pandey R (1991). Compiling APL for parallel and vector execution, ACM SIGAPL APL Quote Quad, 21:4, (80-87), Online publication date: 1-Jul-1991.
Recommendations
A simple separate compilation mechanism for block-structured languages
A very simple and efficient technique for the introduction of separate compilation facilities into compilers for block-structured languages is presented. Using this technique, programs may be compiled in parts while the compile-time checking advantages ...
Functional programming languages for verification tools: a comparison of Standard ML and Haskell
We compare Haskell with Standard ML as programming languages for verification tools based on our experience developing the verification platform Truth in Haskell and the Edinburgh Concurrency Workbench (CWB) in Standard ML. We review not only technical ...
Definitional Interpreters for Higher-Order Programming Languages
Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters that are themselves written in a programming language based on the lambda calculus (i.e., an applicative language ...