|
|
1.1 ! root 1: .\" Copyright (c) 1980 Regents of the University of California. ! 2: .\" All rights reserved. The Berkeley software License Agreement ! 3: .\" specifies the terms and conditions for redistribution. ! 4: .\" ! 5: .\" @(#)lisp.1 6.1 (Berkeley) 4/29/85 ! 6: .\" ! 7: .TH LISP 1 "April 29, 1985" ! 8: .UC 4 ! 9: .SH NAME ! 10: lisp \- lisp interpreter ! 11: .SH SYNOPSIS ! 12: .B lisp ! 13: .SH DESCRIPTION ! 14: .I Lisp ! 15: is a lisp interpreter for a dialect which ! 16: closely resembles MIT's M\s-2ACLISP\s0. ! 17: This lisp, known as F\s-2RANZ\s0\ L\s-2ISP\s0, features ! 18: an I/O facility which allows the user to change the input ! 19: and output syntax, add ! 20: macro characters, and maintain compatibility with upper-case ! 21: only lisp systems; ! 22: infinite precision integer arithmetic, and ! 23: an error facility which allows the user to trap system errors in ! 24: many different ways. ! 25: Interpreted functions may be mixed with code compiled by ! 26: .IR liszt (1) ! 27: and both may be debugged using the ! 28: ``Joseph Lister'' trace package. ! 29: A ! 30: .I lisp ! 31: containing compiled and interpreted code may be dumped into ! 32: a file for later use. ! 33: .LP ! 34: There are too many functions to list here; one should refer to the ! 35: manuals listed below. ! 36: .SH AUTHORS ! 37: An early version was written by Jeff Levinsky, Mike Curry, and John Breedlove. ! 38: Keith Sklower wrote and is maintaining the current version, ! 39: with the assistance of John Foderaro. ! 40: The garbage collector was implemented by Bill Rowan. ! 41: .SH FILES ! 42: .ta 2.4i ! 43: /usr/lib/lisp/trace.l Joseph Lister trace package ! 44: .br ! 45: /usr/lib/lisp/toplevel.l top level read-eval-print loop ! 46: .SH SEE ALSO ! 47: liszt(1), ! 48: lxref(1) ! 49: .br ! 50: `F\s-2RANZ\s0\ L\s-2ISP\s0 Manual, Version 1' ! 51: by John K. Foderaro ! 52: .br ! 53: M\s-2ACLISP\s0 Manual ! 54: .SH "BUGS" ! 55: The error system is in a state of flux and not all error messages are ! 56: as informative as they could be.
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.