Equational logic as a programming language
Equational logic as a programming language
How to replace failure by a list of successes
Proc. of a conference on Functional programming languages and computer architecture
Design for a multiprocessing heap with on-board reference counting
Proc. of a conference on Functional programming languages and computer architecture
The C programming language
Design of a LISP-based microprocessor
Communications of the ACM
An efficient list-moving algorithm using constant workspace
Communications of the ACM
An efficient machine-independent procedure for garbage collection in various list structures
Communications of the ACM
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Some practical methods for rapid combinator reduction
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Super-combinators a new implementation method for applicative languages
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
A correctness proof for combinator reduction with cycles
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |