Oaklisp
From Wikipedia, the free encyclopedia
| Oaklisp | |
|---|---|
| Paradigm | multi-paradigm: object-oriented, functional, procedural |
| Appeared in | 1986 |
| Designed by | Kevin J. Lang & Barak A. Pearlmutter |
| Typing discipline | dynamic, strong |
| Major implementations | Oaklisp |
| Influenced by | Scheme, T, Smalltalk |
| Influenced | Java, Dylan |
 |
The introduction to this article provides insufficient context for those unfamiliar with the subject. Please help improve the article with a good introductory style. |
Oaklisp is a portable object-oriented Scheme by Kevin J. Lang and Barak A. Pearlmutter while Computer Science PhD students at Carnegie Mellon University. Oaklisp uses a superset of Scheme syntax. It is based on generic operations rather than functions, and features anonymous classes, multiple inheritance, a strong error system, setters and locators for operations, and a facility for dynamic binding.
Version 1.2 includes an interface, bytecode compiler, run-time system and documentation.
[edit] References
- Kevin J. Lang and Barak A. Pearlmutter (November 1986). "Oaklisp: An object-oriented Scheme with first-class types". ACM SIGPLAN Notices, special issue: Proceedings of OOPSLA '86 21 (11): 30-7.
- Kevin J. Lang and Barak A. Pearlmutter (May 1988). "Oaklisp: an object-oriented dialect of Scheme". Lisp and Symbolic Computation 1 (1): 39-51. Kluwer Academic Publishers.
- Barak A. Pearlmutter and Kevin J. Lang (1991). "The Implementation of Oaklisp", in Peter Lee: Topics in Advanced Language Implementation. Cambridge MA: MIT Press, 189-215. ISBN 0-262-12151-4.
[edit] External links
This article was originally based on material from the Free On-line Dictionary of Computing, which is licensed under the GFDL.
