Smalltalk-80: the language and its implementation
Smalltalk-80: the language and its implementation
The g-machine: a fast, graph-reduction evaluator
Proc. of a conference on Functional programming languages and computer architecture
Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
The C++ programming language
Efficient compilation of linear recursive functions into object level loops
SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
Combinatory code and a parallel packet-based computational model
ACM SIGPLAN Notices
Overview of concert multilisp: a multiprocessor symbolic computing system
ACM SIGARCH Computer Architecture News
The Illinois functional programming interpreter
SIGPLAN '87 Papers of the Symposium on Interpreters and interpretive techniques
Theoretical Computer Science
The semantics of destructive LISP
The semantics of destructive LISP
Implementing functional languages on a combinator-based reduction machine
ACM SIGPLAN Notices
Are applicative languages inefficient?
ACM SIGPLAN Notices
MaRs: a parallel graph reduction multiprocessor
ACM SIGARCH Computer Architecture News
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Communications of the ACM
Why functional programming matters
The Computer Journal - Special issue on Lazy functional programming
Stack computers: the new wave
Conception, evolution, and application of functional programming languages
ACM Computing Surveys (CSUR)
A fresh look at combinator graph reduction
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Efficient stack allocation for tail-recursive languages
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
ACM SIGPLAN Notices
FLIP-FLOP: a stack-oriented multiprocessing system
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
The spineless tagless G-machine
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
ACM Transactions on Programming Languages and Systems (TOPLAS)
Copying and Swapping: Influences on the Design of Reusable Software Components
IEEE Transactions on Software Engineering
Is there a use for linear logic?
PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
O.LISP theoretical basis and description
ACM SIGPLAN Notices
Structured programming with limited private types in Ada: nesting if for the soaring eagles
ACM SIGAda Ada Letters
The HDG-machine: a highly distributed graph-reducer for a transputer network
The Computer Journal - Special issue: Concurrent programming
Cache behavior of combinator graph reduction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving memory management invariants for a language based on linear logic
LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
ACM SIGARCH Computer Architecture News
Lively linear Lisp: “look ma, no garbage!”
ACM SIGPLAN Notices
Fips: a functional-imperative language for explorative programming
ACM SIGPLAN Notices
HOPL-II The second ACM SIGPLAN conference on History of programming languages
Equal rights for functional objects or, the more things change, the more they are the same
ACM SIGPLAN OOPS Messenger
Sparse polynomials and linear logic
ACM SIGSAM Bulletin
A Theory of Computer Instructions
Journal of the ACM (JACM)
Optimal Code Generation for Expression Trees
Journal of the ACM (JACM)
Code Generation for a One-Register Machine
Journal of the ACM (JACM)
Code Generation for Expressions with Common Subexpressions
Journal of the ACM (JACM)
Efficient Computation of Expressions with Common Subexpressions
Journal of the ACM (JACM)
Instruction Sets for Evaluating Arithmetic Expressions
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Analysis of pointer “rotation”
Communications of the ACM
Architecture of the IBM system/370
Communications of the ACM - Special issue on computer architecture
Empirical evaluation of some features of instruction set processor architectures
Communications of the ACM
Implications of structured programming for machine architecture
Communications of the ACM
Communications of the ACM
SIMULA: an ALGOL-based simulation language
Communications of the ACM
A method for overlapping and erasure of lists
Communications of the ACM
Metacircular semantics for common Lisp special forms
ACM SIGPLAN Lisp Pointers
Reference Manual for the ADA Programming Language
Reference Manual for the ADA Programming Language
Mechanisms for compile-time enforcement of security
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Computer Engineering; A DEC View of Hardware Systems Design
Computer Engineering; A DEC View of Hardware Systems Design
An analysis of C machine support for other block-structured languages
ACM SIGARCH Computer Architecture News
Just a few more words on microprocessors of the future
ACM SIGARCH Computer Architecture News
On the use of stacks in the evaluation of expressions
ACM SIGARCH Computer Architecture News
On the evaluation of expressions using accumulators, stacks and store-to-store instructions
ACM SIGARCH Computer Architecture News
The case for the reduced instruction set computer
ACM SIGARCH Computer Architecture News
Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
NREVERSAL of Fortune - The Thermodynamics of Garbage Collection
IWMM '92 Proceedings of the International Workshop on Memory Management
ALICE a multi-processor reduction machine for the parallel evaluation CF applicative languages
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
The case against stack-oriented instruction sets
ACM SIGARCH Computer Architecture News
An evaluation of code space requirements and performance of various architectures
ACM SIGARCH Computer Architecture News
Efficient encoding of machine instructions
ACM SIGARCH Computer Architecture News
More on the use of stacks in the evaluation of expressions
ACM SIGARCH Computer Architecture News
Rabbit: A Compiler for Scheme
Containment defines a class of recursive data structures
ACM SIGPLAN Notices
ACM SIGPLAN Notices
Threaded interpretive systems and functional programming environments
ACM SIGPLAN Notices
Algol-60 Implementation
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
Common Lisp: The Language
ACM SIGARCH Computer Architecture News
A combined register-stack architecture
ACM SIGARCH Computer Architecture News
The Boyer benchmark meets linear logic
ACM SIGPLAN Lisp Pointers
Techniques for embedding postfix languages in Haskell
Proceedings of the 2002 ACM SIGPLAN workshop on Haskell
When–and how–can a cellular automaton be rewritten as a lattice gas?
Theoretical Computer Science
A Virtual Machine for Supporting Reversible Probabilistic Guarded Command Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Girard's linear logic can be used to model programming languages in which each bound variable name has exactly one "occurrence"---i.e., no variable can have implicit "fan-out"; multiple uses require explicit duplication. Among other nice properties, "linear" languages need no garbage collector, yet have no dangling reference problems. We show a natural equivalence between a "linear" programming language and a stack machine in which the top items can undergo arbitrary permutations. Such permutation stack machines can be considered combinator abstractions of Moore's Forth programming language.