The Boyer benchmark meets linear logic
- 1 October 1993
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Lisp Pointers
- Vol. VI (4), 3-10
- https://doi.org/10.1145/181889.181890
Abstract
No abstract availableThis publication has 27 references indexed in Scilit:
- Linear logic and permutation stacks—the Forth shall be firstACM SIGARCH Computer Architecture News, 1994
- A “linear logic” QuicksortACM SIGPLAN Notices, 1994
- Sparse polynomials and linear logicACM SIGSAM Bulletin, 1993
- Lively linear LispACM SIGPLAN Notices, 1992
- The buried binding and dead binding problems of Lisp 1.5ACM SIGPLAN Lisp Pointers, 1992
- Copying and swapping: influences on the design of reusable software componentsIEEE Transactions on Software Engineering, 1991
- Axioms and models of linear logicFormal Aspects of Computing, 1990
- The linear abstract machineTheoretical Computer Science, 1988
- Containment defines a class of recursive data structuresACM SIGPLAN Notices, 1983
- An empirical study of list structure in LispCommunications of the ACM, 1977