Public Domain Knowledge Bank - User contributions [en]

SubL

2017-04-17T09:59:48Z

DouglasRMiles:

[[|]]

== [http://web.archive.org/web/20060325065433/http://www.opencyc.org [[File:/web/20060325065433im_/http://www.cyc.com/cycdoc/img/opencyc-logo-small.gif|OpenCyc.org Homepage]]]SubL Reference ==

E-Mail Comments to: [http://web.archive.org/web/20060325065433/mailto:opencyc-doc@cyc.com opencyc-doc@cyc.com] 
Last Update: 03/28/2002 
''CopyrightÂ© 1996-2002 [http://web.archive.org/web/20060325065433/http://www.cyc.com Cycorp]. All rights reserved.'' 
------------------------------------------------------------------------

= How to Use this Document =

SubL is a computer language built by members of Cycorp. SubL was written to support the CycÂ® application, allowing it to run both under Lisp environments and as a C application generated by a SubL-to-C translator. This document describes the primitive functions of SubL.

Due to the close similarities between SubL and Common Lisp, the [[#Table-of-Contents|Table of Contents]] and structure of this document intentionally mirror that of

<blockquote>'''"Common Lisp: The Language"''', 
2nd Edition, 
Guy L. Steele Jr 
</blockquote>
making it easy to compare and contrast the two languages. For the most part, this document focuses only on the differences between SubL and Common Lisp.

An online version of [http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/clm.html "Common Lisp: The Language"] can be found at

<blockquote>[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/clm.html '''<code>http://www.supelec.fr/docs/cltl/clm/clm.html</code>'''] **not working**
</blockquote>
and an [http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/index.html index to all Common Lisp functions] can be found at

<blockquote>[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/index.html '''<code>http://www.supelec.fr/docs/cltl/clm/index.html</code>'''] **this is working**
</blockquote>
Each section of this document contains a link labelled '''"CLtL2 Reference"''' to the corresponding sections of the above online Common Lisp reference. The reader is strongly encouraged to consult that reference in parallel with this document. [[|]]

-----

[[|]]

-----

= 1 : Introduction =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node5.html CLtL2 Reference]

SubL is a programming language intended to be very similar to a simplified version of Common Lisp where those features that are either complex, rarely-used, or difficult to implement in a prodecural language have been excised.

Unlike Common Lisp, SubL is not a purely functional language. Several SubL constructs can only be used procedurally. In order to emphasize this difference, the following naming convention for SubL constructs is used:

<blockquote>A SubL function will have the same name as the analogous Common Lisp function if it is intended to have the exact same basic functionality. The argument list may be simplified, but the intent and use are likely to be the same.
</blockquote>
If there is a substantial behavioral difference between a SubL function and its Common Lisp counterpart, its name will be the Common Lisp name prepended with a single character -- either "c", "p" or "f".

<blockquote>"c" indicates a construct that is either only procedural or functional. 
"p" indicates the procedural version of a Common Lisp construct. 
"f" indicates the functional version of a Common Lisp construct. 
</blockquote>
A procedural construct in SubL is one which is suitable for evaluation as either one form in an explicit [[#FN-DEF-PROGN|<code>PROGN</code>]] or as one form in an implicit progn, which occur in the <code>&body;</code> sections of many of the procedural forms such as [[#FN-DEF-CLET|<code>CLET</code>]], [[#FN-DEF-PWHEN|<code>PWHEN</code>]], [[#FN-DEF-CDOLIST|<code>CDOLIST</code>]] etc.

Here is a table of all the procedural constructs in SubL and the Common Lisp analog:

<blockquote>'''SubL Procedural Construct'''

'''Common Lisp Equivalent'''

-----

<code>PROGN</code>

<code>progn</code>

<code>PIF</code>

<code>if</code>

<code>PWHEN</code>

<code>when</code>

<code>PUNLESS</code>

<code>unless</code>

<code>PCOND</code>

<code>cond</code>

<code>PCASE</code>

<code>case</code>

<code>CSETQ</code>

<code>setq</code>

<code>CSETF</code>

<code>setf</code>

<code>CINC</code>

<code>incf</code>

<code>CDEC</code>

<code>decf</code>

<code>CPUSH</code>

<code>push</code>

<code>CPUSHNEW</code>

<code>pushnew</code>

<code>CPOP</code>

<code>pop</code>

<code>CLET</code>

<code>let*</code>

<code>CMULTIPLE-VALUE-BIND</code>

<code>multiple-value-bind</code>

<code>CDO</code>

<code>do*</code>

<code>CDOLIST</code>

<code>dolist</code>

<code>CSOME</code>

` `

<code>CDOTIMES</code>

<code>dotimes</code>

<code>CDOHASH</code>

` `

<code>CCATCH</code>

<code>catch</code>

<code>CUNWIND-PROTECT</code>

<code>unwind-protect</code>

<code>RET</code>

<code>return-from</code>
</blockquote>
A functional construct in SubL is one which returns a value. Here is a table of all the functional constructs in SubL and the Common Lisp analog:

<blockquote>'''SubL Functional Construct'''

'''Common Lisp Equvalent'''

-----

<code>CAND</code>

<code>and</code>

<code>COR</code>

<code>or</code>

<code>CNOT</code>

<code>not</code>

<code>FIF</code>

<code>if</code>

<code>FWHEN</code>

<code>when</code>

<code>FUNLESS</code>

<code>unless</code>
</blockquote>
The body of a function or macro definition is considered an implicit progn, and so all forms in the body should be procedural. A function call can be used as a procedural construct. In this case, the returned value is simply ignored. [[|]]

-----

= 2 : Data Types =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node15.html CLtL2 Reference]

SubL has a flat type heirarchy. Each type is described in more detail in the sections about the methods for that particular type.

SubL supports these built-in Common Lisp datatypes:

<blockquote>{|
| Numbers:
| fixnum
|-
|

| float
|-
| Symbols:
| symbol
|-
| Lists:
| cons
|-
| Arrays:
| vector
|-
| Characters:
| character
|-
| Strings:
| string
|-
| Hashtables:
| eq hashtable
|-
|

| eql hashtable
|-
|

| equal hashtable
|-
|

| equalp hashtable
|-
| Streams:
| stream
|-
| Functions:
| function
|}

SubL does '''not''' support these Common Lisp datatypes:
</blockquote>
<blockquote>Multi-dimensional arrays 
Packages 
Pathnames 
Random-states 
Lambda-Expressions or Closures 
</blockquote>
SubL has only special-case support for these datatypes:

<blockquote>{|
| Readtables:
| SubL only supports a single internal readtable
|}

New data types can be introduced via [[#FN-DEF-DEFSTRUCT|<code>DEFSTRUCT</code>]]. [[|]]
</blockquote>

-----

= 3 : Scope and Extent =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node43.html CLtL2 Reference]

Special variables in SubL are all (and only) those variables defined globally with [[#FN-DEF-DEFVAR|<code>DEFVAR</code>]] or [[#FN-DEF-DEFPARAMETER|<code>DEFPARAMETER</code>]]. In addition, the name of each special variable must begin and end with an asterisk character : <code>'*'</code>.

Special variables have indefinite scope and dynamic extent. All other variables have lexical scope and dynamic extent

Variables are introduced via:

; '''Function call'''
: A new set of variables for the formal parameters of the function are introduced. The extent of the function arguments is the duration of the function invocation.
; '''[[#FN-DEF-CLET|<code>CLET</code>]], [[#FN-DEF-CMULTIPLE-VALUE-BIND|<code>CMULTIPLE-VALUE-BIND</code>]], [[#FN-DEF-CDESTRUCTURING-BIND|<code>CDESTRUCTURING-BIND</code>]]'''
: These constructs explicitly introduce and initialize new local variables. The extent of these variables is until exit from the constuct.
; '''[[#FN-DEF-CDO|<code>CDO</code>]], [[#FN-DEF-CDOLIST|<code>CDOLIST</code>]], [[#FN-DEF-CSOME|<code>CSOME</code>]], [[#FN-DEF-CDOTIMES|<code>CDOTIMES</code>]], [[#FN-DEF-CDOHASH|<code>CDOHASH</code>]]'''
: These iteration constructs explicitly introduce and update local variables which represent the state of the iteration. The extent of these variables is until exit from the iteration construct.

When a local variable is introduced with the same name as a local variable which is already within the current scope and extent, the new variable shadows the outer variable.

The initialization of a local variable is considered to occur within the scope of the new local variable. Consequently, a variable which is shadowing an outer variable cannot be initialized in terms of the outer value. For example, this is not allowed :

<blockquote><pre>(define foo (x)
(clet ((x (+ x 1)))
(print x))
(ret nil))</pre></blockquote>
However, if the variable is a special variable, the [[#FN-DEF-CLET|<code>CLET</code>]] is actually introducing a binding for the special variable, not introducing a new local variable. In this case, the initialization of the binding can be a function of its current value for the variable being bound. For example, this is allowed:

<blockquote><pre>(defvar *some-var* 1)

(define foo (x)
(clet ((*some-var* (+ *some-var* x)))
(print *some-var*))
(ret nil))</pre></blockquote>
The construct [[#FN-DEF-RET|<code>RET</code>]] must be used for a function or macro definition to return its intended result. [[|]]

-----

= 4 : Type Specifiers =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node44.html CLtL2 Reference]

SubL does not support type specifiers. [[|]]

-----

= 5 : Program Structure =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node55.html CLtL2 Reference]

Program structure in SubL mirrors that of Common Lisp almost exactly. All objects except lists and symbols are self-evaluating. This includes numbers, characters, strings, vectors and hashtables. In addition :

* Keyword symbols are self-evaluating.
* The symbols T and NIL are self-evaluating.

[[|]]

== 5.3.1 : Defining Named Functions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node66.html CLtL2 Reference] 
 
[[|]]macro <code>DEFINE : (name arglist &body body)</code>

All functions in SubL must be named and therefore defined via the SubL construct [[#FN-DEF-DEFINE|<code>DEFINE</code>]]. See also the similar construct [[#FN-DEF-DEFPOLYMORPHIC|<code>DEFPOLYMORPHIC</code>]] which is used to define generic functions which switch off the type of the first argument.

Argument lists for user-defined function can only be of this form:

<blockquote><pre>( {var}* [&optional; {var | ( var [initform [supplied-var]] ) }*] )</pre></blockquote>
In short, SubL supports <code>&optional;</code> arguments for user-defined functions but does '''not''' support <code>&keyword;</code>, <code>&aux;</code> or <code>&rest;</code> arguments for user-defined functions. [[|]]

== 5.3.2 : Declaring Global Variables and Named Constants ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node67.html CLtL2 Reference] 
 
[[|]]macro <code>DEFVAR : (variable &optional initialization documentation)</code> 
 
[[|]]macro <code>DEFPARAMETER : (variable initialization &optional documentation)</code>

[[#FN-DEF-DEFVAR|<code>DEFVAR</code>]] and [[#FN-DEF-DEFPARAMETER|<code>DEFPARAMETER</code>]] are the SubL constructs used to define global variables. The name of each variable must begin and end with an asterisk.

SubL enforces an important distinction between these two constructs, which is described in greater detail under [[#FN-DEF-WRITE-IMAGE|<code>WRITE-IMAGE</code>]]. 
 
[[|]]macro <code>DEFCONSTANT : (variable initialization &optional documentation)</code>

As with [[#FN-DEF-DEFVAR|<code>DEFVAR</code>]] and [[#FN-DEF-DEFPARAMETER|<code>DEFPARAMETER</code>]], the name of each named constant defined via [[#FN-DEF-DEFCONSTANT|<code>DEFCONSTANT</code>]] must begin and end with an asterisk. [[|]]

-----

= 6 : Predicates =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node69.html CLtL2 Reference] [[|]]

== 6.1 : Logical Values ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node70.html CLtL2 Reference]

The symbols NIL and T are used to represent the logical values "true" and "false" in SubL and behave exactly as they do in Common Lisp. [[|]]

== 6.2.2 : Specific Data Type Predicates ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node73.html CLtL2 Reference]

For the most part, the following predicates which check for specific data types behave exactly as they do in Common Lisp. 
 
[[|]]function <code>NULL : (x)</code> 
 
[[|]]function <code>SYMBOLP : (x)</code> 
 
[[|]]function <code>ATOM : (x)</code> 
 
[[|]]function <code>CONSP : (x)</code> 
 
[[|]]function <code>LISTP : (x)</code> 
 
[[|]]function <code>NUMBERP : (x)</code> 
 
[[|]]function <code>INTEGERP : (x)</code> 
 
[[|]]function <code>FLOATP : (x)</code> 
 
[[|]]function <code>CHARACTERP : (x)</code> 
 
[[|]]function <code>STRINGP : (x)</code> 
 
[[|]]function <code>VECTORP : (x)</code> 
 
[[|]]function <code>FUNCTIONP : (x)</code> 
Follows the CLtL2 implementation 
 
[[|]]function <code>FUNCTION-SPEC-P : (x)</code> 
Returns T IFF x is an object suitable for FUNCALL

In SubL, [[#FN-DEF-FUNCTIONP|<code>FUNCTIONP</code>]] only returns T if its argument is a function object. The function [[#FN-DEF-FUNCTION-SPEC-P|<code>FUNCTION-SPEC-P</code>]] returns T if its argument is suitable for [[#FN-DEF-FUNCALL|<code>FUNCALL</code>]] or [[#FN-DEF-APPLY|<code>APPLY</code>]]. [[|]]

== 6.3 : Equality Predicates ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node74.html CLtL2 Reference]

The SubL equality predicates behave exactly like their Common Lisp counterparts. 
 
[[|]]function <code>EQ : (x y)</code> 
 
[[|]]function <code>EQL : (x y)</code> 
 
[[|]]function <code>EQUAL : (x y)</code> 
 
[[|]]function <code>EQUALP : (x y)</code> [[|]]

== 6.4 : Logical Operators ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node75.html CLtL2 Reference]

SubL logical operations '''only''' return T or NIL. Otherwise, they behave like their Common Lisp counterparts. 
 
[[|]]macro <code>CNOT : (x)</code> 
 
[[|]]macro <code>CAND : (&rest args)</code> 
 
[[|]]macro <code>COR : (&rest args)</code> [[|]]

-----

= 7 : Control Structure =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node76.html CLtL2 Reference] [[|]]

== 7.1.1 : Reference ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node78.html CLtL2 Reference]

These SubL constructs behave exactly like their Common Lisp counterparts. 
 
[[|]]function <code>QUOTE : (data)</code> 
 
[[|]]macro <code>FUNCTION : (fspec)</code> 
 
[[|]]function <code>SYMBOL-VALUE : (x)</code> 
 
[[|]]function <code>SYMBOL-FUNCTION : (x)</code> 
 
[[|]]function <code>BOUNDP : (x)</code> 
 
[[|]]function <code>FBOUNDP : (x)</code> [[|]]

== 7.1.2 : Assignment ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node79.html CLtL2 Reference] 
 
[[|]]macro <code>CSETQ : (var value &rest var-val-pairs)</code>

Since [[#FN-DEF-CSETQ|<code>CSETQ</code>]] is procedural in SubL, it does not return a value. Otherwise, it behaves just like <code>setq</code> in Common Lisp.

These SubL functions for setting and unsetting symbol properties behave like their Common Lisp counterparts. 
 
[[|]]function <code>SET : (symbol value)</code> 
 
[[|]]function <code>MAKUNBOUND : (symbol)</code> 
 
[[|]]function <code>FMAKUNBOUND : (symbol)</code> [[|]]

== 7.2 : Generalized Variables ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node80.html CLtL2 Reference] 
 
[[|]]macro <code>CSETF : (place val)</code>

[[#FN-DEF-CSETF|<code>CSETF</code>]] is a more restricted version of <code>setf</code> in Common Lisp. First, since it is procedural, like [[#FN-DEF-CSETQ|<code>CSETQ</code>]] it does not return a value. Second, there is a much more restricted set of place-specifiers which are allowable. Here is a complete table of the allowable [[#FN-DEF-CSETF|<code>CSETF</code>]] forms, and their equivalent SubL expansions:

'''CSETF form'''

'''Equivalent SubL expansion'''

-----

<code>(CSETF</code> variable value''')'''

<code>(CSETQ</code> variable value''')'''

<code>(CSETF</code> ([[#FN-DEF-AREF|<code>AREF</code>]] vector n''')''' value''')'''

<code>(SET-AREF</code> vector n value''')'''

<code>(CSETF</code> ([[#FN-DEF-NTH|<code>NTH</code>]] n list''')''' value''')'''

<code>(SET-NTH</code> n list value''')'''

<code>(CSETF</code> ([[#FN-DEF-CAR|<code>CAR</code>]] cons''')''' value''')'''

<code>(RPLACA</code> cons value''')'''

<code>(CSETF</code> ([[#FN-DEF-CDR|<code>CDR</code>]] cons''')''' value''')'''

<code>(RPLACD</code> cons value''')'''

<code>(CSETF</code> ([[#FN-DEF-GET|<code>GET</code>]] symbol indicator''')''' value''')'''

<code>(PUT</code> symbol indicator value''')'''

<code>(CSETF</code> ([[#FN-DEF-GETHASH|<code>GETHASH</code>]] key hashtable''')''' value''')'''

<code>(SETHASH</code> key hashtable value''')'''

<code>(CSETF</code> ([[#FN-DEF-SYMBOL-VALUE|<code>SYMBOL-VALUE</code>]] symbol''')''' value''')'''

<code>(SET</code> symbol value''')'''

<code>(CSETF</code> (defstruct-slot object''')''' value''')'''

<code>(set-defstruct-slot object value)</code>

In the above table, '''defstruct-slot''' refers to any structure slot accessor function which got defined via defstruct, and '''set-defstruct-slot''' refers to the corresponding setter function for the given accessor. [[|]]

== 7.3 : Function Invocation ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node81.html CLtL2 Reference]

These functions behave like their Common Lisp counterparts. 
 
[[|]]function <code>APPLY : (function argument &rest arguments)</code> 
 
[[|]]function <code>FUNCALL : (function &rest args)</code>

The first argument to both [[#FN-DEF-APPLY|<code>APPLY</code>]] and [[#FN-DEF-FUNCALL|<code>FUNCALL</code>]] must satisfy [[#FN-DEF-FUNCTION-SPEC-P|<code>FUNCTION-SPEC-P</code>]]. [[|]]

== 7.4 : Simple Sequencing ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node82.html CLtL2 Reference] 
 
[[|]]macro <code>PROGN : (&body body)</code>

In SubL, [[#FN-DEF-PROGN|<code>PROGN</code>]] is procedural and therefore does not return a value. Since it is intended to be essentially procedural in Common Lisp as well, the same name is used even though they have slightly different semantics. [[|]]

== 7.5 : Establishing New Variable Bindings ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node83.html CLtL2 Reference] 
 
[[|]]macro <code>CLET : (bindings &body body)</code>

The SubL construct [[#FN-DEF-CLET|<code>CLET</code>]] can be used to introduce new local variables or bind special variables. The variables are initialized in order just like <code>LET*</code> in Common Lisp. Since it is procedural, it does not return a value.

SubL has no counterpart to Common Lisp's <code>LET</code> construct. 
 
[[|]]macro <code>CPROGV : (special-vars bindings &body body)</code>

[[#FN-DEF-CPROGV|<code>CPROGV</code>]] is procedural and therefore does not return a value. Otherwise, it is equivalent to <code>progv</code> in Common Lisp. [[|]]

== 7.6 : Conditionals ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node84.html CLtL2 Reference] 
 
[[|]]macro <code>PIF : (condition action else-action)</code> 
 
[[|]]macro <code>PWHEN : (condition &body body)</code> 
 
[[|]]macro <code>PUNLESS : (condition &body body)</code>

[[#FN-DEF-PIF|<code>PIF</code>]], [[#FN-DEF-PWHEN|<code>PWHEN</code>]] and [[#FN-DEF-PUNLESS|<code>PUNLESS</code>]] are the SubL procedural variants of <code>if</code>, <code>when</code> and <code>unless</code> from Common Lisp. For each, the condition argument must be a functional construct. Also, [[#FN-DEF-PIF|<code>PIF</code>]] takes exactly three arguments, making the action and else-actions identical in form. 
 
[[|]]macro <code>FIF : (condition true-value false-value)</code> 
 
[[|]]macro <code>FWHEN : (condition true-value)</code> 
 
[[|]]macro <code>FUNLESS : (condition false-value)</code>

[[#FN-DEF-FIF|<code>FIF</code>]], [[#FN-DEF-FWHEN|<code>FWHEN</code>]] and [[#FN-DEF-FUNLESS|<code>FUNLESS</code>]] are the SubL functional variants of <code>if</code>, <code>when</code> and <code>unless</code> from Common Lisp. 
 
[[|]]macro <code>PCOND : (&rest clauses)</code> 
 
[[|]]macro <code>PCASE : (test-object &body clauses)</code>

[[#FN-DEF-PCOND|<code>PCOND</code>]] and [[#FN-DEF-PCASE|<code>PCASE</code>]] are the SubL procedural equivalents of <code>cond</code> and <code>case</code> from Common Lisp. [[|]]

== 7.7 : Blocks and Exits ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node85.html CLtL2 Reference] 
 
[[|]]macro <code>RET : (expression)</code> 
SubL functions must always return a value, since C functions must return values and all SubL functions must translate into C.

[[#FN-DEF-RET|<code>RET</code>]] is used to return a value from a function or macro definition. All functions and macro definitions behave as if an implicit

<blockquote><pre>(ret nil)</pre></blockquote>
appears at the very end of each function. [[|]]

== 7.8.2 : General Iteration ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node88.html CLtL2 Reference] 
 
[[|]]macro <code>CDO : (vars endtest &body body)</code> 
cdo is procedural. It binds its variables in sequence, as with CommonLisp do* [[|]]

== 7.8.3 : Simple Iteration Constructs ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node89.html CLtL2 Reference] 
 
[[|]]macro <code>CDOLIST : ((var listform) &body body)</code> 
 
[[|]]macro <code>CSOME : ((var list endvar) &body body)</code> 
 
[[|]]macro <code>CDOTIMES : ((var integer) &body body)</code> 
 
[[|]]macro <code>CDOHASH : ((key val table) &body body)</code> [[|]]

== 7.8.4 : Mapping ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node90.html CLtL2 Reference] 
 
[[|]]function <code>MAPCAR : (function list &rest more-lists)</code> 
 
[[|]]function <code>MAPLIST : (function list &rest more-lists)</code> 
 
[[|]]function <code>MAPC : (function list &rest more-lists)</code> 
 
[[|]]function <code>MAPL : (function list &rest more-lists)</code> 
 
[[|]]function <code>MAPCAN : (function list &rest more-lists)</code> 
 
[[|]]function <code>MAPCON : (function list &rest more-lists)</code> [[|]]

== 7.10.1 : Constructs for Handling Multiple Values ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node94.html CLtL2 Reference] 
 
[[|]]function <code>VALUES : (value &rest more-values)</code> 
values returns its args such that they can be bound in a dynamically enclosing multiple-value-bind. The first value is returned as well, since all SubL functions must return a value. 
 
[[|]]variable <code>*MULTIPLE-VALUES-LIMIT*</code> 
 
[[|]]macro <code>MULTIPLE-VALUE-LIST : (form)</code> 
 
[[|]]macro <code>CMULTIPLE-VALUE-BIND : (vars value &body body)</code> [[|]]

== 7.10.2 : Rules Governing the Passing of Multiple Values ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node95.html CLtL2 Reference]

In SubL, multiple values are governed the same way that they are in Common Lisp, except that if ANY of the return statements in your function are (values ...) then all of them must be. [[|]]

== 7.11 : Dynamic Non-Local Exits ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node96.html CLtL2 Reference] 
 
[[|]]macro <code>CCATCH : (tag ans-var &body body)</code> 
ccatch is procedural, and so does not return values. 
 
[[|]]macro <code>CUNWIND-PROTECT : (protected-form &body body)</code> 
 
[[|]]function <code>THROW : (tag result)</code> [[|]]

-----

= 8 : Macros =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node97.html CLtL2 Reference] [[|]]

== 8.1 : Macro Definition ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node98.html CLtL2 Reference] 
 
[[|]]macro <code>DEFMACRO : (name pattern &body body)</code>

SubL Macros are expanded at translation-time. Full Common Lisp macro support is available. However, the macro-expander must use [[#FN-DEF-RET|<code>RET</code>]] to return the expansion. [[|]]

== 8.3 : Destructuring ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node100.html CLtL2 Reference] 
 
[[|]]macro <code>CDESTRUCTURING-BIND : (pattern datum &body body)</code> [[|]]

== 8.5 : Environments ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node102.html CLtL2 Reference] 
 
[[|]]function <code>VARIABLE-INFORMATION : (variable)</code> 
 
[[|]]function <code>FUNCTION-INFORMATION : (function)</code> [[|]]

-----

= 9 : Declarations =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node103.html CLtL2 Reference] [[|]]

== 9.1 : Declaration Syntax ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node104.html CLtL2 Reference] 
 
[[|]]function <code>DECLARE : (&rest ignore)</code> 
 
[[|]]function <code>PROCLAIM : (declaration-specifier)</code> 
 
[[|]]macro <code>DECLAIM : (&rest declaration-specifiers)</code> [[|]]

== 9.2 : Declaration Specifiers ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node105.html CLtL2 Reference] 
 
[[|]]function <code>IGNORE : (&rest values)</code>

The [[#FN-DEF-IGNORE|<code>IGNORE</code>]] function can be used to indicate that a particular variable's value is not used. [[|]]

-----

= 10 : Symbols =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node107.html CLtL2 Reference] 
 
[[|]]function <code>SYMBOLP : (x)</code> [[|]]

== 10.1 : The Property List ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node108.html CLtL2 Reference] 
 
[[|]]function <code>GET : (symbol indicator &optional default)</code> 
 
[[|]]function <code>PUT : (symbol indicator new-value)</code> 
 
[[|]]function <code>REMPROP : (symbol indicator)</code> 
 
[[|]]function <code>SYMBOL-PLIST : (symbol)</code> [[|]]

== 10.2 : The Print Name ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node109.html CLtL2 Reference] 
 
[[|]]function <code>SYMBOL-NAME : (symbol)</code> 
Returns the string which is the name of SYMBOL. When called on a keyword, it returns the ":" prefix as part of the name [[|]]

== 10.3 : Creating Symbols ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node110.html CLtL2 Reference] 
 
[[|]]function <code>MAKE-SYMBOL : (print-name)</code> 
 
[[|]]function <code>GENSYM : (&optional x)</code> 
GENSYM returns new, interned symbols, which are combinations of a string prefix and a numeric suffix. It guarantees that the new symbol was not previously interned. 
If the argument X is a number, the gensym counter (used to generate the suffix) is set to X before the new symbol is generated. 
if the argument X is a string, the gensym prefix is set to X before the new symbol is generated. 
The initial gensym counter value is 1 and the initial gensym prefix is 'G'. 
 
[[|]]function <code>GENTEMP : (&optional (prefix "T"))</code> 
 
[[|]]function <code>KEYWORDP : (x)</code> 
In SubL, which does not have packages, keywords are any symbol whose name begins with ":" [[|]]

-----

= 11 : Packages =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node111.html CLtL2 Reference] 
 
[[|]]macro <code>IN-PACKAGE : (name)</code> 
 
[[|]]function <code>INTERN : (string)</code> 
Finds and returns a symbol whose name is STRING. INTERN will create the symbol if it does not exist. Unlike Common LISP intern, the SubL version does not allow an argument to specify the package, since SubL does not support packages. 
 
[[|]]function <code>FIND-SYMBOL : (string)</code> 
Finds and returns a symbol whose name is STRING. Unlike Common LISP FIND-SYMBOL, the SubL version does not allow an argument to specify the package, since SubL does not support packages. [[|]]

-----

= 12 : Numbers =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node121.html CLtL2 Reference]

SubL only supports fixnums and floats. Fixnums have at least 28 bits of precision. 
 
[[|]]function <code>NUMBERP : (x)</code> 
 
[[|]]function <code>FIXNUMP : (x)</code> 
 
[[|]]function <code>INTEGERP : (x)</code> 
 
[[|]]function <code>FLOATP : (x)</code> [[|]]

== 12.2 : Predicates on Numbers ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node123.html CLtL2 Reference] 
 
[[|]]function <code>ZEROP : (x)</code> 
 
[[|]]function <code>PLUSP : (x)</code> 
 
[[|]]function <code>MINUSP : (x)</code> 
 
[[|]]function <code>ODDP : (x)</code> 
 
[[|]]function <code>EVENP : (x)</code> [[|]]

== 12.3 : Comparisons on Numbers ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node124.html CLtL2 Reference] 
 
[[|]]function <code>= : (num1 num2)</code> 
 
[[|]]function <code>/= : (num1 num2)</code> 
 
[[|]]function <code>< : (num1 num2)</code> 
 
[[|]]function <code>> : (num1 num2)</code> 
 
[[|]]function <code><= : (num1 num2)</code> 
 
[[|]]function <code>>= : (num1 num2)</code>

The above numeric comparison functions take exactly 2 arguments, unlike their Common Lisp counterparts which take variable numbers of arguments. 
 
[[|]]function <code>MAX : (num &rest numbers)</code> 
 
[[|]]function <code>MIN : (num &rest numbers)</code> [[|]]

== 12.4 : Arithmetic Operations ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node125.html CLtL2 Reference] 
 
[[|]]function <code>+ : (&rest numbers)</code> 
 
[[|]]function <code>- : (num &rest numbers)</code> 
 
[[|]]function <code>* : (&rest numbers)</code> 
 
[[|]]function <code>/ : (num &rest numbers)</code> 
 
[[|]]function <code>INT/ : (num1 num2)</code> 
 
[[|]]macro <code>CINC : (place &optional (delta 1))</code> 
 
[[|]]macro <code>CDEC : (place &optional (delta 1))</code> [[|]]

== 12.5 : Irrational and Transcendental Functions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node126.html CLtL2 Reference]

SubL does not currently support any irrational, transcendental or trigonometric functions. [[|]]

== 12.6 : Type Conversions and Component Extractions on Numbers ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node130.html CLtL2 Reference] 
 
[[|]]function <code>FLOAT : (x)</code> 
 
[[|]]function <code>FLOOR : (x)</code> 
 
[[|]]function <code>CEILING : (x)</code> 
 
[[|]]function <code>TRUNCATE : (x)</code> 
 
[[|]]function <code>ROUND : (x)</code> 
 
[[|]]function <code>MOD : (number divisor)</code> 
 
[[|]]function <code>REM : (number divisor)</code> 
 
[[|]]function <code>SCALE-FLOAT : (float integer)</code> 
 
[[|]]function <code>INTEGER-DECODE-FLOAT : (float)</code> [[|]]

== 12.7 : Logical Operations on Numbers ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node131.html CLtL2 Reference]

SubL does not currently support any logical operations on numbers. [[|]]

== 12.8 : Byte Manipulation Functions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node132.html CLtL2 Reference] 
 
[[|]]macro <code>BYTE : (size position)</code> 
 
[[|]]function <code>LDB : (bytespec integer)</code> 
 
[[|]]function <code>DPB : (newbyte bytespec integer)</code> [[|]]

== 12.9 : Random Numbers ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node133.html CLtL2 Reference] 
 
[[|]]variable <code>*RAND-MAX*</code> 
*rand-max* is the largest fixnum that the function random can accept. 
 
[[|]]function <code>SEED-RANDOM : (&optional (seed-fixnum (mod (get-internal-real-time) *rand-max*)))</code> 
If seed-fixnum is omitted to seed-random, the internal clock is used 
in an implementation specific manner. 
 
[[|]]function <code>RANDOM : (number)</code> [[|]]

== 12.10 : Implementation Parameters ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node134.html CLtL2 Reference] 
 
[[|]]variable <code>*MOST-POSITIVE-FIXNUM*</code> 
 
[[|]]variable <code>*MOST-NEGATIVE-FIXNUM*</code> [[|]]

-----

= 13 : Characters =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node135.html CLtL2 Reference] 
 
[[|]]function <code>CHARACTERP : (x)</code> [[|]]

== 13.1 : Character Attributes ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node136.html CLtL2 Reference]

SubL does not currently support any attributes for characters. A character exists for each ASCII character code between 0 and 255 inclusive. Thus, the SubL equivalent of Common Lisp's <code>CHAR-CODE-LIMIT</code> is 256. [[|]]

== 13.2 : Predicates on Characters ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node137.html CLtL2 Reference] 
 
[[|]]function <code>ALPHA-CHAR-P : (char)</code> 
 
[[|]]function <code>UPPER-CASE-P : (char)</code> 
 
[[|]]function <code>LOWER-CASE-P : (char)</code> 
 
[[|]]function <code>BOTH-CASE-P : (char)</code> 
 
[[|]]function <code>DIGIT-CHAR-P : (char)</code> 
 
[[|]]function <code>ALPHANUMERICP : (char)</code> 
 
[[|]]function <code>CHAR= : (char1 char2)</code> 
 
[[|]]function <code>CHAR/= : (char1 char2)</code> 
 
[[|]]function <code>CHAR< : (char1 char2)</code> 
 
[[|]]function <code>CHAR> : (char1 char2)</code> 
 
[[|]]function <code>CHAR<= : (char1 char2)</code> 
 
[[|]]function <code>CHAR>= : (char1 char2)</code> 
 
[[|]]function <code>CHAR-EQUAL : (char1 char2)</code> 
 
[[|]]function <code>CHAR-NOT-EQUAL : (char1 char2)</code> 
 
[[|]]function <code>CHAR-LESSP : (char1 char2)</code> 
 
[[|]]function <code>CHAR-GREATERP : (char1 char2)</code> 
 
[[|]]function <code>CHAR-NOT-GREATERP : (char1 char2)</code> 
 
[[|]]function <code>CHAR-NOT-LESSP : (char1 char2)</code> [[|]]

== 13.3 : Character Construction and Selection ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node138.html CLtL2 Reference] 
 
[[|]]function <code>CHAR-CODE : (char)</code> 
 
[[|]]function <code>CODE-CHAR : (code)</code> [[|]]

== 13.4 : Character Conversions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node139.html CLtL2 Reference] 
 
[[|]]function <code>CHAR-DOWNCASE : (char)</code> 
 
[[|]]function <code>CHAR-UPCASE : (char)</code> [[|]]

-----

= 14 : Sequences =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node141.html CLtL2 Reference] 
 
[[|]]function <code>SEQUENCEP : (x)</code> [[|]]

== 14.1 : Simple Sequence Functions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node142.html CLtL2 Reference] 
 
[[|]]function <code>ELT : (sequence index)</code> 
 
[[|]]function <code>SUBSEQ : (sequence start &optional end)</code> 
 
[[|]]function <code>COPY-SEQ : (sequence)</code> 
 
[[|]]function <code>LENGTH : (sequence)</code> 
 
[[|]]function <code>REVERSE : (sequence)</code> 
 
[[|]]function <code>NREVERSE : (sequence)</code> [[|]]

== 14.2 : Concatenating, Mapping and Reducing Sequences ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node143.html CLtL2 Reference] 
 
[[|]]function <code>CCONCATENATE : (seq &rest more-seqs)</code> 
 
[[|]]function <code>CREDUCE : (function sequence &optional (start 0) end (init-value :none))</code> [[|]]

== 14.3 : Modifying Sequences ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node144.html CLtL2 Reference] 
 
[[|]]function <code>FILL : (sequence item &optional (start 0) (end (length sequence)))</code> 
 
[[|]]function <code>REPLACE : (sequence1 sequence2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>REMOVE : (item sequence &optional (test #'eql) (key #'identity) (start 0) end count)</code> 
 
[[|]]function <code>REMOVE-IF : (test sequence &optional (key #'identity) (start 0) end count)</code> 
 
[[|]]function <code>DELETE : (item sequence &optional (test #'eql) (key #'identity) (start 0) end count)</code> 
 
[[|]]function <code>DELETE-IF : (test sequence &optional (key #'identity) (start 0) end count)</code> 
 
[[|]]function <code>REMOVE-DUPLICATES : (sequence &optional (test #'eql) (key #'identity) (start 0) end)</code> 
 
[[|]]function <code>DELETE-DUPLICATES : (sequence &optional (test #'eql) (key #'identity) (start 0) end)</code> 
 
[[|]]function <code>SUBSTITUTE : (new old sequence &optional (test #'eql) (key #'identity) (start 0) end count)</code> 
 
[[|]]function <code>SUBSTITUTE-IF : (new test sequence &optional (key #'identity) (start 0) end count)</code> 
 
[[|]]function <code>NSUBSTITUTE : (new old sequence &optional (test #'eql) (key #'identity) (start 0) end count)</code> 
 
[[|]]function <code>NSUBSTITUTE-IF : (new test sequence &optional (key #'identity) (start 0) end count)</code> [[|]]

== 14.4 : Searching Sequences for Terms ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node145.html CLtL2 Reference] 
 
[[|]]function <code>FIND : (item seq &optional (test #'eql) (key #'identity) (start 0) end)</code> 
 
[[|]]function <code>FIND-IF : (test seq &optional (key #'identity) (start 0) end)</code> 
 
[[|]]function <code>POSITION : (item seq &optional (test #'eql) (key #'identity) (start 0) end)</code> 
 
[[|]]function <code>POSITION-IF : (test seq &optional (key #'identity) (start 0) end)</code> 
 
[[|]]function <code>COUNT : (item seq &optional (test #'eql) (key #'identity) (start 0) end)</code> 
 
[[|]]function <code>COUNT-IF : (test seq &optional (key #'identity) (start 0) end)</code> 
 
[[|]]function <code>MISMATCH : (seq1 seq2 &optional (test #'eql) (key #'identity) (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>SEARCH : (seq1 seq2 &optional (test #'eql) (key #'identity) (start1 0) end1 (start2 0) end2)</code> [[|]]

== 14.5 : Sorting and Merging ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node146.html CLtL2 Reference] 
 
[[|]]function <code>SORT : (seq predicate &optional (key #'identity))</code> 
 
[[|]]function <code>STABLE-SORT : (seq predicate &optional (key #'identity))</code> 
 
[[|]]function <code>CMERGE : (seq1 seq2 predicate &optional (key #'identity))</code> [[|]]

-----

= 15 : Lists =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node147.html CLtL2 Reference] 
 
[[|]]function <code>LISTP : (x)</code> 
 
[[|]]function <code>CONSP : (x)</code> 
 
[[|]]function <code>ATOM : (x)</code> [[|]]

== 15.1 : Conses ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node148.html CLtL2 Reference] 
 
[[|]]function <code>CAR : (cons)</code> 
 
[[|]]function <code>CDR : (cons)</code> 
 
[[|]]function <code>CAAR : (cons)</code> 
 
[[|]]function <code>CADR : (cons)</code> 
 
[[|]]function <code>CDAR : (cons)</code> 
 
[[|]]function <code>CDDR : (cons)</code> 
 
[[|]]function <code>CONS : (car cdr)</code> 
 
[[|]]function <code>TREE-EQUAL : (tree1 tree2 &optional (test #'eql))</code> [[|]]

== 15.2 : Lists ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node149.html CLtL2 Reference] 
 
[[|]]function <code>ENDP : (object)</code> 
 
[[|]]function <code>LIST-LENGTH : (list)</code> 
 
[[|]]function <code>NTH : (n list)</code> 
 
[[|]]function <code>FIRST : (list)</code> 
 
[[|]]function <code>SECOND : (list)</code> 
 
[[|]]function <code>THIRD : (list)</code> 
 
[[|]]function <code>FOURTH : (list)</code> 
 
[[|]]function <code>FIFTH : (list)</code> 
 
[[|]]function <code>SIXTH : (list)</code> 
 
[[|]]function <code>SEVENTH : (list)</code> 
 
[[|]]function <code>EIGHTH : (list)</code> 
 
[[|]]function <code>NINTH : (list)</code> 
 
[[|]]function <code>TENTH : (list)</code> 
 
[[|]]function <code>REST : (list)</code> 
 
[[|]]function <code>NTHCDR : (n list)</code> 
 
[[|]]function <code>LAST : (list &optional (n 1))</code> 
 
[[|]]function <code>LIST : (&rest objects)</code> 
 
[[|]]function <code>LIST* : (arg &rest objects)</code> 
 
[[|]]function <code>MAKE-LIST : (size &optional initial-element)</code> 
 
[[|]]function <code>APPEND : (&rest lists)</code> 
 
[[|]]function <code>COPY-LIST : (list)</code> 
 
[[|]]function <code>COPY-ALIST : (list)</code> 
 
[[|]]function <code>COPY-TREE : (tree)</code> 
 
[[|]]function <code>REVAPPEND : (list1 list2)</code> 
 
[[|]]function <code>NCONC : (&rest lists)</code> 
 
[[|]]function <code>NRECONC : (list1 list2)</code> 
 
[[|]]macro <code>CPUSH : (item place)</code> 
 
[[|]]macro <code>CPUSHNEW : (item place &optional (test '#'eql) (key '#'identity))</code> 
 
[[|]]macro <code>CPOP : (place)</code> 
 
[[|]]function <code>BUTLAST : (list &optional (n 1))</code> 
 
[[|]]function <code>NBUTLAST : (list &optional (n 1))</code> 
 
[[|]]function <code>LDIFF : (list sublist)</code> [[|]]

== 15.3 : Alteration of List Structure ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node150.html CLtL2 Reference] 
 
[[|]]function <code>RPLACA : (cons newcar)</code> 
 
[[|]]function <code>RPLACD : (cons newcdr)</code> 
 
[[|]]function <code>SET-NTH : (n list value)</code> [[|]]

== 15.4 : Substitution of Expressions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node151.html CLtL2 Reference] 
 
[[|]]function <code>SUBST : (new old tree &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>SUBST-IF : (new test tree &optional (key #'identity))</code> 
 
[[|]]function <code>NSUBST : (new old tree &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>NSUBST-IF : (new test tree &optional (key #'identity))</code> 
 
[[|]]function <code>SUBLIS : (alist tree &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>NSUBLIS : (alist tree &optional (test #'eql) (key #'identity))</code> [[|]]

== 15.5 : Using Lists as Sets ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node152.html CLtL2 Reference] 
 
[[|]]function <code>MEMBER : (item list &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>MEMBER-IF : (test list &optional (key #'identity))</code> 
 
[[|]]function <code>TAILP : (sublist list)</code> 
 
[[|]]function <code>ADJOIN : (item list &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>UNION : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>NUNION : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>INTERSECTION : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>NINTERSECTION : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>SET-DIFFERENCE : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>NSET-DIFFERENCE : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>SET-EXCLUSIVE-OR : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>NSET-EXCLUSIVE-OR : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>SUBSETP : (list1 list2 &optional (test #'eql) (key #'identity))</code> [[|]]

== 15.6 : Association Lists ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node153.html CLtL2 Reference] 
 
[[|]]function <code>ACONS : (key datum alist)</code> 
 
[[|]]function <code>PAIRLIS : (keys data &optional alist)</code> 
 
[[|]]function <code>ASSOC : (item alist &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>ASSOC-IF : (predicate alist)</code> 
 
[[|]]function <code>RASSOC : (item alist &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>RASSOC-IF : (predicate alist)</code> [[|]]

-----

= 16 : Hash Tables =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node154.html CLtL2 Reference]

[[|]]

== 16.1 : Hash Table Functions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node155.html CLtL2 Reference] 
 
[[|]]function <code>MAKE-HASH-TABLE : (size &optional (test #'eql) (area default-cons-area))</code> 
 
[[|]]function <code>HASH-TABLE-P : (x)</code> 
 
[[|]]function <code>GETHASH : (key table &optional default)</code> 
 
[[|]]function <code>SETHASH : (key table value)</code> 
 
[[|]]function <code>REMHASH : (key table)</code> 
 
[[|]]function <code>MAPHASH : (function table)</code> 
 
[[|]]function <code>CLRHASH : (table)</code> 
 
[[|]]function <code>HASH-TABLE-COUNT : (table)</code> [[|]]

== 16.2 : Primitive Hash Function ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node156.html CLtL2 Reference] 
 
[[|]]function <code>SXHASH : (object)</code> [[|]]

-----

= 17 : Arrays =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node157.html CLtL2 Reference]

SubL only supports one-dimensional arrays, which are called vectors. 
 
[[|]]function <code>VECTORP : (x)</code> [[|]]

== 17.1 : Vector Creation ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node158.html CLtL2 Reference] 
 
[[|]]function <code>MAKE-VECTOR : (size &optional initial-element)</code> 
 
[[|]]function <code>VECTOR : (&rest objects)</code> [[|]]

== 17.2 : Vector Access ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node159.html CLtL2 Reference] 
 
[[|]]function <code>AREF : (vector index)</code> 
 
[[|]]function <code>SET-AREF : (vector index value)</code> [[|]]

-----

= 18 : Strings =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node164.html CLtL2 Reference] 
 
[[|]]function <code>STRINGP : (x)</code> [[|]]

== 18.1 : String Access ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node165.html CLtL2 Reference] 
 
[[|]]function <code>CHAR : (string index)</code> 
 
[[|]]function <code>SET-CHAR : (string index value)</code> [[|]]

== 18.2 : String Comparison ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node166.html CLtL2 Reference] 
 
[[|]]function <code>STRING= : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING-EQUAL : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING< : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING> : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING<= : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING>= : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING/= : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING-LESSP : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING-GREATERP : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING-NOT-GREATERP : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING-NOT-LESSP : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING-NOT-EQUAL : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> [[|]]

== 18.3 : String Construction and Manipulation ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node167.html CLtL2 Reference] 
 
[[|]]function <code>MAKE-STRING : (size &optional (initial-element #\Space))</code> 
 
[[|]]function <code>STRING-TRIM : (char-list string)</code> 
 
[[|]]function <code>STRING-LEFT-TRIM : (char-list string)</code> 
 
[[|]]function <code>STRING-RIGHT-TRIM : (char-list string)</code> 
 
[[|]]function <code>STRING-UPCASE : (string &optional (start 0) end)</code> 
 
[[|]]function <code>STRING-DOWNCASE : (string &optional (start 0) end)</code> 
 
[[|]]function <code>STRING-CAPITALIZE : (string &optional (start 0) end)</code> 
 
[[|]]function <code>NSTRING-UPCASE : (string &optional (start 0) end)</code> 
 
[[|]]function <code>NSTRING-DOWNCASE : (string &optional (start 0) end)</code> 
 
[[|]]function <code>NSTRING-CAPITALIZE : (string &optional (start 0) end)</code> 
 
[[|]]function <code>STRING : (x)</code> [[|]]

-----

= 19 : Structures =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node168.html CLtL2 Reference] 
 
[[|]]macro <code>DEFSTRUCT : ((name &rest options) &body slots)</code> 
Like Common Lisp defstruct except: 
(1) slot initializations are not allowed.

(2) the only other options: 
(:conc-name whatever) 
(:print-function #'whatever)

the default structure print function is 
default-struct-print-function : object stream depth

(3) The make constructor takes no arguments and only makes an empty structure.

(4) Reading of structures is not supported by the reader. 
 
[[|]]function <code>DEFAULT-STRUCT-PRINT-FUNCTION : (object stream depth)</code> 
 
[[|]]macro <code>PRINTING-OBJECT : ((object stream) &body body)</code> [[|]]

-----

= 20 : The Evaluator =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node179.html CLtL2 Reference]

[[|]]

== 20.1 : Run-Time Evaluation of Forms ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node180.html CLtL2 Reference] 
 
[[|]]function <code>EVAL : (form)</code> 
 
[[|]]function <code>CONSTANTP : (object &optional env)</code>

The Common Lisp functions <code>evalhook</code> and <code>applyhook</code> are not supported in SubL. [[|]]

== 20.2 : The Top-Level Loop ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node181.html CLtL2 Reference] 
 
[[|]]variable <code>*</code> 
 
[[|]]variable <code>**</code> 
 
[[|]]variable <code>***</code>

For convenience, the top-level readloop binds the following variables after each form is evaluated:

<blockquote><pre>* the last value returned
** the previous value of *
*** the previous value of **</pre></blockquote>
[[|]]

-----

= 21 : Streams =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node182.html CLtL2 Reference] 
 
[[|]]function <code>STREAMP : (x)</code> [[|]]

== 21.1 : Standard Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node183.html CLtL2 Reference] 
 
[[|]]variable <code>*STANDARD-INPUT*</code> 
 
[[|]]variable <code>*STANDARD-OUTPUT*</code> 
 
[[|]]variable <code>*ERROR-OUTPUT*</code> 
 
[[|]]variable <code>*NULL-OUTPUT*</code> 
A bit-sink output stream. All output is ignored

The other standard streams supported by Common Lisp are not supported by SubL. [[|]]

== 21.2 : Creating new Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node184.html CLtL2 Reference] 
 
[[|]]function <code>OPEN-TCP-STREAM : (host port)</code> [[|]]

== 21.3 : Operations on Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node185.html CLtL2 Reference] 
 
[[|]]function <code>STREAMP : (x)</code> 
 
[[|]]function <code>INPUT-STREAM-P : (object)</code> 
 
[[|]]function <code>OUTPUT-STREAM-P : (object)</code> 
 
[[|]]function <code>CLOSE : (stream)</code> [[|]]

-----

= 22 : Input/Output =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node186.html CLtL2 Reference] [[|]]

== 22.1 : Printed Representation of SubL Objects ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node187.html CLtL2 Reference] [[|]]

== 22.1.3 : Macro Characters ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node190.html CLtL2 Reference]

The SubL reader supports the following macro characters, whose meaning is identical to their meaning in Common Lisp :

<blockquote>'''Macro Character''' Â Â Â '''Reader Action'''

-----

<code>(</code> Begin reading a list. <code>)</code> End reading a list or a vector. <code>'</code> Read in a quoted expression. <code>;</code> Read a comment until end-of-line. <code>"</code> Begin or end reading a string. <code>`</code> Read in a backquoted expression.
</blockquote>
In addition, the following comma-readers are supported inside of backquote :

<blockquote><pre>,
,@
,.</pre></blockquote>
Their behavior is identical to their Common Lisp counterparts. [[|]]

== 22.1.4 : Standard Dispatching Macro Character Syntax ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node191.html CLtL2 Reference]

'''<code>'#'</code>''' is the SubL standard dispatching macro character. The SubL reader supports the following dispatch macro character sequences, whose meanings are identical to their meanings in Common Lisp :

<blockquote>'''Dispatch Sequence''' Â Â Â '''Reader Action'''

-----

<code>#\(</code> Read a character constant. <code>#'</code> Read a function constant. <code>#(</code> Begin reading a vector. <code>#|</code> Begin reading a comment section. <code>|#</code> End reading a comment section.
</blockquote>
Additionally, SubL supports the dispatch sequence '''<code>#$</code>''' as follows :

<blockquote><code>#$foo</code> reads the Cyc constant whose name is <code>"foo"</code>
</blockquote>
[[|]]

== 22.1.5 : The Readtable ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node192.html CLtL2 Reference]

SubL internally uses a readtable, but it is not visible to the programmer. [[|]]

== 22.1.6 : What the Print Function Produces ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node193.html CLtL2 Reference] 
 
[[|]]variable <code>*PRINT-ESCAPE*</code> [[|]]

== 22.2.1 : Input from Character Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node195.html CLtL2 Reference] 
 
[[|]]function <code>READ : (&optional (stream *standard-input*) (eof-error-p t) (eof-value :eof))</code> 
Returns FORM if read was successful. 
Returns the values NIL :ERROR if there was a reader error. 
Returns the values EOF-VALUE :ERROR if EOF-ERROR-P is nil and EOF occurs. 
Causes an error if EOF-ERROR-P is not nil and EOF occurs.

Differences from Common Lisp: 
<code>`Numbers are only read in decimal notation with no specified radix.\</code> <code>No character modifiers: only standard chars plus specials like Space, Return etc.\</code> <code>The || notation and \\ syntax for symbols are not supported.\ \ []()function</code>READ-LINE : (&optional (stream ''standard-input'') (eof-error-p t) (eof-value :eof))<code>\ \ []()function</code>READ-CHAR : (&optional (stream ''standard-input'') (eof-error-p t) (eof-value :eof))<code>\ \ []()function</code>UNREAD-CHAR : (char &optional (stream ''standard-input''))<code>\ \ []()function</code>READ-FROM-STRING : (string &optional (eof-error-p t) (eof-value :eof) (start 0) end)` 
Returns the values FORM NEW-START if read was successful. 
Returns the values NIL :ERROR if there was a reader error. 
Returns the values EOF-VALUE :ERROR if EOF-ERROR-P is nil and EOF occurs. 
Causes an error if EOF-ERROR-P is not nil and EOF occurs. 
Returns a second value which is an integer indicating the position in the string to 
start reading from again or :ERROR if there was some kind of reader error. [[|]]

== 22.2.2 : Input from Binary Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node196.html CLtL2 Reference] 
 
[[|]]function <code>READ-BYTE : (stream &optional (eof-error-p t) (eof-value :eof))</code> [[|]]

== 22.3.1 : Output to Character Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node198.html CLtL2 Reference] 
 
[[|]]function <code>WRITE : (object &optional (stream *standard-output*) (escape *print-escape*))</code> 
 
[[|]]function <code>PRIN1 : (object &optional (stream *standard-output*))</code> 
 
[[|]]function <code>PRINT : (object &optional (stream *standard-output*))</code> 
 
[[|]]function <code>PRINC : (object &optional (stream *standard-output*))</code> 
 
[[|]]function <code>WRITE-TO-STRING : (object &optional (escape *print-escape*))</code> 
 
[[|]]function <code>PRIN1-TO-STRING : (object)</code> 
 
[[|]]function <code>PRINC-TO-STRING : (object)</code> 
 
[[|]]function <code>WRITE-CHAR : (char &optional (stream *standard-output*))</code> 
 
[[|]]function <code>WRITE-STRING : (string &optional (stream *standard-output*) (start 0) end)</code> 
 
[[|]]function <code>WRITE-LINE : (string &optional (stream *standard-output*) (start 0) end)</code> 
 
[[|]]function <code>TERPRI : (&optional (stream *standard-output*))</code> 
 
[[|]]function <code>FORCE-OUTPUT : (&optional (stream *standard-output*))</code> [[|]]

== 22.3.2 : Output to Binary Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node199.html CLtL2 Reference] 
 
[[|]]function <code>WRITE-BYTE : (integer stream)</code> [[|]]

== 22.3.3 : Formatted Output to Character Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node200.html CLtL2 Reference] 
 
[[|]]function <code>FORMAT : (destination control-string &rest arguments)</code> 
Format ARGUMENTS to the text stream DESTINATION according to the specifications in CONTROL-STRING. SubL format is more limited than the Common Lisp version: the only escapes allowed in the control string are: ~A ~a ~S ~s ~D ~d (with width and pad parameters optional) ~C ~c ~G ~g ~% ~~ [[|]]

-----

= 23 : File System Interface =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node202.html CLtL2 Reference] [[|]]

== 23.1 : File Names ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node203.html CLtL2 Reference] 
 
[[|]]variable <code>*DEFAULT-PATHNAME-DEFAULTS*</code> 
 
[[|]]function <code>CONSTRUCT-FILENAME : (directory-list filename &optional extension relative?)</code>

Pathnames are just strings in SubL. Common Lisp pathname objects are not supported. [[|]]

== 23.2 : Opening and Closing Files ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node215.html CLtL2 Reference] 
 
[[|]]function <code>OPEN-TEXT : (filename direction)</code> 
Attempts to open the file FILENAME. If successful, returns an 8-bit character text stream. If DIRECTION is :input, then input operations can be performed on the stream. If DIRECTION is output, then output is directed to the file FILENAME, overwriting any existing file. If DIRECTION is :append, then output is appended to the file. For either output case, a new file is created if no file named FILENAME already exists. 
 
[[|]]function <code>OPEN-BINARY : (filename direction)</code> 
Attempts to open the file FILENAME. If successful, returns an 8-bit binary byte stream. If DIRECTION is :input, then input operations can be performed on the stream. If DIRECTION is output, then output is directed to the file FILENAME, overwriting any existing file. If DIRECTION is :append, then output is appended to the file. For either output case, a new file is created if no file named FILENAME already exists. 
 
[[|]]macro <code>WITH-TEXT-FILE : ((stream filestring direction) &body body)</code> 
In the scope of a WITH-TEXT-FILE expression, the file FILESTRING is opened for character i/o and a stream to this file is created and bound to the variable STREAM. If DIRECTION is :input, then input operations can be performed on STREAM. If DIRECTION is :output, then output operations can be performed, overwriting any existing file. If DIRECTION is :append, then output is appended to an existing file. 
 
[[|]]macro <code>WITH-BINARY-FILE : ((stream filestring direction) &body body)</code> 
In the scope of a WITH-BINARY-FILE expression, the file FILESTRING is opened for binary i/o and a stream to this file is created and bound to the variable STREAM. If DIRECTION is :input, then input operations can be performed on STREAM. If DIRECTION is :output, then output operations can be performed, overwriting any existing file. If DIRECTION is :append, then output is appended to an existing file. [[|]]

== 23.3 : Renaming, Deleting and Other File Operations ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node216.html CLtL2 Reference] 
 
[[|]]function <code>RENAME-FILE : (filename new-name)</code> 
 
[[|]]function <code>DELETE-FILE : (filename)</code> 
 
[[|]]function <code>PROBE-FILE : (filename)</code> 
 
[[|]]function <code>APPEND-FILES : (filename-1 filename-2 &optional (mode :text))</code> 
Append filename-1 to filename-2 
 
[[|]]function <code>FILE-WRITE-DATE : (filename)</code> 
 
[[|]]function <code>FILE-AUTHOR : (filename)</code> 
 
[[|]]function <code>GET-FILE-POSITION : (stream)</code> 
 
[[|]]function <code>SET-FILE-POSITION : (stream n)</code> 
 
[[|]]function <code>FILE-LENGTH : (stream)</code> [[|]]

== 23.4 : Loading Files ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node217.html CLtL2 Reference] 
 
[[|]]function <code>LOAD : (filename)</code> [[|]]

== 23.5 : Accessing Directories ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node218.html CLtL2 Reference] 
 
[[|]]function <code>DIRECTORY : (directory-name &optional include-directory)</code> [[|]]

-----

= 24 : Errors =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node219.html CLtL2 Reference] [[|]]

== 24.1 : General Error-Signalling Functions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node220.html CLtL2 Reference] 
 
[[|]]variable <code>*ERROR-ABORT-HANDLER*</code> 
If *error-abort-handler* is non-nil, then an ABORT option is available inside ERROR and CERROR. 
If chosen, then the handler is funcalled on no arguments. 
 
[[|]]variable <code>*ERROR-HANDLER*</code> 
If *ERROR-SIGNAL* is non-nil, then that function is called upon an error. Otherwise, the debugger is invoked. 
 
[[|]]variable <code>*ERROR-MESSAGE*</code> 
 
[[|]]function <code>ERROR : (format-string &rest arguments)</code> 
 
[[|]]variable <code>*CONTINUE-CERROR?*</code> 
 
[[|]]function <code>CERROR : (continue-string format-string &rest arguments)</code> 
 
[[|]]variable <code>*IGNORE-WARNS?*</code> 
If T, all warnings forms are ignored 
 
[[|]]function <code>WARN : (format-string &rest arguments)</code> 
 
[[|]]variable <code>*IGNORE-BREAKS?*</code> 
If non-NIL, all break forms are ignored 
 
[[|]]function <code>BREAK : (format-string &rest arguments)</code> [[|]]

== 24.2 : Specialized Error-Signalling Forms and Macros ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node221.html CLtL2 Reference] 
 
[[|]]variable <code>*IGNORE-MUSTS?*</code> 
If non-NIL, all must forms are ignored 
 
[[|]]macro <code>MUST : (form format-string &rest arguments)</code> 
 
[[|]]variable <code>*SUSPEND-TYPE-CHECKING?*</code> 
CHECK-TYPE tests are performed iff this is non-nil 
 
[[|]]macro <code>CHECK-TYPE : (object pred)</code> [[|]]

-----

= 25 : Miscellaneous Features =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node223.html CLtL2 Reference] [[|]]

== 25.1 : The Compiler ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node224.html CLtL2 Reference]

SubL currently does not provide any compilation support. [[|]]

== 25.3 : Debugging Tools ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node230.html CLtL2 Reference] 
 
[[|]]macro <code>CTIME : (var &body body)</code> 
 
[[|]]function <code>DEBUG : ()</code> 
Pauses execution and invokes the debugger. [[|]]

== 25.4.1 : Time Functions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node232.html CLtL2 Reference] 
 
[[|]]variable <code>*EPOCH*</code> 
*epoch* is the current epoch in use, which is a universal time. 
The system needs to at least be able to handle epochs back to midnight Jan 1 1970. 
*epoch* is globally initialized to midnight Jan 1 1970. 
All universal times are relative to *epoch*. 
 
[[|]]function <code>GET-UNIVERSAL-TIME : ()</code> 
 
[[|]]function <code>DECODE-UNIVERSAL-TIME : (universal-time)</code> 
 
[[|]]function <code>ENCODE-UNIVERSAL-TIME : (second minute hour date month year)</code> 
 
[[|]]function <code>TIME-FROM-NOW : (delta)</code> 
 
[[|]]function <code>TIME-HAS-ARRIVED? : (time)</code> 
 
[[|]]function <code>ENCODE-TIMESTRING : (second minute hour date month year)</code> 
 
[[|]]function <code>TIMESTRING : (&optional (universal-time (get-universal-time)))</code> 
timestring returns a string in the format dd/mm/yy hh:mm:ss from the 
universal time given. If none is given, the current time is used. 
 
[[|]]variable <code>*CLOCK-GRANULARITY*</code> 
*clock-granularity* is the number of internal clock units per second. 
time evals form and returns the number of internal clock units it took 
to execute. 
 
[[|]]function <code>GET-INTERNAL-REAL-TIME : ()</code> 
 
[[|]]function <code>SLEEP : (seconds)</code> [[|]]

== 25.5 : Identity Function ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node234.html CLtL2 Reference] 
 
[[|]]function <code>IDENTITY : (object)</code> [[|]]

-----

= 28 : Common Lisp Object System =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node260.html CLtL2 Reference] 
 
[[|]]macro <code>DEFPOLYMORPHIC : (name lambda-list &body body)</code> 
Defines a new polymorphic function that dispatches on the type of its first argument. <body> defines a default method. The function define-method can be used to define additional methods. For example:

(defpolymorphic test (a b) 
` `(list a b))

(define-method test ((a cons) b) 
` `(cons b a))

(define-method test ((a fixnum) b) 
` `(+ a b))

The defpolymorphic form defines the function TEST with a default method. 
` `The two define-method forms specialize the behavior of TEST for lists and fixnums.

(test 'foo 'bar) => (FOO BAR) 
<code>`(test '(foo) 'bar) =&gt; (BAR FOO)\</code> <code>(test 2 3) =&gt; 5\ \ []()macro</code>DEFINE-METHOD : (name lambda-list &body body)` 
Defines a method for the polymorphic function <name> that runs if 
<dispatch-arg> is of type <type>. The lambda list must have the same 
structure as in the DEFPOLYMORPHIC call. [[|]]

-----

= SubL-Specific Features =

[[|]] '''SubL.1 : Signals''' 
 
[[|]]variable <code>*SIGNAL-MAX*</code> 
There are *signal-max* total signals available. 
 
[[|]]function <code>DEFAULT-SIGNAL-HANDLER : (signal)</code> 
 
[[|]]function <code>INSTALL-SIGNAL-HANDLER : (signal function)</code> 
[[|]] '''SubL.2 : System Properties''' 
 
[[|]]function <code>GET-PROCESS-ID : (&optional default)</code> 
Return the current heavyweight process id of this current SubL 
program. Return DEFAULT if this cannot be determined. 
 
[[|]]function <code>GET-MACHINE-NAME : (&optional default)</code> 
 
[[|]]function <code>GET-NETWORK-NAME : (&optional default)</code> 
 
[[|]]function <code>GET-USER-NAME : (&optional default)</code> 
[[|]] '''SubL.3 : Progress Pacifiers''' 
 
[[|]]variable <code>*SILENT-PROGRESS?*</code> 
 
[[|]]macro <code>NOTING-ACTIVITY : (string &body body)</code> 
 
[[|]]function <code>NOTE-ACTIVITY : ()</code> 
 
[[|]]macro <code>NOTING-NUMERIC-PROGRESS : (string &body body)</code> 
 
[[|]]function <code>NOTE-NUMERIC-PROGRESS : (num)</code> 
 
[[|]]macro <code>NOTING-PERCENT-PROGRESS : (string &body body)</code> 
 
[[|]]function <code>NOTE-PERCENT-PROGRESS : (index max)</code> 
[[|]] '''SubL.4 : Process Manipulation''' 
 
[[|]]function <code>FORK-PROCESS : (function &optional callback output-file)</code> 
Spawn a heavyweight child process to call FUNCTION, which takes no arguments. 
FUNCTION must return an integer. 
CALLBACK, if provided, must be a function of one argument which is called 
on the returned value within the address space of the parent process. 
OUTPUT-FILE, if provided, is a file to which standard output and error are piped 
while executing FUNCTION. 
 
[[|]]function <code>RESTART-PROCESS : (&optional world-spec init-file-pathname init-form-spec)</code> 
Restart the current heavyweight process. 
WORLD-SPEC, if provided, is the filename of a world to use. 
INIT-FILE-PATHNAME, if provided, is a file of initializatio forms to eval. 
INIT-FORM-SPEC, if provided, is a form to execute. 
The values used for these when the current process was started are used if unprovided. 
[[|]] '''SubL.5 : Memory Interaction''' 
 
[[|]]function <code>GC : (&optional level)</code> 
 
[[|]]macro <code>WITH-STATIC-AREA : (&body body)</code> 
 
[[|]]function <code>WRITE-IMAGE : (filename &optional do-full-gc)</code> 
Save the current state of virtual memory in a file called FILENAME. 
If DO-FULL-GC is true, then a full garbage collection is 
performed before writing the image. Otherwise, a dynamic 
garbage collection is performed and remaining objects are 
promoted to being static ones.

During the initialization of a SubL system at startup, variables defined via [[#FN-DEF-DEFVAR|<code>DEFVAR</code>]] have their initial values set via their state in the world file used at startup, ignoring the initial value specified by the code. [[#FN-DEF-DEFPARAMETER|<code>DEFPARAMETER</code>]] variables and [[#FN-DEF-DEFCONSTANT|<code>DEFCONSTANT</code>]] global constants have their values initialized via the code on startup.

The net result of this distinction is as follows: if a world is saved out via WRITE-IMAGE, and then used to restart a SubL system, the values of [[#FN-DEF-DEFVAR|<code>DEFVAR</code>]] variables will persist, while any changes to [[#FN-DEF-DEFPARAMETER|<code>DEFPARAMETER</code>]] variables will be lost when they are reset to their original code-specified initial values on startup. [[|]]

-----

= Index =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/index.html CLtL2 Reference]

'''[[#Index-A|A]] | [[#Index-B|B]] | [[#Index-C|C]] | [[#Index-D|D]] | [[#Index-E|E]] | [[#Index-F|F]] | [[#Index-G|G]] | [[#Index-H|H]] | [[#Index-I|I]] | [[#Index-J|J]] | [[#Index-K|K]] | [[#Index-L|L]] | [[#Index-M|M]] | [[#Index-N|N]] | [[#Index-O|O]] | [[#Index-P|P]] | [[#Index-Q|Q]] | [[#Index-R|R]] | [[#Index-S|S]] | [[#Index-T|T]] | [[#Index-U|U]] | [[#Index-V|V]] | [[#Index-W|W]] | [[#Index-X|X]] | [[#Index-Y|Y]] | [[#Index-Z|Z]]'''

 
[[#FN-DEF-1280|<code>*</code>]] function 
[[#SYM-DEF-1280|<code>*</code>]] variable 
[[#SYM-DEF-165120|<code>**</code>]] variable 
[[#SYM-DEF-21136640|<code>***</code>]] variable 
[[#SYM-DEF-1161467279|<code>*CLOCK-GRANULARITY*</code>]] variable 
[[#SYM-DEF-1424597890|<code>*CONTINUE-CERROR?*</code>]] variable 
[[#SYM-DEF-609384130|<code>*DEFAULT-PATHNAME-DEFAULTS*</code>]] variable 
[[#SYM-DEF-2020021124|<code>*EPOCH*</code>]] variable 
[[#SYM-DEF-860597104|<code>*ERROR-ABORT-HANDLER*</code>]] variable 
[[#SYM-DEF-354311860|<code>*ERROR-HANDLER*</code>]] variable 
[[#SYM-DEF-1079241228|<code>*ERROR-MESSAGE*</code>]] variable 
[[#SYM-DEF-704643174|<code>*ERROR-OUTPUT*</code>]] variable 
[[#SYM-DEF-204607828|<code>*IGNORE-BREAKS?*</code>]] variable 
[[#SYM-DEF-2065003033|<code>*IGNORE-MUSTS?*</code>]] variable 
[[#SYM-DEF-1528898064|<code>*IGNORE-WARNS?*</code>]] variable 
[[#SYM-DEF-1188374285|<code>*MOST-NEGATIVE-FIXNUM*</code>]] variable 
[[#SYM-DEF-113980253|<code>*MOST-POSITIVE-FIXNUM*</code>]] variable 
[[#SYM-DEF-1624760991|<code>*MULTIPLE-VALUES-LIMIT*</code>]] variable 
[[#SYM-DEF-1405149315|<code>*NULL-OUTPUT*</code>]] variable 
[[#SYM-DEF-313735324|<code>*PRINT-ESCAPE*</code>]] variable 
[[#SYM-DEF-430643141|<code>*RAND-MAX*</code>]] variable 
[[#SYM-DEF-371148559|<code>*SIGNAL-MAX*</code>]] variable 
[[#SYM-DEF-694198800|<code>*SILENT-PROGRESS?*</code>]] variable 
[[#SYM-DEF-1112282190|<code>*STANDARD-INPUT*</code>]] variable 
[[#SYM-DEF-1982975489|<code>*STANDARD-OUTPUT*</code>]] variable 
[[#SYM-DEF-1570894042|<code>*SUSPEND-TYPE-CHECKING?*</code>]] variable 
[[#FN-DEF-+|<code>+</code>]] function 
[[#FN-DEF--|<code>-</code>]] function 
[[#FN-DEF-/|<code>/</code>]] function 
[[#FN-DEF-/=|<code>/=</code>]] function 
[[#FN-DEF-3584|<code><</code>]] function 
[[#FN-DEF-462464|<code><=</code>]] function 
[[#FN-DEF-=|<code>=</code>]] function 
[[#FN-DEF-3840|<code>></code>]] function 
[[#FN-DEF-495232|<code>>=</code>]] function [[|]]

==== A ====

 
[[#FN-DEF-ACONS|<code>ACONS</code>]] function 
[[#FN-DEF-ADJOIN|<code>ADJOIN</code>]] function 
[[#FN-DEF-ALERT-USER|<code>ALERT-USER</code>]] function 
[[#FN-DEF-ALPHA-CHAR-P|<code>ALPHA-CHAR-P</code>]] function 
[[#FN-DEF-ALPHANUMERICP|<code>ALPHANUMERICP</code>]] function 
[[#FN-DEF-APPEND|<code>APPEND</code>]] function 
[[#FN-DEF-APPEND-FILES|<code>APPEND-FILES</code>]] function 
[[#FN-DEF-APPLY|<code>APPLY</code>]] function 
[[#FN-DEF-AREF|<code>AREF</code>]] function 
[[#FN-DEF-ASSOC|<code>ASSOC</code>]] function 
[[#FN-DEF-ASSOC-IF|<code>ASSOC-IF</code>]] function 
[[#FN-DEF-ATOM|<code>ATOM</code>]] function [[|]]

==== B ====

 
[[#FN-DEF-BOTH-CASE-P|<code>BOTH-CASE-P</code>]] function 
[[#FN-DEF-BOUNDP|<code>BOUNDP</code>]] function 
[[#FN-DEF-BREAK|<code>BREAK</code>]] function 
[[#FN-DEF-BUTLAST|<code>BUTLAST</code>]] function 
[[#FN-DEF-BYTE|<code>BYTE</code>]] macro [[|]]

==== C ====

 
[[#FN-DEF-CAAR|<code>CAAR</code>]] function 
[[#FN-DEF-CADR|<code>CADR</code>]] function 
[[#FN-DEF-CAND|<code>CAND</code>]] macro 
[[#FN-DEF-CAR|<code>CAR</code>]] function 
[[#FN-DEF-CCATCH|<code>CCATCH</code>]] macro 
[[#FN-DEF-CCONCATENATE|<code>CCONCATENATE</code>]] function 
[[#FN-DEF-CDAR|<code>CDAR</code>]] function 
[[#FN-DEF-CDDR|<code>CDDR</code>]] function 
[[#FN-DEF-CDEC|<code>CDEC</code>]] macro 
[[#FN-DEF-CDESTRUCTURING-BIND|<code>CDESTRUCTURING-BIND</code>]] macro 
[[#FN-DEF-CDO|<code>CDO</code>]] macro 
[[#FN-DEF-CDOHASH|<code>CDOHASH</code>]] macro 
[[#FN-DEF-CDOLIST|<code>CDOLIST</code>]] macro 
[[#FN-DEF-CDOTIMES|<code>CDOTIMES</code>]] macro 
[[#FN-DEF-CDR|<code>CDR</code>]] function 
[[#FN-DEF-CEILING|<code>CEILING</code>]] function 
[[#FN-DEF-CERROR|<code>CERROR</code>]] function 
[[#FN-DEF-CHAR|<code>CHAR</code>]] function 
[[#FN-DEF-CHAR-CODE|<code>CHAR-CODE</code>]] function 
[[#FN-DEF-CHAR-DOWNCASE|<code>CHAR-DOWNCASE</code>]] function 
[[#FN-DEF-CHAR-EQUAL|<code>CHAR-EQUAL</code>]] function 
[[#FN-DEF-CHAR-GREATERP|<code>CHAR-GREATERP</code>]] function 
[[#FN-DEF-CHAR-LESSP|<code>CHAR-LESSP</code>]] function 
[[#FN-DEF-CHAR-NOT-EQUAL|<code>CHAR-NOT-EQUAL</code>]] function 
[[#FN-DEF-CHAR-NOT-GREATERP|<code>CHAR-NOT-GREATERP</code>]] function 
[[#FN-DEF-CHAR-NOT-LESSP|<code>CHAR-NOT-LESSP</code>]] function 
[[#FN-DEF-CHAR-UPCASE|<code>CHAR-UPCASE</code>]] function 
[[#FN-DEF-CHAR/=|<code>CHAR/=</code>]] function 
[[#FN-DEF-137661468|<code>CHAR<</code>]] function 
[[#FN-DEF-440795332|<code>CHAR<=</code>]] function 
[[#FN-DEF-CHAR=|<code>CHAR=</code>]] function 
[[#FN-DEF-137661724|<code>CHAR></code>]] function 
[[#FN-DEF-440828100|<code>CHAR>=</code>]] function 
[[#FN-DEF-CHARACTERP|<code>CHARACTERP</code>]] function 
[[#FN-DEF-CHECK-TYPE|<code>CHECK-TYPE</code>]] macro 
[[#FN-DEF-CINC|<code>CINC</code>]] macro 
[[#FN-DEF-CLET|<code>CLET</code>]] macro 
[[#FN-DEF-CLOSE|<code>CLOSE</code>]] function 
[[#FN-DEF-CLRHASH|<code>CLRHASH</code>]] function 
[[#FN-DEF-CMERGE|<code>CMERGE</code>]] function 
[[#FN-DEF-CMULTIPLE-VALUE-BIND|<code>CMULTIPLE-VALUE-BIND</code>]] macro 
[[#FN-DEF-CNOT|<code>CNOT</code>]] macro 
[[#FN-DEF-CODE-CHAR|<code>CODE-CHAR</code>]] function 
[[#FN-DEF-CONS|<code>CONS</code>]] function 
[[#FN-DEF-CONSP|<code>CONSP</code>]] function 
[[#FN-DEF-CONSTANTP|<code>CONSTANTP</code>]] function 
[[#FN-DEF-CONSTRUCT-FILENAME|<code>CONSTRUCT-FILENAME</code>]] function 
[[#FN-DEF-COPY-ALIST|<code>COPY-ALIST</code>]] function 
[[#FN-DEF-COPY-LIST|<code>COPY-LIST</code>]] function 
[[#FN-DEF-COPY-SEQ|<code>COPY-SEQ</code>]] function 
[[#FN-DEF-COPY-TREE|<code>COPY-TREE</code>]] function 
[[#FN-DEF-COR|<code>COR</code>]] macro 
[[#FN-DEF-COUNT|<code>COUNT</code>]] function 
[[#FN-DEF-COUNT-IF|<code>COUNT-IF</code>]] function 
[[#FN-DEF-CPOP|<code>CPOP</code>]] macro 
[[#FN-DEF-CPROGV|<code>CPROGV</code>]] macro 
[[#FN-DEF-CPUSH|<code>CPUSH</code>]] macro 
[[#FN-DEF-CPUSHNEW|<code>CPUSHNEW</code>]] macro 
[[#FN-DEF-CREDUCE|<code>CREDUCE</code>]] function 
[[#FN-DEF-CSETF|<code>CSETF</code>]] macro 
[[#FN-DEF-CSETQ|<code>CSETQ</code>]] macro 
[[#FN-DEF-CSOME|<code>CSOME</code>]] macro 
[[#FN-DEF-CTIME|<code>CTIME</code>]] macro 
[[#FN-DEF-CUNWIND-PROTECT|<code>CUNWIND-PROTECT</code>]] macro [[|]]

==== D ====

 
[[#FN-DEF-DEBUG|<code>DEBUG</code>]] function 
[[#FN-DEF-DECLAIM|<code>DECLAIM</code>]] macro 
[[#FN-DEF-DECLARE|<code>DECLARE</code>]] function 
[[#FN-DEF-DECODE-UNIVERSAL-TIME|<code>DECODE-UNIVERSAL-TIME</code>]] function 
[[#FN-DEF-DEFAULT-SIGNAL-HANDLER|<code>DEFAULT-SIGNAL-HANDLER</code>]] function 
[[#FN-DEF-DEFAULT-STRUCT-PRINT-FUNCTION|<code>DEFAULT-STRUCT-PRINT-FUNCTION</code>]] function 
[[#FN-DEF-DEFCONSTANT|<code>DEFCONSTANT</code>]] macro 
[[#FN-DEF-DEFINE|<code>DEFINE</code>]] macro 
[[#FN-DEF-DEFINE-METHOD|<code>DEFINE-METHOD</code>]] macro 
[[#FN-DEF-DEFMACRO|<code>DEFMACRO</code>]] macro 
[[#FN-DEF-DEFPARAMETER|<code>DEFPARAMETER</code>]] macro 
[[#FN-DEF-DEFPOLYMORPHIC|<code>DEFPOLYMORPHIC</code>]] macro 
[[#FN-DEF-DEFSTRUCT|<code>DEFSTRUCT</code>]] macro 
[[#FN-DEF-DEFVAR|<code>DEFVAR</code>]] macro 
[[#FN-DEF-DELETE|<code>DELETE</code>]] function 
[[#FN-DEF-DELETE-DUPLICATES|<code>DELETE-DUPLICATES</code>]] function 
[[#FN-DEF-DELETE-FILE|<code>DELETE-FILE</code>]] function 
[[#FN-DEF-DELETE-IF|<code>DELETE-IF</code>]] function 
[[#FN-DEF-DIGIT-CHAR-P|<code>DIGIT-CHAR-P</code>]] function 
[[#FN-DEF-DIRECTORY|<code>DIRECTORY</code>]] function 
[[#FN-DEF-DPB|<code>DPB</code>]] function [[|]]

==== E ====

 
[[#FN-DEF-EIGHTH|<code>EIGHTH</code>]] function 
[[#FN-DEF-ELT|<code>ELT</code>]] function 
[[#FN-DEF-ENCODE-TIMESTRING|<code>ENCODE-TIMESTRING</code>]] function 
[[#FN-DEF-ENCODE-UNIVERSAL-TIME|<code>ENCODE-UNIVERSAL-TIME</code>]] function 
[[#FN-DEF-ENDP|<code>ENDP</code>]] function 
[[#FN-DEF-EQ|<code>EQ</code>]] function 
[[#FN-DEF-EQL|<code>EQL</code>]] function 
[[#FN-DEF-EQUAL|<code>EQUAL</code>]] function 
[[#FN-DEF-EQUALP|<code>EQUALP</code>]] function 
[[#FN-DEF-ERROR|<code>ERROR</code>]] function 
[[#FN-DEF-EVAL|<code>EVAL</code>]] function 
[[#FN-DEF-EVENP|<code>EVENP</code>]] function [[|]]

==== F ====

 
[[#FN-DEF-FBOUNDP|<code>FBOUNDP</code>]] function 
[[#FN-DEF-FIF|<code>FIF</code>]] macro 
[[#FN-DEF-FIFTH|<code>FIFTH</code>]] function 
[[#FN-DEF-FILE-AUTHOR|<code>FILE-AUTHOR</code>]] function 
[[#FN-DEF-FILE-LENGTH|<code>FILE-LENGTH</code>]] function 
[[#FN-DEF-FILE-WRITE-DATE|<code>FILE-WRITE-DATE</code>]] function 
[[#FN-DEF-FILL|<code>FILL</code>]] function 
[[#FN-DEF-FIND|<code>FIND</code>]] function 
[[#FN-DEF-FIND-IF|<code>FIND-IF</code>]] function 
[[#FN-DEF-FIND-SYMBOL|<code>FIND-SYMBOL</code>]] function 
[[#FN-DEF-FIRST|<code>FIRST</code>]] function 
[[#FN-DEF-FIXNUMP|<code>FIXNUMP</code>]] function 
[[#FN-DEF-FLOAT|<code>FLOAT</code>]] function 
[[#FN-DEF-FLOATP|<code>FLOATP</code>]] function 
[[#FN-DEF-FLOOR|<code>FLOOR</code>]] function 
[[#FN-DEF-FMAKUNBOUND|<code>FMAKUNBOUND</code>]] function 
[[#FN-DEF-FORCE-OUTPUT|<code>FORCE-OUTPUT</code>]] function 
[[#FN-DEF-FORK-PROCESS|<code>FORK-PROCESS</code>]] function 
[[#FN-DEF-FORMAT|<code>FORMAT</code>]] function 
[[#FN-DEF-FOURTH|<code>FOURTH</code>]] function 
[[#FN-DEF-FUNCALL|<code>FUNCALL</code>]] function 
[[#FN-DEF-FUNCTION|<code>FUNCTION</code>]] macro 
[[#FN-DEF-FUNCTION-INFORMATION|<code>FUNCTION-INFORMATION</code>]] function 
[[#FN-DEF-FUNCTION-SPEC-P|<code>FUNCTION-SPEC-P</code>]] function 
[[#FN-DEF-FUNCTIONP|<code>FUNCTIONP</code>]] function 
[[#FN-DEF-FUNLESS|<code>FUNLESS</code>]] macro 
[[#FN-DEF-FWHEN|<code>FWHEN</code>]] macro [[|]]

==== G ====

 
[[#FN-DEF-GC|<code>GC</code>]] function 
[[#FN-DEF-GENSYM|<code>GENSYM</code>]] function 
[[#FN-DEF-GENTEMP|<code>GENTEMP</code>]] function 
[[#FN-DEF-GET|<code>GET</code>]] function 
[[#FN-DEF-GET-CONSING-STATE|<code>GET-CONSING-STATE</code>]] function 
[[#FN-DEF-GET-FILE-POSITION|<code>GET-FILE-POSITION</code>]] function 
[[#FN-DEF-GET-INTERNAL-REAL-TIME|<code>GET-INTERNAL-REAL-TIME</code>]] function 
[[#FN-DEF-GET-MACHINE-NAME|<code>GET-MACHINE-NAME</code>]] function 
[[#FN-DEF-GET-NETWORK-NAME|<code>GET-NETWORK-NAME</code>]] function 
[[#FN-DEF-GET-PROCESS-ID|<code>GET-PROCESS-ID</code>]] function 
[[#FN-DEF-GET-STRING-FROM-USER|<code>GET-STRING-FROM-USER</code>]] function 
[[#FN-DEF-GET-UNIVERSAL-TIME|<code>GET-UNIVERSAL-TIME</code>]] function 
[[#FN-DEF-GET-USER-NAME|<code>GET-USER-NAME</code>]] function 
[[#FN-DEF-GETHASH|<code>GETHASH</code>]] function [[|]]

==== H ====

 
[[#FN-DEF-HASH-TABLE-COUNT|<code>HASH-TABLE-COUNT</code>]] function 
[[#FN-DEF-HASH-TABLE-P|<code>HASH-TABLE-P</code>]] function [[|]]

==== I ====

 
[[#FN-DEF-IDENTITY|<code>IDENTITY</code>]] function 
[[#FN-DEF-IGNORE|<code>IGNORE</code>]] function 
[[#FN-DEF-IN-PACKAGE|<code>IN-PACKAGE</code>]] macro 
[[#FN-DEF-INPUT-STREAM-P|<code>INPUT-STREAM-P</code>]] function 
[[#FN-DEF-INSTALL-SIGNAL-HANDLER|<code>INSTALL-SIGNAL-HANDLER</code>]] function 
[[#FN-DEF-INT/|<code>INT/</code>]] function 
[[#FN-DEF-INTEGER-DECODE-FLOAT|<code>INTEGER-DECODE-FLOAT</code>]] function 
[[#FN-DEF-INTEGERP|<code>INTEGERP</code>]] function 
[[#FN-DEF-INTERN|<code>INTERN</code>]] function 
[[#FN-DEF-INTERSECTION|<code>INTERSECTION</code>]] function [[|]]

==== J ====

[[|]]

==== K ====

 
[[#FN-DEF-KEYWORDP|<code>KEYWORDP</code>]] function [[|]]

==== L ====

 
[[#FN-DEF-LAST|<code>LAST</code>]] function 
[[#FN-DEF-LDB|<code>LDB</code>]] function 
[[#FN-DEF-LDIFF|<code>LDIFF</code>]] function 
[[#FN-DEF-LENGTH|<code>LENGTH</code>]] function 
[[#FN-DEF-LIST|<code>LIST</code>]] function 
[[#FN-DEF-443877220|<code>LIST*</code>]] function 
[[#FN-DEF-LIST-LENGTH|]]<code>LIST-LENGTH</code> function function 
[[#FN-DEF-LISTP|]]<code>LISTP</code> function 
[[#FN-DEF-LOAD|]]<code>LOAD</code> function 
[[#FN-DEF-LOG-MESSAGE|]]<code>LOG-MESSAGE</code> function 
[[#FN-DEF-LOWER-CASE-P|]]<code>LOWER-CASE-P</code> function[[|]]

==== M ====

 
[[#FN-DEF-MAKE-HASH-TABLE|]]<code>MAKE-HASH-TABLE</code> function 
[[#FN-DEF-MAKE-LIST|]]<code>MAKE-LIST</code> function 
[[#FN-DEF-MAKE-STRING|]]<code>MAKE-STRING</code> function 
[[#FN-DEF-MAKE-SYMBOL|]]<code>MAKE-SYMBOL</code> function 
[[#FN-DEF-MAKE-VECTOR|]]<code>MAKE-VECTOR</code> function 
[[#FN-DEF-MAKUNBOUND|]]<code>MAKUNBOUND</code> function 
[[#FN-DEF-MAPC|]]<code>MAPC</code> function 
[[#FN-DEF-MAPCAN|]]<code>MAPCAN</code> function 
[[#FN-DEF-MAPCAR|]]<code>MAPCAR</code> function 
[[#FN-DEF-MAPCON|]]<code>MAPCON</code> function 
[[#FN-DEF-MAPHASH|]]<code>MAPHASH</code> function 
[[#FN-DEF-MAPL|]]<code>MAPL</code> function 
[[#FN-DEF-MAPLIST|]]<code>MAPLIST</code> function 
[[#FN-DEF-MAX|]]<code>MAX</code> function 
[[#FN-DEF-MEMBER|]]<code>MEMBER</code> function 
[[#FN-DEF-MEMBER-IF|]]<code>MEMBER-IF</code> function 
[[#FN-DEF-MIN|]]<code>MIN</code> function 
[[#FN-DEF-MINUSP|]]<code>MINUSP</code> function 
[[#FN-DEF-MISMATCH|]]<code>MISMATCH</code> function 
[[#FN-DEF-MOD|]]<code>MOD</code> macro 
[[#FN-DEF-MULTIPLE-VALUE-LIST|]]<code>MULTIPLE-VALUE-LIST</code> macro 
[[#FN-DEF-MUST|]]<code>MUST</code> function[[|]]

==== N ====

 
[[#FN-DEF-NBUTLAST|]]<code>NBUTLAST</code> function 
[[#FN-DEF-NCONC|]]<code>NCONC</code> function 
[[#FN-DEF-NINTERSECTION|]]<code>NINTERSECTION</code> function 
[[#FN-DEF-NINTH|]]<code>NINTH</code> function 
[[#FN-DEF-NOTE-ACTIVITY|]]<code>NOTE-ACTIVITY</code> function 
[[#FN-DEF-NOTE-NUMERIC-PROGRESS|]]<code>NOTE-NUMERIC-PROGRESS</code> function 
[[#FN-DEF-NOTE-PERCENT-PROGRESS|]]<code>NOTE-PERCENT-PROGRESS</code> function 
[[#FN-DEF-NOTIFY-USER|]]<code>NOTIFY-USER</code> macro 
[[#FN-DEF-NOTING-ACTIVITY|]]<code>NOTING-ACTIVITY</code> macro 
[[#FN-DEF-NOTING-NUMERIC-PROGRESS|]]<code>NOTING-NUMERIC-PROGRESS</code> macro 
[[#FN-DEF-NOTING-PERCENT-PROGRESS|]]<code>NOTING-PERCENT-PROGRESS</code> function 
[[#FN-DEF-NRECONC|]]<code>NRECONC</code> function 
[[#FN-DEF-NREVERSE|]]<code>NREVERSE</code> function 
[[#FN-DEF-NSET-DIFFERENCE|]]<code>NSET-DIFFERENCE</code> function 
[[#FN-DEF-NSET-EXCLUSIVE-OR|]]<code>NSET-EXCLUSIVE-OR</code> function 
[[#FN-DEF-NSTRING-CAPITALIZE|]]<code>NSTRING-CAPITALIZE</code> function 
[[#FN-DEF-NSTRING-DOWNCASE|]]<code>NSTRING-DOWNCASE</code> function 
[[#FN-DEF-NSTRING-UPCASE|]]<code>NSTRING-UPCASE</code> function 
[[#FN-DEF-NSUBLIS|]]<code>NSUBLIS</code> function 
[[#FN-DEF-NSUBST|]]<code>NSUBST</code> function 
[[#FN-DEF-NSUBST-IF|]]<code>NSUBST-IF</code> function 
[[#FN-DEF-NSUBSTITUTE|]]<code>NSUBSTITUTE</code> function 
[[#FN-DEF-NSUBSTITUTE-IF|]]<code>NSUBSTITUTE-IF</code> function 
[[#FN-DEF-NTH|]]<code>NTH</code> function 
[[#FN-DEF-NTHCDR|]]<code>NTHCDR</code> function 
[[#FN-DEF-NULL|]]<code>NULL</code> function 
[[#FN-DEF-NUMBERP|]]<code>NUMBERP</code> function 
[[#FN-DEF-NUNION|]]<code>NUNION</code> function[[|]]

==== O ====

 
[[#FN-DEF-ODDP|]]<code>ODDP</code> function 
[[#FN-DEF-OPEN-BINARY|]]<code>OPEN-BINARY</code> function 
[[#FN-DEF-OPEN-TCP-STREAM|]]<code>OPEN-TCP-STREAM</code> function 
[[#FN-DEF-OPEN-TEXT|]]<code>OPEN-TEXT</code> function 
[[#FN-DEF-OUTPUT-STREAM-P|]]<code>OUTPUT-STREAM-P</code> function[[|]]

==== P ====

 
[[#FN-DEF-PAIRLIS|]]<code>PAIRLIS</code> macro 
[[#FN-DEF-PCASE|]]<code>PCASE</code> macro 
[[#FN-DEF-PCOND|]]<code>PCOND</code> macro 
[[#FN-DEF-PIF|]]<code>PIF</code> function 
[[#FN-DEF-PLUSP|]]<code>PLUSP</code> function 
[[#FN-DEF-POSITION|]]<code>POSITION</code> function 
[[#FN-DEF-POSITION-IF|]]<code>POSITION-IF</code> function 
[[#FN-DEF-PRIN1|]]<code>PRIN1</code> function 
[[#FN-DEF-PRIN1-TO-STRING|]]<code>PRIN1-TO-STRING</code> function 
[[#FN-DEF-PRINC|]]<code>PRINC</code> function 
[[#FN-DEF-PRINC-TO-STRING|]]<code>PRINC-TO-STRING</code> function 
[[#FN-DEF-PRINT|]]<code>PRINT</code> macro 
[[#FN-DEF-PRINTING-OBJECT|]]<code>PRINTING-OBJECT</code> function 
[[#FN-DEF-PROBE-FILE|]]<code>PROBE-FILE</code> function 
[[#FN-DEF-PROCLAIM|]]<code>PROCLAIM</code> macro 
[[#FN-DEF-PROGN|]]<code>PROGN</code> macro 
[[#FN-DEF-PUNLESS|]]<code>PUNLESS</code> function 
[[#FN-DEF-PUT|]]<code>PUT</code> macro 
[[#FN-DEF-PWHEN|]]<code>PWHEN</code> function[[|]]

==== Q ====

 
[[#FN-DEF-QUOTE|]]<code>QUOTE</code> function[[|]]

==== R ====

 
[[#FN-DEF-RANDOM|]]<code>RANDOM</code> function 
[[#FN-DEF-RASSOC|]]<code>RASSOC</code> function 
[[#FN-DEF-RASSOC-IF|]]<code>RASSOC-IF</code> function 
[[#FN-DEF-READ|]]<code>READ</code> function 
[[#FN-DEF-READ-BYTE|]]<code>READ-BYTE</code> function 
[[#FN-DEF-READ-CHAR|]]<code>READ-CHAR</code> function 
[[#FN-DEF-READ-FROM-STRING|]]<code>READ-FROM-STRING</code> function 
[[#FN-DEF-READ-LINE|]]<code>READ-LINE</code> function 
[[#FN-DEF-REM|]]<code>REM</code> function 
[[#FN-DEF-REMHASH|]]<code>REMHASH</code> function 
[[#FN-DEF-REMOVE|]]<code>REMOVE</code> function 
[[#FN-DEF-REMOVE-DUPLICATES|]]<code>REMOVE-DUPLICATES</code> function 
[[#FN-DEF-REMOVE-IF|]]<code>REMOVE-IF</code> function 
[[#FN-DEF-REMPROP|]]<code>REMPROP</code> function 
[[#FN-DEF-RENAME-FILE|]]<code>RENAME-FILE</code> function 
[[#FN-DEF-REPLACE|]]<code>REPLACE</code> function 
[[#FN-DEF-REPORT-ERROR|]]<code>REPORT-ERROR</code> function 
[[#FN-DEF-REST|]]<code>REST</code> function 
[[#FN-DEF-RESTART-PROCESS|]]<code>RESTART-PROCESS</code> macro 
[[#FN-DEF-RET|]]<code>RET</code> function 
[[#FN-DEF-REVAPPEND|]]<code>REVAPPEND</code> function 
[[#FN-DEF-REVERSE|]]<code>REVERSE</code> function 
[[#FN-DEF-ROUND|]]<code>ROUND</code> function 
[[#FN-DEF-RPLACA|]]<code>RPLACA</code> function 
[[#FN-DEF-RPLACD|]]<code>RPLACD</code> function[[|]]

==== S ====

 
[[#FN-DEF-SCALE-FLOAT|]]<code>SCALE-FLOAT</code> function 
[[#FN-DEF-SEARCH|]]<code>SEARCH</code> function 
[[#FN-DEF-SECOND|]]<code>SECOND</code> function 
[[#FN-DEF-SEED-RANDOM|]]<code>SEED-RANDOM</code> function 
[[#FN-DEF-SEQUENCEP|]]<code>SEQUENCEP</code> function 
[[#FN-DEF-SET|]]<code>SET</code> function 
[[#FN-DEF-SET-AREF|]]<code>SET-AREF</code> function 
[[#FN-DEF-SET-CHAR|]]<code>SET-CHAR</code> function 
[[#FN-DEF-SET-CONSING-STATE|]]<code>SET-CONSING-STATE</code> function 
[[#FN-DEF-SET-DIFFERENCE|]]<code>SET-DIFFERENCE</code> function 
[[#FN-DEF-SET-EXCLUSIVE-OR|]]<code>SET-EXCLUSIVE-OR</code> function 
[[#FN-DEF-SET-FILE-POSITION|]]<code>SET-FILE-POSITION</code> function 
[[#FN-DEF-SET-NTH|]]<code>SET-NTH</code> function 
[[#FN-DEF-SETHASH|]]<code>SETHASH</code> function 
[[#FN-DEF-SEVENTH|]]<code>SEVENTH</code> function 
[[#FN-DEF-SIXTH|]]<code>SIXTH</code> function 
[[#FN-DEF-SLEEP|]]<code>SLEEP</code> function 
[[#FN-DEF-SORT|]]<code>SORT</code> function 
[[#FN-DEF-STABLE-SORT|]]<code>STABLE-SORT</code> function 
[[#FN-DEF-STREAMP|]]<code>STREAMP</code> function 
[[#FN-DEF-STRING|]]<code>STRING</code> function 
[[#FN-DEF-STRING-CAPITALIZE|]]<code>STRING-CAPITALIZE</code> function 
[[#FN-DEF-STRING-DOWNCASE|]]<code>STRING-DOWNCASE</code> function 
[[#FN-DEF-STRING-EQUAL|]]<code>STRING-EQUAL</code> function 
[[#FN-DEF-STRING-GREATERP|]]<code>STRING-GREATERP</code> function 
[[#FN-DEF-STRING-LEFT-TRIM|]]<code>STRING-LEFT-TRIM</code> function 
[[#FN-DEF-STRING-LESSP|]]<code>STRING-LESSP</code> function 
[[#FN-DEF-STRING-NOT-EQUAL|]]<code>STRING-NOT-EQUAL</code> function 
[[#FN-DEF-STRING-NOT-GREATERP|]]<code>STRING-NOT-GREATERP</code> function 
[[#FN-DEF-STRING-NOT-LESSP|]]<code>STRING-NOT-LESSP</code> function 
[[#FN-DEF-STRING-RIGHT-TRIM|]]<code>STRING-RIGHT-TRIM</code> function 
[[#FN-DEF-STRING-TRIM|]]<code>STRING-TRIM</code> function 
[[#FN-DEF-STRING-UPCASE|]]<code>STRING-UPCASE</code> function 
[[#FN-DEF-STRING/=|]]<code>STRING/=</code> function 
[[#FN-DEF-427203732|]]<code>STRING<</code> function 
[[#FN-DEF-994985164|]]<code>STRING<=</code> function 
[[#FN-DEF-STRING=|]]<code>STRING=</code> function 
[[#FN-DEF-427203988|]]<code>STRING></code> function 
[[#FN-DEF-995017932|]]<code>STRING>=</code> function 
[[#FN-DEF-STRINGP|]]<code>STRINGP</code> function 
[[#FN-DEF-SUBLIS|]]<code>SUBLIS</code> function 
[[#FN-DEF-SUBSEQ|]]<code>SUBSEQ</code> function 
[[#FN-DEF-SUBSETP|]]<code>SUBSETP</code> function 
[[#FN-DEF-SUBST|]]<code>SUBST</code> function 
[[#FN-DEF-SUBST-IF|]]<code>SUBST-IF</code> function 
[[#FN-DEF-SUBSTITUTE|]]<code>SUBSTITUTE</code> function 
[[#FN-DEF-SUBSTITUTE-IF|]]<code>SUBSTITUTE-IF</code> function 
[[#FN-DEF-SXHASH|]]<code>SXHASH</code> function 
[[#FN-DEF-SYMBOL-FUNCTION|]]<code>SYMBOL-FUNCTION</code> function 
[[#FN-DEF-SYMBOL-NAME|]]<code>SYMBOL-NAME</code> function 
[[#FN-DEF-SYMBOL-PLIST|]]<code>SYMBOL-PLIST</code> function 
[[#FN-DEF-SYMBOL-VALUE|]]<code>SYMBOL-VALUE</code> function 
[[#FN-DEF-SYMBOLP|]]<code>SYMBOLP</code> function[[|]]

==== T ====

 
[[#FN-DEF-TAILP|]]<code>TAILP</code> function 
[[#FN-DEF-TENTH|]]<code>TENTH</code> function 
[[#FN-DEF-TERPRI|]]<code>TERPRI</code> function 
[[#FN-DEF-THIRD|]]<code>THIRD</code> function 
[[#FN-DEF-THROW|]]<code>THROW</code> function 
[[#FN-DEF-TIME-FROM-NOW|]]<code>TIME-FROM-NOW</code> function 
[[#FN-DEF-TIME-HAS-ARRIVED?|]]<code>TIME-HAS-ARRIVED?</code> function 
[[#FN-DEF-TIMESTRING|]]<code>TIMESTRING</code> function 
[[#FN-DEF-TREE-EQUAL|]]<code>TREE-EQUAL</code> function 
[[#FN-DEF-TRUNCATE|]]<code>TRUNCATE</code> function[[|]]

==== U ====

 
[[#FN-DEF-UNION|]]<code>UNION</code> function 
[[#FN-DEF-UNREAD-CHAR|]]<code>UNREAD-CHAR</code> function 
[[#FN-DEF-UPPER-CASE-P|]]<code>UPPER-CASE-P</code> function 
[[#FN-DEF-USER-CONFIRM|]]<code>USER-CONFIRM</code> function[[|]]

==== V ====

 
[[#FN-DEF-VALUES|]]<code>VALUES</code> function 
[[#FN-DEF-VARIABLE-INFORMATION|]]<code>VARIABLE-INFORMATION</code> function 
[[#FN-DEF-VECTOR|]]<code>VECTOR</code> function 
[[#FN-DEF-VECTORP|]]<code>VECTORP</code> function[[|]]

==== W ====

 
[[#FN-DEF-WARN|]]<code>WARN</code> macro 
[[#FN-DEF-WITH-BINARY-FILE|]]<code>WITH-BINARY-FILE</code> macro 
[[#FN-DEF-WITH-STATIC-AREA|]]<code>WITH-STATIC-AREA</code> macro 
[[#FN-DEF-WITH-TEXT-FILE|]]<code>WITH-TEXT-FILE</code> function 
[[#FN-DEF-WRITE|]]<code>WRITE</code> function 
[[#FN-DEF-WRITE-BYTE|]]<code>WRITE-BYTE</code> function 
[[#FN-DEF-WRITE-CHAR|]]<code>WRITE-CHAR</code> function 
[[#FN-DEF-WRITE-IMAGE|]]<code>WRITE-IMAGE</code> function 
[[#FN-DEF-WRITE-LINE|]]<code>WRITE-LINE</code> function 
[[#FN-DEF-WRITE-STRING|]]<code>WRITE-STRING</code> function 
[[#FN-DEF-WRITE-TO-STRING|]]<code>WRITE-TO-STRING</code> function[[|]]

==== X ====

[[|]]

==== Y ====

[[|]]

==== Z ====

 
[[#FN-DEF-ZEROP|]]<code>ZEROP</code>

SubL

2017-04-17T09:58:06Z

DouglasRMiles:

[[|]]

== [http://web.archive.org/web/20060325065433/http://www.opencyc.org [[File:/web/20060325065433im_/http://www.cyc.com/cycdoc/img/opencyc-logo-small.gif|OpenCyc.org Homepage]]]SubL Reference ==

E-Mail Comments to: [http://web.archive.org/web/20060325065433/mailto:opencyc-doc@cyc.com opencyc-doc@cyc.com] 
Last Update: 03/28/2002 
''CopyrightÂ© 1996-2002 [http://web.archive.org/web/20060325065433/http://www.cyc.com Cycorp]. All rights reserved.'' 
------------------------------------------------------------------------

= How to Use this Document =

SubL is a computer language built by members of Cycorp. SubL was written to support the CycÂ® application, allowing it to run both under Lisp environments and as a C application generated by a SubL-to-C translator. This document describes the primitive functions of SubL.

Due to the close similarities between SubL and Common Lisp, the [[#Table-of-Contents|Table of Contents]] and structure of this document intentionally mirror that of

<blockquote>'''"Common Lisp: The Language"''', 
2nd Edition, 
Guy L. Steele Jr 
</blockquote>
making it easy to compare and contrast the two languages. For the most part, this document focuses only on the differences between SubL and Common Lisp.

An online version of [http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/clm.html "Common Lisp: The Language"] can be found at

<blockquote>[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/clm.html '''<code>http://www.supelec.fr/docs/cltl/clm/clm.html</code>'''] **not working**
</blockquote>
and an [http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/index.html index to all Common Lisp functions] can be found at

<blockquote>[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/index.html '''<code>http://www.supelec.fr/docs/cltl/clm/index.html</code>'''] **this is working**
</blockquote>
Each section of this document contains a link labelled '''"CLtL2 Reference"''' to the corresponding sections of the above online Common Lisp reference. The reader is strongly encouraged to consult that reference in parallel with this document. [[|]]

-----

= 0 : Table of Contents =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node1.html CLtL2 Reference]

* [[#Table-of-Contents|0 : Table of Contents]]
* [[#Introduction|1 : Introduction]]
* [[#Data-Types|2 : Data Types]]
* [[#Scope-and-Extent|3 : Scope and Extent]]
* [[#Type-Specifiers|4 : Type Specifiers]]
* [[#Program-Structure|5 : Program Structure]]
** [[#Defining-Named-Functions|5.3.1 : Defining Named Functions]]
** [[#Declaring|5.3.2 : Declaring Global Variables and Named Constants]]
* [[#Predicates|6 : Predicates]]
** [[#Logical-Values|6.1 : Logical Values]]
** [[#Specific-Data-Type-Predicates|6.2.2 : Specific Data Type Predicates]]
** [[#Equality-Predicates|6.3 : Equality Predicates]]
** [[#Logical-Operators|6.4 : Logical Operators]]
* [[#Control-Structure|7 : Control Structure]]
** [[#Reference|7.1.1 : Reference]]
** [[#Assignment|7.1.2 : Assignment]]
** [[#Generalized-Variables|7.2 : Generalized Variables]]
** [[#Function-Invocation|7.3 : Function Invocation]]
** [[#Simple-Sequencing|7.4 : Simple Sequencing]]
** [[#Establishing-New-Variable-Bindings|7.5 : Establishing New Variable Bindings]]
** [[#Conditionals|7.6 : Conditionals]]
** [[#Blocks-and-Exits|7.7 : Blocks and Exits]]
** [[#General-Iteration|7.8.2 : General Iteration]]
** [[#Simple-Iteration-Constructs|7.8.3 : Simple Iteration Constructs]]
** [[#Mapping|7.8.4 : Mapping]]
** [[#Constructs-for-Handling-Multiple-Values|7.10.1 : Constructs for Handling Multiple Values]]
** [[#Rules-Governing-the-Passing-of-Multiple-Values|7.10.2 : Rules Governing the Passing of Multiple Values]]
** [[#Dynamic-Non-Local-Exits|7.11 : Dynamic Non-Local Exits]]
* [[#Macros|8 : Macros]]
** [[#Macro-Definition|8.1 : Macro Definition]]
** [[#Destructuring|8.3 : Destructuring]]
** [[#Environments|8.5 : Environments]]
* [[#Declarations|9 : Declarations]]
** [[#Declaration-Syntax|9.1 : Declaration Syntax]]
** [[#Declaration-Specifiers|9.2 : Declaration Specifiers]]
* [[#Symbols|10 : Symbols]]
** [[#The-Property-List|10.1 : The Property List]]
** [[#The-Print-Name|10.2 : The Print Name]]
** [[#Creating-Symbols|10.3 : Creating Symbols]]
* [[#Packages|11 : Packages]]
* [[#Numbers|12 : Numbers]]
** [[#Predicates-on-Numbers|12.2 : Predicates on Numbers]]
** [[#Comparisons-on-Numbers|12.3 : Comparisons on Numbers]]
** [[#Arithmetic-Operations|12.4 : Arithmetic Operations]]
** [[#Irrational-and-Transcendental-Functions|12.5 : Irrational and Transcendental Functions]]
** [[#Type-Conversions-and-Component-Extractions-on-Numbers|12.6 : Type Conversions and Component Extractions on Numbers]]
** [[#Logical-Operations-on-Numbers|12.7 : Logical Operations on Numbers]]
** [[#Byte-Manipulation-Functions|12.8 : Byte Manipulation Functions]]
** [[#Random-Numbers|12.9 : Random Numbers]]
** [[#Implementation-Parameters|12.10 : Implementation Parameters]]
* [[#Characters|13 : Characters]]
** [[#Character-Attributes|13.1 : Character Attributes]]
** [[#Predicates-on-Characters|13.2 : Predicates on Characters]]
** [[#Character-Construction-and-Selection|13.3 : Character Construction and Selection]]
** [[#Character-Conversions|13.4 : Character Conversions]]
* [[#Sequences|14 : Sequences]]
** [[#Simple-Sequence-Functions|14.1 : Simple Sequence Functions]]
** [[#Concatenating-Mapping-and-Reducing-Sequences|14.2 : Concatenating, Mapping and Reducing Sequences]]
** [[#Modifying-Sequences|14.3 : Modifying Sequences]]
** [[#Searching-Sequences-for-Terms|14.4 : Searching Sequences for Terms]]
** [[#Sorting-and-Merging|14.5 : Sorting and Merging]]
* [[#Lists-Chapter|15 : Lists]]
** [[#Conses|15.1 : Conses]]
** [[#Lists|15.2 : Lists]]
** [[#Alteration-of-List-Structure|15.3 : Alteration of List Structure]]
** [[#Substitution-of-Expressions|15.4 : Substitution of Expressions]]
** [[#Using-Lists-as-Sets|15.5 : Using Lists as Sets]]
** [[#Association-Lists|15.6 : Association Lists]]
* [[#Hash-Tables|16 : Hash Tables]]
** [[#Hash-Table-Functions|16.1 : Hash Table Functions]]
** [[#Primitive-Hash-Function|16.2 : Primitive Hash Function]]
* [[#Arrays|17 : Arrays]]
** [[#Vector-Creation|17.1 : Vector Creation]]
** [[#Vector-Access|17.2 : Vector Access]]
* [[#Strings|18 : Strings]]
** [[#String-Access|18.1 : String Access]]
** [[#String-Comparison|18.2 : String Comparison]]
** [[#String-Construction-and-Manipulation|18.3 : String Construction and Manipulation]]
* [[#Structures|19 : Structures]]
* [[#The-Evaluator|20 : The Evaluator]]
** [[#Run-Time-Evaluation-of-Forms|20.1 : Run-Time Evaluation of Forms]]
** [[#The-Top-Level-Loop|20.2 : The Top-Level Loop]]
* [[#Streams|21 : Streams]]
** [[#Standard-Streams|21.1 : Standard Streams]]
** [[#Creating-new-Streams|21.2 : Creating new Streams]]
** [[#Operations-on-Streams|21.3 : Operations on Streams]]
* [[#Input-Output|22 : Input/Output]]
** [[#Printed-Representation-of-SubL-Objects|22.1 : Printed Representation of SubL Objects]]
** [[#Macro-Characters|22.1.3 : Macro Characters]]
** [[#Standard-Dispatching-Macro-Character-Syntax|22.1.4 : Standard Dispatching Macro Character Syntax]]
** [[#The-Readtable|22.1.5 : The Readtable]]
** [[#What-the-Print-Function-Produces|22.1.6 : What the Print Function Produces]]
** [[#Input-from-Character-Streams|22.2.1 : Input from Character Streams]]
** [[#Input-from-Binary-Streams|22.2.2 : Input from Binary Streams]]
** [[#Output-to-Character-Streams|22.3.1 : Output to Character Streams]]
** [[#Output-to-Binary-Streams|22.3.2 : Output to Binary Streams]]
** [[#Formatted-Output-to-Character-Streams|22.3.3 : Formatted Output to Character Streams]]
* [[#File-System-Interface|23 : File System Interface]]
** [[#File-Names|23.1 : File Names]]
** [[#Opening-and-Closing-Files|23.2 : Opening and Closing Files]]
** [[#Renaming-Deleting-and-Other-File-Operations|23.3 : Renaming, Deleting and Other File Operations]]
** [[#Loading-Files|23.4 : Loading Files]]
** [[#Accessing-Directories|23.5 : Accessing Directories]]
* [[#Errors|24 : Errors]]
** [[#General-Error-Signalling-Functions|24.1 : General Error-Signalling Functions]]
** [[#Specialized-Error-Signalling-Forms-and-Macros|24.2 : Specialized Error-Signalling Forms and Macros]]
* [[#Miscellaneous-Features|25 : Miscellaneous Features]]
** [[#The-Compiler|25.1 : The Compiler]]
** [[#Debugging-Tools|25.3 : Debugging Tools]]
** [[#Time-Functions|25.4.1 : Time Functions]]
** [[#Identity-Function|25.5 : Identity Function]]
* [[#Common-Lisp-Object-System|28 : Common Lisp Object System]]
* [[#SubL-Specific-Features|SubL-Specific Features]]
** [[#Signals|SubL.1 : Signals]]
** [[#System-Properties|SubL.2 : System Properties]]
** [[#Progress-Pacifiers|SubL.3 : Progress Pacifiers]]
** [[#Process-Manipulation|SubL.4 : Process Manipulation]]
** [[#Memory-Interaction|SubL.5 : Memory Interaction]]
* [[#Index|Index]]

[[|]]

-----

= 1 : Introduction =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node5.html CLtL2 Reference]

SubL is a programming language intended to be very similar to a simplified version of Common Lisp where those features that are either complex, rarely-used, or difficult to implement in a prodecural language have been excised.

Unlike Common Lisp, SubL is not a purely functional language. Several SubL constructs can only be used procedurally. In order to emphasize this difference, the following naming convention for SubL constructs is used:

<blockquote>A SubL function will have the same name as the analogous Common Lisp function if it is intended to have the exact same basic functionality. The argument list may be simplified, but the intent and use are likely to be the same.
</blockquote>
If there is a substantial behavioral difference between a SubL function and its Common Lisp counterpart, its name will be the Common Lisp name prepended with a single character -- either "c", "p" or "f".

<blockquote>"c" indicates a construct that is either only procedural or functional. 
"p" indicates the procedural version of a Common Lisp construct. 
"f" indicates the functional version of a Common Lisp construct. 
</blockquote>
A procedural construct in SubL is one which is suitable for evaluation as either one form in an explicit [[#FN-DEF-PROGN|<code>PROGN</code>]] or as one form in an implicit progn, which occur in the <code>&body;</code> sections of many of the procedural forms such as [[#FN-DEF-CLET|<code>CLET</code>]], [[#FN-DEF-PWHEN|<code>PWHEN</code>]], [[#FN-DEF-CDOLIST|<code>CDOLIST</code>]] etc.

Here is a table of all the procedural constructs in SubL and the Common Lisp analog:

<blockquote>'''SubL Procedural Construct'''

'''Common Lisp Equivalent'''

-----

<code>PROGN</code>

<code>progn</code>

<code>PIF</code>

<code>if</code>

<code>PWHEN</code>

<code>when</code>

<code>PUNLESS</code>

<code>unless</code>

<code>PCOND</code>

<code>cond</code>

<code>PCASE</code>

<code>case</code>

<code>CSETQ</code>

<code>setq</code>

<code>CSETF</code>

<code>setf</code>

<code>CINC</code>

<code>incf</code>

<code>CDEC</code>

<code>decf</code>

<code>CPUSH</code>

<code>push</code>

<code>CPUSHNEW</code>

<code>pushnew</code>

<code>CPOP</code>

<code>pop</code>

<code>CLET</code>

<code>let*</code>

<code>CMULTIPLE-VALUE-BIND</code>

<code>multiple-value-bind</code>

<code>CDO</code>

<code>do*</code>

<code>CDOLIST</code>

<code>dolist</code>

<code>CSOME</code>

` `

<code>CDOTIMES</code>

<code>dotimes</code>

<code>CDOHASH</code>

` `

<code>CCATCH</code>

<code>catch</code>

<code>CUNWIND-PROTECT</code>

<code>unwind-protect</code>

<code>RET</code>

<code>return-from</code>
</blockquote>
A functional construct in SubL is one which returns a value. Here is a table of all the functional constructs in SubL and the Common Lisp analog:

<blockquote>'''SubL Functional Construct'''

'''Common Lisp Equvalent'''

-----

<code>CAND</code>

<code>and</code>

<code>COR</code>

<code>or</code>

<code>CNOT</code>

<code>not</code>

<code>FIF</code>

<code>if</code>

<code>FWHEN</code>

<code>when</code>

<code>FUNLESS</code>

<code>unless</code>
</blockquote>
The body of a function or macro definition is considered an implicit progn, and so all forms in the body should be procedural. A function call can be used as a procedural construct. In this case, the returned value is simply ignored. [[|]]

-----

= 2 : Data Types =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node15.html CLtL2 Reference]

SubL has a flat type heirarchy. Each type is described in more detail in the sections about the methods for that particular type.

SubL supports these built-in Common Lisp datatypes:

<blockquote>{|
| Numbers:
| fixnum
|-
|

| float
|-
| Symbols:
| symbol
|-
| Lists:
| cons
|-
| Arrays:
| vector
|-
| Characters:
| character
|-
| Strings:
| string
|-
| Hashtables:
| eq hashtable
|-
|

| eql hashtable
|-
|

| equal hashtable
|-
|

| equalp hashtable
|-
| Streams:
| stream
|-
| Functions:
| function
|}

SubL does '''not''' support these Common Lisp datatypes:
</blockquote>
<blockquote>Multi-dimensional arrays 
Packages 
Pathnames 
Random-states 
Lambda-Expressions or Closures 
</blockquote>
SubL has only special-case support for these datatypes:

<blockquote>{|
| Readtables:
| SubL only supports a single internal readtable
|}

New data types can be introduced via [[#FN-DEF-DEFSTRUCT|<code>DEFSTRUCT</code>]]. [[|]]
</blockquote>

-----

= 3 : Scope and Extent =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node43.html CLtL2 Reference]

Special variables in SubL are all (and only) those variables defined globally with [[#FN-DEF-DEFVAR|<code>DEFVAR</code>]] or [[#FN-DEF-DEFPARAMETER|<code>DEFPARAMETER</code>]]. In addition, the name of each special variable must begin and end with an asterisk character : <code>'*'</code>.

Special variables have indefinite scope and dynamic extent. All other variables have lexical scope and dynamic extent

Variables are introduced via:

; '''Function call'''
: A new set of variables for the formal parameters of the function are introduced. The extent of the function arguments is the duration of the function invocation.
; '''[[#FN-DEF-CLET|<code>CLET</code>]], [[#FN-DEF-CMULTIPLE-VALUE-BIND|<code>CMULTIPLE-VALUE-BIND</code>]], [[#FN-DEF-CDESTRUCTURING-BIND|<code>CDESTRUCTURING-BIND</code>]]'''
: These constructs explicitly introduce and initialize new local variables. The extent of these variables is until exit from the constuct.
; '''[[#FN-DEF-CDO|<code>CDO</code>]], [[#FN-DEF-CDOLIST|<code>CDOLIST</code>]], [[#FN-DEF-CSOME|<code>CSOME</code>]], [[#FN-DEF-CDOTIMES|<code>CDOTIMES</code>]], [[#FN-DEF-CDOHASH|<code>CDOHASH</code>]]'''
: These iteration constructs explicitly introduce and update local variables which represent the state of the iteration. The extent of these variables is until exit from the iteration construct.

When a local variable is introduced with the same name as a local variable which is already within the current scope and extent, the new variable shadows the outer variable.

The initialization of a local variable is considered to occur within the scope of the new local variable. Consequently, a variable which is shadowing an outer variable cannot be initialized in terms of the outer value. For example, this is not allowed :

<blockquote><pre>(define foo (x)
(clet ((x (+ x 1)))
(print x))
(ret nil))</pre></blockquote>
However, if the variable is a special variable, the [[#FN-DEF-CLET|<code>CLET</code>]] is actually introducing a binding for the special variable, not introducing a new local variable. In this case, the initialization of the binding can be a function of its current value for the variable being bound. For example, this is allowed:

<blockquote><pre>(defvar *some-var* 1)

(define foo (x)
(clet ((*some-var* (+ *some-var* x)))
(print *some-var*))
(ret nil))</pre></blockquote>
The construct [[#FN-DEF-RET|<code>RET</code>]] must be used for a function or macro definition to return its intended result. [[|]]

-----

= 4 : Type Specifiers =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node44.html CLtL2 Reference]

SubL does not support type specifiers. [[|]]

-----

= 5 : Program Structure =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node55.html CLtL2 Reference]

Program structure in SubL mirrors that of Common Lisp almost exactly. All objects except lists and symbols are self-evaluating. This includes numbers, characters, strings, vectors and hashtables. In addition :

* Keyword symbols are self-evaluating.
* The symbols T and NIL are self-evaluating.

[[|]]

== 5.3.1 : Defining Named Functions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node66.html CLtL2 Reference] 
 
[[|]]macro <code>DEFINE : (name arglist &body body)</code>

All functions in SubL must be named and therefore defined via the SubL construct [[#FN-DEF-DEFINE|<code>DEFINE</code>]]. See also the similar construct [[#FN-DEF-DEFPOLYMORPHIC|<code>DEFPOLYMORPHIC</code>]] which is used to define generic functions which switch off the type of the first argument.

Argument lists for user-defined function can only be of this form:

<blockquote><pre>( {var}* [&optional; {var | ( var [initform [supplied-var]] ) }*] )</pre></blockquote>
In short, SubL supports <code>&optional;</code> arguments for user-defined functions but does '''not''' support <code>&keyword;</code>, <code>&aux;</code> or <code>&rest;</code> arguments for user-defined functions. [[|]]

== 5.3.2 : Declaring Global Variables and Named Constants ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node67.html CLtL2 Reference] 
 
[[|]]macro <code>DEFVAR : (variable &optional initialization documentation)</code> 
 
[[|]]macro <code>DEFPARAMETER : (variable initialization &optional documentation)</code>

[[#FN-DEF-DEFVAR|<code>DEFVAR</code>]] and [[#FN-DEF-DEFPARAMETER|<code>DEFPARAMETER</code>]] are the SubL constructs used to define global variables. The name of each variable must begin and end with an asterisk.

SubL enforces an important distinction between these two constructs, which is described in greater detail under [[#FN-DEF-WRITE-IMAGE|<code>WRITE-IMAGE</code>]]. 
 
[[|]]macro <code>DEFCONSTANT : (variable initialization &optional documentation)</code>

As with [[#FN-DEF-DEFVAR|<code>DEFVAR</code>]] and [[#FN-DEF-DEFPARAMETER|<code>DEFPARAMETER</code>]], the name of each named constant defined via [[#FN-DEF-DEFCONSTANT|<code>DEFCONSTANT</code>]] must begin and end with an asterisk. [[|]]

-----

= 6 : Predicates =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node69.html CLtL2 Reference] [[|]]

== 6.1 : Logical Values ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node70.html CLtL2 Reference]

The symbols NIL and T are used to represent the logical values "true" and "false" in SubL and behave exactly as they do in Common Lisp. [[|]]

== 6.2.2 : Specific Data Type Predicates ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node73.html CLtL2 Reference]

For the most part, the following predicates which check for specific data types behave exactly as they do in Common Lisp. 
 
[[|]]function <code>NULL : (x)</code> 
 
[[|]]function <code>SYMBOLP : (x)</code> 
 
[[|]]function <code>ATOM : (x)</code> 
 
[[|]]function <code>CONSP : (x)</code> 
 
[[|]]function <code>LISTP : (x)</code> 
 
[[|]]function <code>NUMBERP : (x)</code> 
 
[[|]]function <code>INTEGERP : (x)</code> 
 
[[|]]function <code>FLOATP : (x)</code> 
 
[[|]]function <code>CHARACTERP : (x)</code> 
 
[[|]]function <code>STRINGP : (x)</code> 
 
[[|]]function <code>VECTORP : (x)</code> 
 
[[|]]function <code>FUNCTIONP : (x)</code> 
Follows the CLtL2 implementation 
 
[[|]]function <code>FUNCTION-SPEC-P : (x)</code> 
Returns T IFF x is an object suitable for FUNCALL

In SubL, [[#FN-DEF-FUNCTIONP|<code>FUNCTIONP</code>]] only returns T if its argument is a function object. The function [[#FN-DEF-FUNCTION-SPEC-P|<code>FUNCTION-SPEC-P</code>]] returns T if its argument is suitable for [[#FN-DEF-FUNCALL|<code>FUNCALL</code>]] or [[#FN-DEF-APPLY|<code>APPLY</code>]]. [[|]]

== 6.3 : Equality Predicates ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node74.html CLtL2 Reference]

The SubL equality predicates behave exactly like their Common Lisp counterparts. 
 
[[|]]function <code>EQ : (x y)</code> 
 
[[|]]function <code>EQL : (x y)</code> 
 
[[|]]function <code>EQUAL : (x y)</code> 
 
[[|]]function <code>EQUALP : (x y)</code> [[|]]

== 6.4 : Logical Operators ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node75.html CLtL2 Reference]

SubL logical operations '''only''' return T or NIL. Otherwise, they behave like their Common Lisp counterparts. 
 
[[|]]macro <code>CNOT : (x)</code> 
 
[[|]]macro <code>CAND : (&rest args)</code> 
 
[[|]]macro <code>COR : (&rest args)</code> [[|]]

-----

= 7 : Control Structure =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node76.html CLtL2 Reference] [[|]]

== 7.1.1 : Reference ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node78.html CLtL2 Reference]

These SubL constructs behave exactly like their Common Lisp counterparts. 
 
[[|]]function <code>QUOTE : (data)</code> 
 
[[|]]macro <code>FUNCTION : (fspec)</code> 
 
[[|]]function <code>SYMBOL-VALUE : (x)</code> 
 
[[|]]function <code>SYMBOL-FUNCTION : (x)</code> 
 
[[|]]function <code>BOUNDP : (x)</code> 
 
[[|]]function <code>FBOUNDP : (x)</code> [[|]]

== 7.1.2 : Assignment ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node79.html CLtL2 Reference] 
 
[[|]]macro <code>CSETQ : (var value &rest var-val-pairs)</code>

Since [[#FN-DEF-CSETQ|<code>CSETQ</code>]] is procedural in SubL, it does not return a value. Otherwise, it behaves just like <code>setq</code> in Common Lisp.

These SubL functions for setting and unsetting symbol properties behave like their Common Lisp counterparts. 
 
[[|]]function <code>SET : (symbol value)</code> 
 
[[|]]function <code>MAKUNBOUND : (symbol)</code> 
 
[[|]]function <code>FMAKUNBOUND : (symbol)</code> [[|]]

== 7.2 : Generalized Variables ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node80.html CLtL2 Reference] 
 
[[|]]macro <code>CSETF : (place val)</code>

[[#FN-DEF-CSETF|<code>CSETF</code>]] is a more restricted version of <code>setf</code> in Common Lisp. First, since it is procedural, like [[#FN-DEF-CSETQ|<code>CSETQ</code>]] it does not return a value. Second, there is a much more restricted set of place-specifiers which are allowable. Here is a complete table of the allowable [[#FN-DEF-CSETF|<code>CSETF</code>]] forms, and their equivalent SubL expansions:

'''CSETF form'''

'''Equivalent SubL expansion'''

-----

<code>(CSETF</code> variable value''')'''

<code>(CSETQ</code> variable value''')'''

<code>(CSETF</code> ([[#FN-DEF-AREF|<code>AREF</code>]] vector n''')''' value''')'''

<code>(SET-AREF</code> vector n value''')'''

<code>(CSETF</code> ([[#FN-DEF-NTH|<code>NTH</code>]] n list''')''' value''')'''

<code>(SET-NTH</code> n list value''')'''

<code>(CSETF</code> ([[#FN-DEF-CAR|<code>CAR</code>]] cons''')''' value''')'''

<code>(RPLACA</code> cons value''')'''

<code>(CSETF</code> ([[#FN-DEF-CDR|<code>CDR</code>]] cons''')''' value''')'''

<code>(RPLACD</code> cons value''')'''

<code>(CSETF</code> ([[#FN-DEF-GET|<code>GET</code>]] symbol indicator''')''' value''')'''

<code>(PUT</code> symbol indicator value''')'''

<code>(CSETF</code> ([[#FN-DEF-GETHASH|<code>GETHASH</code>]] key hashtable''')''' value''')'''

<code>(SETHASH</code> key hashtable value''')'''

<code>(CSETF</code> ([[#FN-DEF-SYMBOL-VALUE|<code>SYMBOL-VALUE</code>]] symbol''')''' value''')'''

<code>(SET</code> symbol value''')'''

<code>(CSETF</code> (defstruct-slot object''')''' value''')'''

<code>(set-defstruct-slot object value)</code>

In the above table, '''defstruct-slot''' refers to any structure slot accessor function which got defined via defstruct, and '''set-defstruct-slot''' refers to the corresponding setter function for the given accessor. [[|]]

== 7.3 : Function Invocation ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node81.html CLtL2 Reference]

These functions behave like their Common Lisp counterparts. 
 
[[|]]function <code>APPLY : (function argument &rest arguments)</code> 
 
[[|]]function <code>FUNCALL : (function &rest args)</code>

The first argument to both [[#FN-DEF-APPLY|<code>APPLY</code>]] and [[#FN-DEF-FUNCALL|<code>FUNCALL</code>]] must satisfy [[#FN-DEF-FUNCTION-SPEC-P|<code>FUNCTION-SPEC-P</code>]]. [[|]]

== 7.4 : Simple Sequencing ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node82.html CLtL2 Reference] 
 
[[|]]macro <code>PROGN : (&body body)</code>

In SubL, [[#FN-DEF-PROGN|<code>PROGN</code>]] is procedural and therefore does not return a value. Since it is intended to be essentially procedural in Common Lisp as well, the same name is used even though they have slightly different semantics. [[|]]

== 7.5 : Establishing New Variable Bindings ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node83.html CLtL2 Reference] 
 
[[|]]macro <code>CLET : (bindings &body body)</code>

The SubL construct [[#FN-DEF-CLET|<code>CLET</code>]] can be used to introduce new local variables or bind special variables. The variables are initialized in order just like <code>LET*</code> in Common Lisp. Since it is procedural, it does not return a value.

SubL has no counterpart to Common Lisp's <code>LET</code> construct. 
 
[[|]]macro <code>CPROGV : (special-vars bindings &body body)</code>

[[#FN-DEF-CPROGV|<code>CPROGV</code>]] is procedural and therefore does not return a value. Otherwise, it is equivalent to <code>progv</code> in Common Lisp. [[|]]

== 7.6 : Conditionals ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node84.html CLtL2 Reference] 
 
[[|]]macro <code>PIF : (condition action else-action)</code> 
 
[[|]]macro <code>PWHEN : (condition &body body)</code> 
 
[[|]]macro <code>PUNLESS : (condition &body body)</code>

[[#FN-DEF-PIF|<code>PIF</code>]], [[#FN-DEF-PWHEN|<code>PWHEN</code>]] and [[#FN-DEF-PUNLESS|<code>PUNLESS</code>]] are the SubL procedural variants of <code>if</code>, <code>when</code> and <code>unless</code> from Common Lisp. For each, the condition argument must be a functional construct. Also, [[#FN-DEF-PIF|<code>PIF</code>]] takes exactly three arguments, making the action and else-actions identical in form. 
 
[[|]]macro <code>FIF : (condition true-value false-value)</code> 
 
[[|]]macro <code>FWHEN : (condition true-value)</code> 
 
[[|]]macro <code>FUNLESS : (condition false-value)</code>

[[#FN-DEF-FIF|<code>FIF</code>]], [[#FN-DEF-FWHEN|<code>FWHEN</code>]] and [[#FN-DEF-FUNLESS|<code>FUNLESS</code>]] are the SubL functional variants of <code>if</code>, <code>when</code> and <code>unless</code> from Common Lisp. 
 
[[|]]macro <code>PCOND : (&rest clauses)</code> 
 
[[|]]macro <code>PCASE : (test-object &body clauses)</code>

[[#FN-DEF-PCOND|<code>PCOND</code>]] and [[#FN-DEF-PCASE|<code>PCASE</code>]] are the SubL procedural equivalents of <code>cond</code> and <code>case</code> from Common Lisp. [[|]]

== 7.7 : Blocks and Exits ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node85.html CLtL2 Reference] 
 
[[|]]macro <code>RET : (expression)</code> 
SubL functions must always return a value, since C functions must return values and all SubL functions must translate into C.

[[#FN-DEF-RET|<code>RET</code>]] is used to return a value from a function or macro definition. All functions and macro definitions behave as if an implicit

<blockquote><pre>(ret nil)</pre></blockquote>
appears at the very end of each function. [[|]]

== 7.8.2 : General Iteration ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node88.html CLtL2 Reference] 
 
[[|]]macro <code>CDO : (vars endtest &body body)</code> 
cdo is procedural. It binds its variables in sequence, as with CommonLisp do* [[|]]

== 7.8.3 : Simple Iteration Constructs ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node89.html CLtL2 Reference] 
 
[[|]]macro <code>CDOLIST : ((var listform) &body body)</code> 
 
[[|]]macro <code>CSOME : ((var list endvar) &body body)</code> 
 
[[|]]macro <code>CDOTIMES : ((var integer) &body body)</code> 
 
[[|]]macro <code>CDOHASH : ((key val table) &body body)</code> [[|]]

== 7.8.4 : Mapping ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node90.html CLtL2 Reference] 
 
[[|]]function <code>MAPCAR : (function list &rest more-lists)</code> 
 
[[|]]function <code>MAPLIST : (function list &rest more-lists)</code> 
 
[[|]]function <code>MAPC : (function list &rest more-lists)</code> 
 
[[|]]function <code>MAPL : (function list &rest more-lists)</code> 
 
[[|]]function <code>MAPCAN : (function list &rest more-lists)</code> 
 
[[|]]function <code>MAPCON : (function list &rest more-lists)</code> [[|]]

== 7.10.1 : Constructs for Handling Multiple Values ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node94.html CLtL2 Reference] 
 
[[|]]function <code>VALUES : (value &rest more-values)</code> 
values returns its args such that they can be bound in a dynamically enclosing multiple-value-bind. The first value is returned as well, since all SubL functions must return a value. 
 
[[|]]variable <code>*MULTIPLE-VALUES-LIMIT*</code> 
 
[[|]]macro <code>MULTIPLE-VALUE-LIST : (form)</code> 
 
[[|]]macro <code>CMULTIPLE-VALUE-BIND : (vars value &body body)</code> [[|]]

== 7.10.2 : Rules Governing the Passing of Multiple Values ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node95.html CLtL2 Reference]

In SubL, multiple values are governed the same way that they are in Common Lisp, except that if ANY of the return statements in your function are (values ...) then all of them must be. [[|]]

== 7.11 : Dynamic Non-Local Exits ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node96.html CLtL2 Reference] 
 
[[|]]macro <code>CCATCH : (tag ans-var &body body)</code> 
ccatch is procedural, and so does not return values. 
 
[[|]]macro <code>CUNWIND-PROTECT : (protected-form &body body)</code> 
 
[[|]]function <code>THROW : (tag result)</code> [[|]]

-----

= 8 : Macros =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node97.html CLtL2 Reference] [[|]]

== 8.1 : Macro Definition ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node98.html CLtL2 Reference] 
 
[[|]]macro <code>DEFMACRO : (name pattern &body body)</code>

SubL Macros are expanded at translation-time. Full Common Lisp macro support is available. However, the macro-expander must use [[#FN-DEF-RET|<code>RET</code>]] to return the expansion. [[|]]

== 8.3 : Destructuring ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node100.html CLtL2 Reference] 
 
[[|]]macro <code>CDESTRUCTURING-BIND : (pattern datum &body body)</code> [[|]]

== 8.5 : Environments ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node102.html CLtL2 Reference] 
 
[[|]]function <code>VARIABLE-INFORMATION : (variable)</code> 
 
[[|]]function <code>FUNCTION-INFORMATION : (function)</code> [[|]]

-----

= 9 : Declarations =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node103.html CLtL2 Reference] [[|]]

== 9.1 : Declaration Syntax ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node104.html CLtL2 Reference] 
 
[[|]]function <code>DECLARE : (&rest ignore)</code> 
 
[[|]]function <code>PROCLAIM : (declaration-specifier)</code> 
 
[[|]]macro <code>DECLAIM : (&rest declaration-specifiers)</code> [[|]]

== 9.2 : Declaration Specifiers ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node105.html CLtL2 Reference] 
 
[[|]]function <code>IGNORE : (&rest values)</code>

The [[#FN-DEF-IGNORE|<code>IGNORE</code>]] function can be used to indicate that a particular variable's value is not used. [[|]]

-----

= 10 : Symbols =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node107.html CLtL2 Reference] 
 
[[|]]function <code>SYMBOLP : (x)</code> [[|]]

== 10.1 : The Property List ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node108.html CLtL2 Reference] 
 
[[|]]function <code>GET : (symbol indicator &optional default)</code> 
 
[[|]]function <code>PUT : (symbol indicator new-value)</code> 
 
[[|]]function <code>REMPROP : (symbol indicator)</code> 
 
[[|]]function <code>SYMBOL-PLIST : (symbol)</code> [[|]]

== 10.2 : The Print Name ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node109.html CLtL2 Reference] 
 
[[|]]function <code>SYMBOL-NAME : (symbol)</code> 
Returns the string which is the name of SYMBOL. When called on a keyword, it returns the ":" prefix as part of the name [[|]]

== 10.3 : Creating Symbols ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node110.html CLtL2 Reference] 
 
[[|]]function <code>MAKE-SYMBOL : (print-name)</code> 
 
[[|]]function <code>GENSYM : (&optional x)</code> 
GENSYM returns new, interned symbols, which are combinations of a string prefix and a numeric suffix. It guarantees that the new symbol was not previously interned. 
If the argument X is a number, the gensym counter (used to generate the suffix) is set to X before the new symbol is generated. 
if the argument X is a string, the gensym prefix is set to X before the new symbol is generated. 
The initial gensym counter value is 1 and the initial gensym prefix is 'G'. 
 
[[|]]function <code>GENTEMP : (&optional (prefix "T"))</code> 
 
[[|]]function <code>KEYWORDP : (x)</code> 
In SubL, which does not have packages, keywords are any symbol whose name begins with ":" [[|]]

-----

= 11 : Packages =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node111.html CLtL2 Reference] 
 
[[|]]macro <code>IN-PACKAGE : (name)</code> 
 
[[|]]function <code>INTERN : (string)</code> 
Finds and returns a symbol whose name is STRING. INTERN will create the symbol if it does not exist. Unlike Common LISP intern, the SubL version does not allow an argument to specify the package, since SubL does not support packages. 
 
[[|]]function <code>FIND-SYMBOL : (string)</code> 
Finds and returns a symbol whose name is STRING. Unlike Common LISP FIND-SYMBOL, the SubL version does not allow an argument to specify the package, since SubL does not support packages. [[|]]

-----

= 12 : Numbers =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node121.html CLtL2 Reference]

SubL only supports fixnums and floats. Fixnums have at least 28 bits of precision. 
 
[[|]]function <code>NUMBERP : (x)</code> 
 
[[|]]function <code>FIXNUMP : (x)</code> 
 
[[|]]function <code>INTEGERP : (x)</code> 
 
[[|]]function <code>FLOATP : (x)</code> [[|]]

== 12.2 : Predicates on Numbers ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node123.html CLtL2 Reference] 
 
[[|]]function <code>ZEROP : (x)</code> 
 
[[|]]function <code>PLUSP : (x)</code> 
 
[[|]]function <code>MINUSP : (x)</code> 
 
[[|]]function <code>ODDP : (x)</code> 
 
[[|]]function <code>EVENP : (x)</code> [[|]]

== 12.3 : Comparisons on Numbers ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node124.html CLtL2 Reference] 
 
[[|]]function <code>= : (num1 num2)</code> 
 
[[|]]function <code>/= : (num1 num2)</code> 
 
[[|]]function <code>< : (num1 num2)</code> 
 
[[|]]function <code>> : (num1 num2)</code> 
 
[[|]]function <code><= : (num1 num2)</code> 
 
[[|]]function <code>>= : (num1 num2)</code>

The above numeric comparison functions take exactly 2 arguments, unlike their Common Lisp counterparts which take variable numbers of arguments. 
 
[[|]]function <code>MAX : (num &rest numbers)</code> 
 
[[|]]function <code>MIN : (num &rest numbers)</code> [[|]]

== 12.4 : Arithmetic Operations ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node125.html CLtL2 Reference] 
 
[[|]]function <code>+ : (&rest numbers)</code> 
 
[[|]]function <code>- : (num &rest numbers)</code> 
 
[[|]]function <code>* : (&rest numbers)</code> 
 
[[|]]function <code>/ : (num &rest numbers)</code> 
 
[[|]]function <code>INT/ : (num1 num2)</code> 
 
[[|]]macro <code>CINC : (place &optional (delta 1))</code> 
 
[[|]]macro <code>CDEC : (place &optional (delta 1))</code> [[|]]

== 12.5 : Irrational and Transcendental Functions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node126.html CLtL2 Reference]

SubL does not currently support any irrational, transcendental or trigonometric functions. [[|]]

== 12.6 : Type Conversions and Component Extractions on Numbers ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node130.html CLtL2 Reference] 
 
[[|]]function <code>FLOAT : (x)</code> 
 
[[|]]function <code>FLOOR : (x)</code> 
 
[[|]]function <code>CEILING : (x)</code> 
 
[[|]]function <code>TRUNCATE : (x)</code> 
 
[[|]]function <code>ROUND : (x)</code> 
 
[[|]]function <code>MOD : (number divisor)</code> 
 
[[|]]function <code>REM : (number divisor)</code> 
 
[[|]]function <code>SCALE-FLOAT : (float integer)</code> 
 
[[|]]function <code>INTEGER-DECODE-FLOAT : (float)</code> [[|]]

== 12.7 : Logical Operations on Numbers ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node131.html CLtL2 Reference]

SubL does not currently support any logical operations on numbers. [[|]]

== 12.8 : Byte Manipulation Functions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node132.html CLtL2 Reference] 
 
[[|]]macro <code>BYTE : (size position)</code> 
 
[[|]]function <code>LDB : (bytespec integer)</code> 
 
[[|]]function <code>DPB : (newbyte bytespec integer)</code> [[|]]

== 12.9 : Random Numbers ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node133.html CLtL2 Reference] 
 
[[|]]variable <code>*RAND-MAX*</code> 
*rand-max* is the largest fixnum that the function random can accept. 
 
[[|]]function <code>SEED-RANDOM : (&optional (seed-fixnum (mod (get-internal-real-time) *rand-max*)))</code> 
If seed-fixnum is omitted to seed-random, the internal clock is used 
in an implementation specific manner. 
 
[[|]]function <code>RANDOM : (number)</code> [[|]]

== 12.10 : Implementation Parameters ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node134.html CLtL2 Reference] 
 
[[|]]variable <code>*MOST-POSITIVE-FIXNUM*</code> 
 
[[|]]variable <code>*MOST-NEGATIVE-FIXNUM*</code> [[|]]

-----

= 13 : Characters =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node135.html CLtL2 Reference] 
 
[[|]]function <code>CHARACTERP : (x)</code> [[|]]

== 13.1 : Character Attributes ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node136.html CLtL2 Reference]

SubL does not currently support any attributes for characters. A character exists for each ASCII character code between 0 and 255 inclusive. Thus, the SubL equivalent of Common Lisp's <code>CHAR-CODE-LIMIT</code> is 256. [[|]]

== 13.2 : Predicates on Characters ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node137.html CLtL2 Reference] 
 
[[|]]function <code>ALPHA-CHAR-P : (char)</code> 
 
[[|]]function <code>UPPER-CASE-P : (char)</code> 
 
[[|]]function <code>LOWER-CASE-P : (char)</code> 
 
[[|]]function <code>BOTH-CASE-P : (char)</code> 
 
[[|]]function <code>DIGIT-CHAR-P : (char)</code> 
 
[[|]]function <code>ALPHANUMERICP : (char)</code> 
 
[[|]]function <code>CHAR= : (char1 char2)</code> 
 
[[|]]function <code>CHAR/= : (char1 char2)</code> 
 
[[|]]function <code>CHAR< : (char1 char2)</code> 
 
[[|]]function <code>CHAR> : (char1 char2)</code> 
 
[[|]]function <code>CHAR<= : (char1 char2)</code> 
 
[[|]]function <code>CHAR>= : (char1 char2)</code> 
 
[[|]]function <code>CHAR-EQUAL : (char1 char2)</code> 
 
[[|]]function <code>CHAR-NOT-EQUAL : (char1 char2)</code> 
 
[[|]]function <code>CHAR-LESSP : (char1 char2)</code> 
 
[[|]]function <code>CHAR-GREATERP : (char1 char2)</code> 
 
[[|]]function <code>CHAR-NOT-GREATERP : (char1 char2)</code> 
 
[[|]]function <code>CHAR-NOT-LESSP : (char1 char2)</code> [[|]]

== 13.3 : Character Construction and Selection ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node138.html CLtL2 Reference] 
 
[[|]]function <code>CHAR-CODE : (char)</code> 
 
[[|]]function <code>CODE-CHAR : (code)</code> [[|]]

== 13.4 : Character Conversions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node139.html CLtL2 Reference] 
 
[[|]]function <code>CHAR-DOWNCASE : (char)</code> 
 
[[|]]function <code>CHAR-UPCASE : (char)</code> [[|]]

-----

= 14 : Sequences =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node141.html CLtL2 Reference] 
 
[[|]]function <code>SEQUENCEP : (x)</code> [[|]]

== 14.1 : Simple Sequence Functions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node142.html CLtL2 Reference] 
 
[[|]]function <code>ELT : (sequence index)</code> 
 
[[|]]function <code>SUBSEQ : (sequence start &optional end)</code> 
 
[[|]]function <code>COPY-SEQ : (sequence)</code> 
 
[[|]]function <code>LENGTH : (sequence)</code> 
 
[[|]]function <code>REVERSE : (sequence)</code> 
 
[[|]]function <code>NREVERSE : (sequence)</code> [[|]]

== 14.2 : Concatenating, Mapping and Reducing Sequences ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node143.html CLtL2 Reference] 
 
[[|]]function <code>CCONCATENATE : (seq &rest more-seqs)</code> 
 
[[|]]function <code>CREDUCE : (function sequence &optional (start 0) end (init-value :none))</code> [[|]]

== 14.3 : Modifying Sequences ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node144.html CLtL2 Reference] 
 
[[|]]function <code>FILL : (sequence item &optional (start 0) (end (length sequence)))</code> 
 
[[|]]function <code>REPLACE : (sequence1 sequence2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>REMOVE : (item sequence &optional (test #'eql) (key #'identity) (start 0) end count)</code> 
 
[[|]]function <code>REMOVE-IF : (test sequence &optional (key #'identity) (start 0) end count)</code> 
 
[[|]]function <code>DELETE : (item sequence &optional (test #'eql) (key #'identity) (start 0) end count)</code> 
 
[[|]]function <code>DELETE-IF : (test sequence &optional (key #'identity) (start 0) end count)</code> 
 
[[|]]function <code>REMOVE-DUPLICATES : (sequence &optional (test #'eql) (key #'identity) (start 0) end)</code> 
 
[[|]]function <code>DELETE-DUPLICATES : (sequence &optional (test #'eql) (key #'identity) (start 0) end)</code> 
 
[[|]]function <code>SUBSTITUTE : (new old sequence &optional (test #'eql) (key #'identity) (start 0) end count)</code> 
 
[[|]]function <code>SUBSTITUTE-IF : (new test sequence &optional (key #'identity) (start 0) end count)</code> 
 
[[|]]function <code>NSUBSTITUTE : (new old sequence &optional (test #'eql) (key #'identity) (start 0) end count)</code> 
 
[[|]]function <code>NSUBSTITUTE-IF : (new test sequence &optional (key #'identity) (start 0) end count)</code> [[|]]

== 14.4 : Searching Sequences for Terms ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node145.html CLtL2 Reference] 
 
[[|]]function <code>FIND : (item seq &optional (test #'eql) (key #'identity) (start 0) end)</code> 
 
[[|]]function <code>FIND-IF : (test seq &optional (key #'identity) (start 0) end)</code> 
 
[[|]]function <code>POSITION : (item seq &optional (test #'eql) (key #'identity) (start 0) end)</code> 
 
[[|]]function <code>POSITION-IF : (test seq &optional (key #'identity) (start 0) end)</code> 
 
[[|]]function <code>COUNT : (item seq &optional (test #'eql) (key #'identity) (start 0) end)</code> 
 
[[|]]function <code>COUNT-IF : (test seq &optional (key #'identity) (start 0) end)</code> 
 
[[|]]function <code>MISMATCH : (seq1 seq2 &optional (test #'eql) (key #'identity) (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>SEARCH : (seq1 seq2 &optional (test #'eql) (key #'identity) (start1 0) end1 (start2 0) end2)</code> [[|]]

== 14.5 : Sorting and Merging ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node146.html CLtL2 Reference] 
 
[[|]]function <code>SORT : (seq predicate &optional (key #'identity))</code> 
 
[[|]]function <code>STABLE-SORT : (seq predicate &optional (key #'identity))</code> 
 
[[|]]function <code>CMERGE : (seq1 seq2 predicate &optional (key #'identity))</code> [[|]]

-----

= 15 : Lists =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node147.html CLtL2 Reference] 
 
[[|]]function <code>LISTP : (x)</code> 
 
[[|]]function <code>CONSP : (x)</code> 
 
[[|]]function <code>ATOM : (x)</code> [[|]]

== 15.1 : Conses ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node148.html CLtL2 Reference] 
 
[[|]]function <code>CAR : (cons)</code> 
 
[[|]]function <code>CDR : (cons)</code> 
 
[[|]]function <code>CAAR : (cons)</code> 
 
[[|]]function <code>CADR : (cons)</code> 
 
[[|]]function <code>CDAR : (cons)</code> 
 
[[|]]function <code>CDDR : (cons)</code> 
 
[[|]]function <code>CONS : (car cdr)</code> 
 
[[|]]function <code>TREE-EQUAL : (tree1 tree2 &optional (test #'eql))</code> [[|]]

== 15.2 : Lists ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node149.html CLtL2 Reference] 
 
[[|]]function <code>ENDP : (object)</code> 
 
[[|]]function <code>LIST-LENGTH : (list)</code> 
 
[[|]]function <code>NTH : (n list)</code> 
 
[[|]]function <code>FIRST : (list)</code> 
 
[[|]]function <code>SECOND : (list)</code> 
 
[[|]]function <code>THIRD : (list)</code> 
 
[[|]]function <code>FOURTH : (list)</code> 
 
[[|]]function <code>FIFTH : (list)</code> 
 
[[|]]function <code>SIXTH : (list)</code> 
 
[[|]]function <code>SEVENTH : (list)</code> 
 
[[|]]function <code>EIGHTH : (list)</code> 
 
[[|]]function <code>NINTH : (list)</code> 
 
[[|]]function <code>TENTH : (list)</code> 
 
[[|]]function <code>REST : (list)</code> 
 
[[|]]function <code>NTHCDR : (n list)</code> 
 
[[|]]function <code>LAST : (list &optional (n 1))</code> 
 
[[|]]function <code>LIST : (&rest objects)</code> 
 
[[|]]function <code>LIST* : (arg &rest objects)</code> 
 
[[|]]function <code>MAKE-LIST : (size &optional initial-element)</code> 
 
[[|]]function <code>APPEND : (&rest lists)</code> 
 
[[|]]function <code>COPY-LIST : (list)</code> 
 
[[|]]function <code>COPY-ALIST : (list)</code> 
 
[[|]]function <code>COPY-TREE : (tree)</code> 
 
[[|]]function <code>REVAPPEND : (list1 list2)</code> 
 
[[|]]function <code>NCONC : (&rest lists)</code> 
 
[[|]]function <code>NRECONC : (list1 list2)</code> 
 
[[|]]macro <code>CPUSH : (item place)</code> 
 
[[|]]macro <code>CPUSHNEW : (item place &optional (test '#'eql) (key '#'identity))</code> 
 
[[|]]macro <code>CPOP : (place)</code> 
 
[[|]]function <code>BUTLAST : (list &optional (n 1))</code> 
 
[[|]]function <code>NBUTLAST : (list &optional (n 1))</code> 
 
[[|]]function <code>LDIFF : (list sublist)</code> [[|]]

== 15.3 : Alteration of List Structure ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node150.html CLtL2 Reference] 
 
[[|]]function <code>RPLACA : (cons newcar)</code> 
 
[[|]]function <code>RPLACD : (cons newcdr)</code> 
 
[[|]]function <code>SET-NTH : (n list value)</code> [[|]]

== 15.4 : Substitution of Expressions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node151.html CLtL2 Reference] 
 
[[|]]function <code>SUBST : (new old tree &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>SUBST-IF : (new test tree &optional (key #'identity))</code> 
 
[[|]]function <code>NSUBST : (new old tree &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>NSUBST-IF : (new test tree &optional (key #'identity))</code> 
 
[[|]]function <code>SUBLIS : (alist tree &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>NSUBLIS : (alist tree &optional (test #'eql) (key #'identity))</code> [[|]]

== 15.5 : Using Lists as Sets ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node152.html CLtL2 Reference] 
 
[[|]]function <code>MEMBER : (item list &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>MEMBER-IF : (test list &optional (key #'identity))</code> 
 
[[|]]function <code>TAILP : (sublist list)</code> 
 
[[|]]function <code>ADJOIN : (item list &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>UNION : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>NUNION : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>INTERSECTION : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>NINTERSECTION : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>SET-DIFFERENCE : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>NSET-DIFFERENCE : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>SET-EXCLUSIVE-OR : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>NSET-EXCLUSIVE-OR : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>SUBSETP : (list1 list2 &optional (test #'eql) (key #'identity))</code> [[|]]

== 15.6 : Association Lists ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node153.html CLtL2 Reference] 
 
[[|]]function <code>ACONS : (key datum alist)</code> 
 
[[|]]function <code>PAIRLIS : (keys data &optional alist)</code> 
 
[[|]]function <code>ASSOC : (item alist &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>ASSOC-IF : (predicate alist)</code> 
 
[[|]]function <code>RASSOC : (item alist &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>RASSOC-IF : (predicate alist)</code> [[|]]

-----

= 16 : Hash Tables =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node154.html CLtL2 Reference]

[[|]]

== 16.1 : Hash Table Functions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node155.html CLtL2 Reference] 
 
[[|]]function <code>MAKE-HASH-TABLE : (size &optional (test #'eql) (area default-cons-area))</code> 
 
[[|]]function <code>HASH-TABLE-P : (x)</code> 
 
[[|]]function <code>GETHASH : (key table &optional default)</code> 
 
[[|]]function <code>SETHASH : (key table value)</code> 
 
[[|]]function <code>REMHASH : (key table)</code> 
 
[[|]]function <code>MAPHASH : (function table)</code> 
 
[[|]]function <code>CLRHASH : (table)</code> 
 
[[|]]function <code>HASH-TABLE-COUNT : (table)</code> [[|]]

== 16.2 : Primitive Hash Function ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node156.html CLtL2 Reference] 
 
[[|]]function <code>SXHASH : (object)</code> [[|]]

-----

= 17 : Arrays =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node157.html CLtL2 Reference]

SubL only supports one-dimensional arrays, which are called vectors. 
 
[[|]]function <code>VECTORP : (x)</code> [[|]]

== 17.1 : Vector Creation ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node158.html CLtL2 Reference] 
 
[[|]]function <code>MAKE-VECTOR : (size &optional initial-element)</code> 
 
[[|]]function <code>VECTOR : (&rest objects)</code> [[|]]

== 17.2 : Vector Access ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node159.html CLtL2 Reference] 
 
[[|]]function <code>AREF : (vector index)</code> 
 
[[|]]function <code>SET-AREF : (vector index value)</code> [[|]]

-----

= 18 : Strings =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node164.html CLtL2 Reference] 
 
[[|]]function <code>STRINGP : (x)</code> [[|]]

== 18.1 : String Access ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node165.html CLtL2 Reference] 
 
[[|]]function <code>CHAR : (string index)</code> 
 
[[|]]function <code>SET-CHAR : (string index value)</code> [[|]]

== 18.2 : String Comparison ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node166.html CLtL2 Reference] 
 
[[|]]function <code>STRING= : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING-EQUAL : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING< : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING> : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING<= : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING>= : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING/= : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING-LESSP : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING-GREATERP : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING-NOT-GREATERP : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING-NOT-LESSP : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING-NOT-EQUAL : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> [[|]]

== 18.3 : String Construction and Manipulation ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node167.html CLtL2 Reference] 
 
[[|]]function <code>MAKE-STRING : (size &optional (initial-element #\Space))</code> 
 
[[|]]function <code>STRING-TRIM : (char-list string)</code> 
 
[[|]]function <code>STRING-LEFT-TRIM : (char-list string)</code> 
 
[[|]]function <code>STRING-RIGHT-TRIM : (char-list string)</code> 
 
[[|]]function <code>STRING-UPCASE : (string &optional (start 0) end)</code> 
 
[[|]]function <code>STRING-DOWNCASE : (string &optional (start 0) end)</code> 
 
[[|]]function <code>STRING-CAPITALIZE : (string &optional (start 0) end)</code> 
 
[[|]]function <code>NSTRING-UPCASE : (string &optional (start 0) end)</code> 
 
[[|]]function <code>NSTRING-DOWNCASE : (string &optional (start 0) end)</code> 
 
[[|]]function <code>NSTRING-CAPITALIZE : (string &optional (start 0) end)</code> 
 
[[|]]function <code>STRING : (x)</code> [[|]]

-----

= 19 : Structures =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node168.html CLtL2 Reference] 
 
[[|]]macro <code>DEFSTRUCT : ((name &rest options) &body slots)</code> 
Like Common Lisp defstruct except: 
(1) slot initializations are not allowed.

(2) the only other options: 
(:conc-name whatever) 
(:print-function #'whatever)

the default structure print function is 
default-struct-print-function : object stream depth

(3) The make constructor takes no arguments and only makes an empty structure.

(4) Reading of structures is not supported by the reader. 
 
[[|]]function <code>DEFAULT-STRUCT-PRINT-FUNCTION : (object stream depth)</code> 
 
[[|]]macro <code>PRINTING-OBJECT : ((object stream) &body body)</code> [[|]]

-----

= 20 : The Evaluator =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node179.html CLtL2 Reference]

[[|]]

== 20.1 : Run-Time Evaluation of Forms ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node180.html CLtL2 Reference] 
 
[[|]]function <code>EVAL : (form)</code> 
 
[[|]]function <code>CONSTANTP : (object &optional env)</code>

The Common Lisp functions <code>evalhook</code> and <code>applyhook</code> are not supported in SubL. [[|]]

== 20.2 : The Top-Level Loop ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node181.html CLtL2 Reference] 
 
[[|]]variable <code>*</code> 
 
[[|]]variable <code>**</code> 
 
[[|]]variable <code>***</code>

For convenience, the top-level readloop binds the following variables after each form is evaluated:

<blockquote><pre>* the last value returned
** the previous value of *
*** the previous value of **</pre></blockquote>
[[|]]

-----

= 21 : Streams =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node182.html CLtL2 Reference] 
 
[[|]]function <code>STREAMP : (x)</code> [[|]]

== 21.1 : Standard Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node183.html CLtL2 Reference] 
 
[[|]]variable <code>*STANDARD-INPUT*</code> 
 
[[|]]variable <code>*STANDARD-OUTPUT*</code> 
 
[[|]]variable <code>*ERROR-OUTPUT*</code> 
 
[[|]]variable <code>*NULL-OUTPUT*</code> 
A bit-sink output stream. All output is ignored

The other standard streams supported by Common Lisp are not supported by SubL. [[|]]

== 21.2 : Creating new Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node184.html CLtL2 Reference] 
 
[[|]]function <code>OPEN-TCP-STREAM : (host port)</code> [[|]]

== 21.3 : Operations on Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node185.html CLtL2 Reference] 
 
[[|]]function <code>STREAMP : (x)</code> 
 
[[|]]function <code>INPUT-STREAM-P : (object)</code> 
 
[[|]]function <code>OUTPUT-STREAM-P : (object)</code> 
 
[[|]]function <code>CLOSE : (stream)</code> [[|]]

-----

= 22 : Input/Output =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node186.html CLtL2 Reference] [[|]]

== 22.1 : Printed Representation of SubL Objects ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node187.html CLtL2 Reference] [[|]]

== 22.1.3 : Macro Characters ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node190.html CLtL2 Reference]

The SubL reader supports the following macro characters, whose meaning is identical to their meaning in Common Lisp :

<blockquote>'''Macro Character''' Â Â Â '''Reader Action'''

-----

<code>(</code> Begin reading a list. <code>)</code> End reading a list or a vector. <code>'</code> Read in a quoted expression. <code>;</code> Read a comment until end-of-line. <code>"</code> Begin or end reading a string. <code>`</code> Read in a backquoted expression.
</blockquote>
In addition, the following comma-readers are supported inside of backquote :

<blockquote><pre>,
,@
,.</pre></blockquote>
Their behavior is identical to their Common Lisp counterparts. [[|]]

== 22.1.4 : Standard Dispatching Macro Character Syntax ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node191.html CLtL2 Reference]

'''<code>'#'</code>''' is the SubL standard dispatching macro character. The SubL reader supports the following dispatch macro character sequences, whose meanings are identical to their meanings in Common Lisp :

<blockquote>'''Dispatch Sequence''' Â Â Â '''Reader Action'''

-----

<code>#\(</code> Read a character constant. <code>#'</code> Read a function constant. <code>#(</code> Begin reading a vector. <code>#|</code> Begin reading a comment section. <code>|#</code> End reading a comment section.
</blockquote>
Additionally, SubL supports the dispatch sequence '''<code>#$</code>''' as follows :

<blockquote><code>#$foo</code> reads the Cyc constant whose name is <code>"foo"</code>
</blockquote>
[[|]]

== 22.1.5 : The Readtable ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node192.html CLtL2 Reference]

SubL internally uses a readtable, but it is not visible to the programmer. [[|]]

== 22.1.6 : What the Print Function Produces ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node193.html CLtL2 Reference] 
 
[[|]]variable <code>*PRINT-ESCAPE*</code> [[|]]

== 22.2.1 : Input from Character Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node195.html CLtL2 Reference] 
 
[[|]]function <code>READ : (&optional (stream *standard-input*) (eof-error-p t) (eof-value :eof))</code> 
Returns FORM if read was successful. 
Returns the values NIL :ERROR if there was a reader error. 
Returns the values EOF-VALUE :ERROR if EOF-ERROR-P is nil and EOF occurs. 
Causes an error if EOF-ERROR-P is not nil and EOF occurs.

Differences from Common Lisp: 
<code>`Numbers are only read in decimal notation with no specified radix.\</code> <code>No character modifiers: only standard chars plus specials like Space, Return etc.\</code> <code>The || notation and \\ syntax for symbols are not supported.\ \ []()function</code>READ-LINE : (&optional (stream ''standard-input'') (eof-error-p t) (eof-value :eof))<code>\ \ []()function</code>READ-CHAR : (&optional (stream ''standard-input'') (eof-error-p t) (eof-value :eof))<code>\ \ []()function</code>UNREAD-CHAR : (char &optional (stream ''standard-input''))<code>\ \ []()function</code>READ-FROM-STRING : (string &optional (eof-error-p t) (eof-value :eof) (start 0) end)` 
Returns the values FORM NEW-START if read was successful. 
Returns the values NIL :ERROR if there was a reader error. 
Returns the values EOF-VALUE :ERROR if EOF-ERROR-P is nil and EOF occurs. 
Causes an error if EOF-ERROR-P is not nil and EOF occurs. 
Returns a second value which is an integer indicating the position in the string to 
start reading from again or :ERROR if there was some kind of reader error. [[|]]

== 22.2.2 : Input from Binary Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node196.html CLtL2 Reference] 
 
[[|]]function <code>READ-BYTE : (stream &optional (eof-error-p t) (eof-value :eof))</code> [[|]]

== 22.3.1 : Output to Character Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node198.html CLtL2 Reference] 
 
[[|]]function <code>WRITE : (object &optional (stream *standard-output*) (escape *print-escape*))</code> 
 
[[|]]function <code>PRIN1 : (object &optional (stream *standard-output*))</code> 
 
[[|]]function <code>PRINT : (object &optional (stream *standard-output*))</code> 
 
[[|]]function <code>PRINC : (object &optional (stream *standard-output*))</code> 
 
[[|]]function <code>WRITE-TO-STRING : (object &optional (escape *print-escape*))</code> 
 
[[|]]function <code>PRIN1-TO-STRING : (object)</code> 
 
[[|]]function <code>PRINC-TO-STRING : (object)</code> 
 
[[|]]function <code>WRITE-CHAR : (char &optional (stream *standard-output*))</code> 
 
[[|]]function <code>WRITE-STRING : (string &optional (stream *standard-output*) (start 0) end)</code> 
 
[[|]]function <code>WRITE-LINE : (string &optional (stream *standard-output*) (start 0) end)</code> 
 
[[|]]function <code>TERPRI : (&optional (stream *standard-output*))</code> 
 
[[|]]function <code>FORCE-OUTPUT : (&optional (stream *standard-output*))</code> [[|]]

== 22.3.2 : Output to Binary Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node199.html CLtL2 Reference] 
 
[[|]]function <code>WRITE-BYTE : (integer stream)</code> [[|]]

== 22.3.3 : Formatted Output to Character Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node200.html CLtL2 Reference] 
 
[[|]]function <code>FORMAT : (destination control-string &rest arguments)</code> 
Format ARGUMENTS to the text stream DESTINATION according to the specifications in CONTROL-STRING. SubL format is more limited than the Common Lisp version: the only escapes allowed in the control string are: ~A ~a ~S ~s ~D ~d (with width and pad parameters optional) ~C ~c ~G ~g ~% ~~ [[|]]

-----

= 23 : File System Interface =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node202.html CLtL2 Reference] [[|]]

== 23.1 : File Names ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node203.html CLtL2 Reference] 
 
[[|]]variable <code>*DEFAULT-PATHNAME-DEFAULTS*</code> 
 
[[|]]function <code>CONSTRUCT-FILENAME : (directory-list filename &optional extension relative?)</code>

Pathnames are just strings in SubL. Common Lisp pathname objects are not supported. [[|]]

== 23.2 : Opening and Closing Files ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node215.html CLtL2 Reference] 
 
[[|]]function <code>OPEN-TEXT : (filename direction)</code> 
Attempts to open the file FILENAME. If successful, returns an 8-bit character text stream. If DIRECTION is :input, then input operations can be performed on the stream. If DIRECTION is output, then output is directed to the file FILENAME, overwriting any existing file. If DIRECTION is :append, then output is appended to the file. For either output case, a new file is created if no file named FILENAME already exists. 
 
[[|]]function <code>OPEN-BINARY : (filename direction)</code> 
Attempts to open the file FILENAME. If successful, returns an 8-bit binary byte stream. If DIRECTION is :input, then input operations can be performed on the stream. If DIRECTION is output, then output is directed to the file FILENAME, overwriting any existing file. If DIRECTION is :append, then output is appended to the file. For either output case, a new file is created if no file named FILENAME already exists. 
 
[[|]]macro <code>WITH-TEXT-FILE : ((stream filestring direction) &body body)</code> 
In the scope of a WITH-TEXT-FILE expression, the file FILESTRING is opened for character i/o and a stream to this file is created and bound to the variable STREAM. If DIRECTION is :input, then input operations can be performed on STREAM. If DIRECTION is :output, then output operations can be performed, overwriting any existing file. If DIRECTION is :append, then output is appended to an existing file. 
 
[[|]]macro <code>WITH-BINARY-FILE : ((stream filestring direction) &body body)</code> 
In the scope of a WITH-BINARY-FILE expression, the file FILESTRING is opened for binary i/o and a stream to this file is created and bound to the variable STREAM. If DIRECTION is :input, then input operations can be performed on STREAM. If DIRECTION is :output, then output operations can be performed, overwriting any existing file. If DIRECTION is :append, then output is appended to an existing file. [[|]]

== 23.3 : Renaming, Deleting and Other File Operations ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node216.html CLtL2 Reference] 
 
[[|]]function <code>RENAME-FILE : (filename new-name)</code> 
 
[[|]]function <code>DELETE-FILE : (filename)</code> 
 
[[|]]function <code>PROBE-FILE : (filename)</code> 
 
[[|]]function <code>APPEND-FILES : (filename-1 filename-2 &optional (mode :text))</code> 
Append filename-1 to filename-2 
 
[[|]]function <code>FILE-WRITE-DATE : (filename)</code> 
 
[[|]]function <code>FILE-AUTHOR : (filename)</code> 
 
[[|]]function <code>GET-FILE-POSITION : (stream)</code> 
 
[[|]]function <code>SET-FILE-POSITION : (stream n)</code> 
 
[[|]]function <code>FILE-LENGTH : (stream)</code> [[|]]

== 23.4 : Loading Files ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node217.html CLtL2 Reference] 
 
[[|]]function <code>LOAD : (filename)</code> [[|]]

== 23.5 : Accessing Directories ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node218.html CLtL2 Reference] 
 
[[|]]function <code>DIRECTORY : (directory-name &optional include-directory)</code> [[|]]

-----

= 24 : Errors =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node219.html CLtL2 Reference] [[|]]

== 24.1 : General Error-Signalling Functions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node220.html CLtL2 Reference] 
 
[[|]]variable <code>*ERROR-ABORT-HANDLER*</code> 
If *error-abort-handler* is non-nil, then an ABORT option is available inside ERROR and CERROR. 
If chosen, then the handler is funcalled on no arguments. 
 
[[|]]variable <code>*ERROR-HANDLER*</code> 
If *ERROR-SIGNAL* is non-nil, then that function is called upon an error. Otherwise, the debugger is invoked. 
 
[[|]]variable <code>*ERROR-MESSAGE*</code> 
 
[[|]]function <code>ERROR : (format-string &rest arguments)</code> 
 
[[|]]variable <code>*CONTINUE-CERROR?*</code> 
 
[[|]]function <code>CERROR : (continue-string format-string &rest arguments)</code> 
 
[[|]]variable <code>*IGNORE-WARNS?*</code> 
If T, all warnings forms are ignored 
 
[[|]]function <code>WARN : (format-string &rest arguments)</code> 
 
[[|]]variable <code>*IGNORE-BREAKS?*</code> 
If non-NIL, all break forms are ignored 
 
[[|]]function <code>BREAK : (format-string &rest arguments)</code> [[|]]

== 24.2 : Specialized Error-Signalling Forms and Macros ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node221.html CLtL2 Reference] 
 
[[|]]variable <code>*IGNORE-MUSTS?*</code> 
If non-NIL, all must forms are ignored 
 
[[|]]macro <code>MUST : (form format-string &rest arguments)</code> 
 
[[|]]variable <code>*SUSPEND-TYPE-CHECKING?*</code> 
CHECK-TYPE tests are performed iff this is non-nil 
 
[[|]]macro <code>CHECK-TYPE : (object pred)</code> [[|]]

-----

= 25 : Miscellaneous Features =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node223.html CLtL2 Reference] [[|]]

== 25.1 : The Compiler ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node224.html CLtL2 Reference]

SubL currently does not provide any compilation support. [[|]]

== 25.3 : Debugging Tools ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node230.html CLtL2 Reference] 
 
[[|]]macro <code>CTIME : (var &body body)</code> 
 
[[|]]function <code>DEBUG : ()</code> 
Pauses execution and invokes the debugger. [[|]]

== 25.4.1 : Time Functions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node232.html CLtL2 Reference] 
 
[[|]]variable <code>*EPOCH*</code> 
*epoch* is the current epoch in use, which is a universal time. 
The system needs to at least be able to handle epochs back to midnight Jan 1 1970. 
*epoch* is globally initialized to midnight Jan 1 1970. 
All universal times are relative to *epoch*. 
 
[[|]]function <code>GET-UNIVERSAL-TIME : ()</code> 
 
[[|]]function <code>DECODE-UNIVERSAL-TIME : (universal-time)</code> 
 
[[|]]function <code>ENCODE-UNIVERSAL-TIME : (second minute hour date month year)</code> 
 
[[|]]function <code>TIME-FROM-NOW : (delta)</code> 
 
[[|]]function <code>TIME-HAS-ARRIVED? : (time)</code> 
 
[[|]]function <code>ENCODE-TIMESTRING : (second minute hour date month year)</code> 
 
[[|]]function <code>TIMESTRING : (&optional (universal-time (get-universal-time)))</code> 
timestring returns a string in the format dd/mm/yy hh:mm:ss from the 
universal time given. If none is given, the current time is used. 
 
[[|]]variable <code>*CLOCK-GRANULARITY*</code> 
*clock-granularity* is the number of internal clock units per second. 
time evals form and returns the number of internal clock units it took 
to execute. 
 
[[|]]function <code>GET-INTERNAL-REAL-TIME : ()</code> 
 
[[|]]function <code>SLEEP : (seconds)</code> [[|]]

== 25.5 : Identity Function ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node234.html CLtL2 Reference] 
 
[[|]]function <code>IDENTITY : (object)</code> [[|]]

-----

= 28 : Common Lisp Object System =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node260.html CLtL2 Reference] 
 
[[|]]macro <code>DEFPOLYMORPHIC : (name lambda-list &body body)</code> 
Defines a new polymorphic function that dispatches on the type of its first argument. <body> defines a default method. The function define-method can be used to define additional methods. For example:

(defpolymorphic test (a b) 
` `(list a b))

(define-method test ((a cons) b) 
` `(cons b a))

(define-method test ((a fixnum) b) 
` `(+ a b))

The defpolymorphic form defines the function TEST with a default method. 
` `The two define-method forms specialize the behavior of TEST for lists and fixnums.

(test 'foo 'bar) => (FOO BAR) 
<code>`(test '(foo) 'bar) =&gt; (BAR FOO)\</code> <code>(test 2 3) =&gt; 5\ \ []()macro</code>DEFINE-METHOD : (name lambda-list &body body)` 
Defines a method for the polymorphic function <name> that runs if 
<dispatch-arg> is of type <type>. The lambda list must have the same 
structure as in the DEFPOLYMORPHIC call. [[|]]

-----

= SubL-Specific Features =

[[|]] '''SubL.1 : Signals''' 
 
[[|]]variable <code>*SIGNAL-MAX*</code> 
There are *signal-max* total signals available. 
 
[[|]]function <code>DEFAULT-SIGNAL-HANDLER : (signal)</code> 
 
[[|]]function <code>INSTALL-SIGNAL-HANDLER : (signal function)</code> 
[[|]] '''SubL.2 : System Properties''' 
 
[[|]]function <code>GET-PROCESS-ID : (&optional default)</code> 
Return the current heavyweight process id of this current SubL 
program. Return DEFAULT if this cannot be determined. 
 
[[|]]function <code>GET-MACHINE-NAME : (&optional default)</code> 
 
[[|]]function <code>GET-NETWORK-NAME : (&optional default)</code> 
 
[[|]]function <code>GET-USER-NAME : (&optional default)</code> 
[[|]] '''SubL.3 : Progress Pacifiers''' 
 
[[|]]variable <code>*SILENT-PROGRESS?*</code> 
 
[[|]]macro <code>NOTING-ACTIVITY : (string &body body)</code> 
 
[[|]]function <code>NOTE-ACTIVITY : ()</code> 
 
[[|]]macro <code>NOTING-NUMERIC-PROGRESS : (string &body body)</code> 
 
[[|]]function <code>NOTE-NUMERIC-PROGRESS : (num)</code> 
 
[[|]]macro <code>NOTING-PERCENT-PROGRESS : (string &body body)</code> 
 
[[|]]function <code>NOTE-PERCENT-PROGRESS : (index max)</code> 
[[|]] '''SubL.4 : Process Manipulation''' 
 
[[|]]function <code>FORK-PROCESS : (function &optional callback output-file)</code> 
Spawn a heavyweight child process to call FUNCTION, which takes no arguments. 
FUNCTION must return an integer. 
CALLBACK, if provided, must be a function of one argument which is called 
on the returned value within the address space of the parent process. 
OUTPUT-FILE, if provided, is a file to which standard output and error are piped 
while executing FUNCTION. 
 
[[|]]function <code>RESTART-PROCESS : (&optional world-spec init-file-pathname init-form-spec)</code> 
Restart the current heavyweight process. 
WORLD-SPEC, if provided, is the filename of a world to use. 
INIT-FILE-PATHNAME, if provided, is a file of initializatio forms to eval. 
INIT-FORM-SPEC, if provided, is a form to execute. 
The values used for these when the current process was started are used if unprovided. 
[[|]] '''SubL.5 : Memory Interaction''' 
 
[[|]]function <code>GC : (&optional level)</code> 
 
[[|]]macro <code>WITH-STATIC-AREA : (&body body)</code> 
 
[[|]]function <code>WRITE-IMAGE : (filename &optional do-full-gc)</code> 
Save the current state of virtual memory in a file called FILENAME. 
If DO-FULL-GC is true, then a full garbage collection is 
performed before writing the image. Otherwise, a dynamic 
garbage collection is performed and remaining objects are 
promoted to being static ones.

During the initialization of a SubL system at startup, variables defined via [[#FN-DEF-DEFVAR|<code>DEFVAR</code>]] have their initial values set via their state in the world file used at startup, ignoring the initial value specified by the code. [[#FN-DEF-DEFPARAMETER|<code>DEFPARAMETER</code>]] variables and [[#FN-DEF-DEFCONSTANT|<code>DEFCONSTANT</code>]] global constants have their values initialized via the code on startup.

The net result of this distinction is as follows: if a world is saved out via WRITE-IMAGE, and then used to restart a SubL system, the values of [[#FN-DEF-DEFVAR|<code>DEFVAR</code>]] variables will persist, while any changes to [[#FN-DEF-DEFPARAMETER|<code>DEFPARAMETER</code>]] variables will be lost when they are reset to their original code-specified initial values on startup. [[|]]

-----

= Index =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/index.html CLtL2 Reference]

'''[[#Index-A|A]] | [[#Index-B|B]] | [[#Index-C|C]] | [[#Index-D|D]] | [[#Index-E|E]] | [[#Index-F|F]] | [[#Index-G|G]] | [[#Index-H|H]] | [[#Index-I|I]] | [[#Index-J|J]] | [[#Index-K|K]] | [[#Index-L|L]] | [[#Index-M|M]] | [[#Index-N|N]] | [[#Index-O|O]] | [[#Index-P|P]] | [[#Index-Q|Q]] | [[#Index-R|R]] | [[#Index-S|S]] | [[#Index-T|T]] | [[#Index-U|U]] | [[#Index-V|V]] | [[#Index-W|W]] | [[#Index-X|X]] | [[#Index-Y|Y]] | [[#Index-Z|Z]]'''

 
[[#FN-DEF-1280|<code>*</code>]] function 
[[#SYM-DEF-1280|<code>*</code>]] variable 
[[#SYM-DEF-165120|<code>**</code>]] variable 
[[#SYM-DEF-21136640|<code>***</code>]] variable 
[[#SYM-DEF-1161467279|<code>*CLOCK-GRANULARITY*</code>]] variable 
[[#SYM-DEF-1424597890|<code>*CONTINUE-CERROR?*</code>]] variable 
[[#SYM-DEF-609384130|<code>*DEFAULT-PATHNAME-DEFAULTS*</code>]] variable 
[[#SYM-DEF-2020021124|<code>*EPOCH*</code>]] variable 
[[#SYM-DEF-860597104|<code>*ERROR-ABORT-HANDLER*</code>]] variable 
[[#SYM-DEF-354311860|<code>*ERROR-HANDLER*</code>]] variable 
[[#SYM-DEF-1079241228|<code>*ERROR-MESSAGE*</code>]] variable 
[[#SYM-DEF-704643174|<code>*ERROR-OUTPUT*</code>]] variable 
[[#SYM-DEF-204607828|<code>*IGNORE-BREAKS?*</code>]] variable 
[[#SYM-DEF-2065003033|<code>*IGNORE-MUSTS?*</code>]] variable 
[[#SYM-DEF-1528898064|<code>*IGNORE-WARNS?*</code>]] variable 
[[#SYM-DEF-1188374285|<code>*MOST-NEGATIVE-FIXNUM*</code>]] variable 
[[#SYM-DEF-113980253|<code>*MOST-POSITIVE-FIXNUM*</code>]] variable 
[[#SYM-DEF-1624760991|<code>*MULTIPLE-VALUES-LIMIT*</code>]] variable 
[[#SYM-DEF-1405149315|<code>*NULL-OUTPUT*</code>]] variable 
[[#SYM-DEF-313735324|<code>*PRINT-ESCAPE*</code>]] variable 
[[#SYM-DEF-430643141|<code>*RAND-MAX*</code>]] variable 
[[#SYM-DEF-371148559|<code>*SIGNAL-MAX*</code>]] variable 
[[#SYM-DEF-694198800|<code>*SILENT-PROGRESS?*</code>]] variable 
[[#SYM-DEF-1112282190|<code>*STANDARD-INPUT*</code>]] variable 
[[#SYM-DEF-1982975489|<code>*STANDARD-OUTPUT*</code>]] variable 
[[#SYM-DEF-1570894042|<code>*SUSPEND-TYPE-CHECKING?*</code>]] variable 
[[#FN-DEF-+|<code>+</code>]] function 
[[#FN-DEF--|<code>-</code>]] function 
[[#FN-DEF-/|<code>/</code>]] function 
[[#FN-DEF-/=|<code>/=</code>]] function 
[[#FN-DEF-3584|<code><</code>]] function 
[[#FN-DEF-462464|<code><=</code>]] function 
[[#FN-DEF-=|<code>=</code>]] function 
[[#FN-DEF-3840|<code>></code>]] function 
[[#FN-DEF-495232|<code>>=</code>]] function [[|]]

==== A ====

 
[[#FN-DEF-ACONS|<code>ACONS</code>]] function 
[[#FN-DEF-ADJOIN|<code>ADJOIN</code>]] function 
[[#FN-DEF-ALERT-USER|<code>ALERT-USER</code>]] function 
[[#FN-DEF-ALPHA-CHAR-P|<code>ALPHA-CHAR-P</code>]] function 
[[#FN-DEF-ALPHANUMERICP|<code>ALPHANUMERICP</code>]] function 
[[#FN-DEF-APPEND|<code>APPEND</code>]] function 
[[#FN-DEF-APPEND-FILES|<code>APPEND-FILES</code>]] function 
[[#FN-DEF-APPLY|<code>APPLY</code>]] function 
[[#FN-DEF-AREF|<code>AREF</code>]] function 
[[#FN-DEF-ASSOC|<code>ASSOC</code>]] function 
[[#FN-DEF-ASSOC-IF|<code>ASSOC-IF</code>]] function 
[[#FN-DEF-ATOM|<code>ATOM</code>]] function [[|]]

==== B ====

 
[[#FN-DEF-BOTH-CASE-P|<code>BOTH-CASE-P</code>]] function 
[[#FN-DEF-BOUNDP|<code>BOUNDP</code>]] function 
[[#FN-DEF-BREAK|<code>BREAK</code>]] function 
[[#FN-DEF-BUTLAST|<code>BUTLAST</code>]] function 
[[#FN-DEF-BYTE|<code>BYTE</code>]] macro [[|]]

==== C ====

 
[[#FN-DEF-CAAR|<code>CAAR</code>]] function 
[[#FN-DEF-CADR|<code>CADR</code>]] function 
[[#FN-DEF-CAND|<code>CAND</code>]] macro 
[[#FN-DEF-CAR|<code>CAR</code>]] function 
[[#FN-DEF-CCATCH|<code>CCATCH</code>]] macro 
[[#FN-DEF-CCONCATENATE|<code>CCONCATENATE</code>]] function 
[[#FN-DEF-CDAR|<code>CDAR</code>]] function 
[[#FN-DEF-CDDR|<code>CDDR</code>]] function 
[[#FN-DEF-CDEC|<code>CDEC</code>]] macro 
[[#FN-DEF-CDESTRUCTURING-BIND|<code>CDESTRUCTURING-BIND</code>]] macro 
[[#FN-DEF-CDO|<code>CDO</code>]] macro 
[[#FN-DEF-CDOHASH|<code>CDOHASH</code>]] macro 
[[#FN-DEF-CDOLIST|<code>CDOLIST</code>]] macro 
[[#FN-DEF-CDOTIMES|<code>CDOTIMES</code>]] macro 
[[#FN-DEF-CDR|<code>CDR</code>]] function 
[[#FN-DEF-CEILING|<code>CEILING</code>]] function 
[[#FN-DEF-CERROR|<code>CERROR</code>]] function 
[[#FN-DEF-CHAR|<code>CHAR</code>]] function 
[[#FN-DEF-CHAR-CODE|<code>CHAR-CODE</code>]] function 
[[#FN-DEF-CHAR-DOWNCASE|<code>CHAR-DOWNCASE</code>]] function 
[[#FN-DEF-CHAR-EQUAL|<code>CHAR-EQUAL</code>]] function 
[[#FN-DEF-CHAR-GREATERP|<code>CHAR-GREATERP</code>]] function 
[[#FN-DEF-CHAR-LESSP|<code>CHAR-LESSP</code>]] function 
[[#FN-DEF-CHAR-NOT-EQUAL|<code>CHAR-NOT-EQUAL</code>]] function 
[[#FN-DEF-CHAR-NOT-GREATERP|<code>CHAR-NOT-GREATERP</code>]] function 
[[#FN-DEF-CHAR-NOT-LESSP|<code>CHAR-NOT-LESSP</code>]] function 
[[#FN-DEF-CHAR-UPCASE|<code>CHAR-UPCASE</code>]] function 
[[#FN-DEF-CHAR/=|<code>CHAR/=</code>]] function 
[[#FN-DEF-137661468|<code>CHAR<</code>]] function 
[[#FN-DEF-440795332|<code>CHAR<=</code>]] function 
[[#FN-DEF-CHAR=|<code>CHAR=</code>]] function 
[[#FN-DEF-137661724|<code>CHAR></code>]] function 
[[#FN-DEF-440828100|<code>CHAR>=</code>]] function 
[[#FN-DEF-CHARACTERP|<code>CHARACTERP</code>]] function 
[[#FN-DEF-CHECK-TYPE|<code>CHECK-TYPE</code>]] macro 
[[#FN-DEF-CINC|<code>CINC</code>]] macro 
[[#FN-DEF-CLET|<code>CLET</code>]] macro 
[[#FN-DEF-CLOSE|<code>CLOSE</code>]] function 
[[#FN-DEF-CLRHASH|<code>CLRHASH</code>]] function 
[[#FN-DEF-CMERGE|<code>CMERGE</code>]] function 
[[#FN-DEF-CMULTIPLE-VALUE-BIND|<code>CMULTIPLE-VALUE-BIND</code>]] macro 
[[#FN-DEF-CNOT|<code>CNOT</code>]] macro 
[[#FN-DEF-CODE-CHAR|<code>CODE-CHAR</code>]] function 
[[#FN-DEF-CONS|<code>CONS</code>]] function 
[[#FN-DEF-CONSP|<code>CONSP</code>]] function 
[[#FN-DEF-CONSTANTP|<code>CONSTANTP</code>]] function 
[[#FN-DEF-CONSTRUCT-FILENAME|<code>CONSTRUCT-FILENAME</code>]] function 
[[#FN-DEF-COPY-ALIST|<code>COPY-ALIST</code>]] function 
[[#FN-DEF-COPY-LIST|<code>COPY-LIST</code>]] function 
[[#FN-DEF-COPY-SEQ|<code>COPY-SEQ</code>]] function 
[[#FN-DEF-COPY-TREE|<code>COPY-TREE</code>]] function 
[[#FN-DEF-COR|<code>COR</code>]] macro 
[[#FN-DEF-COUNT|<code>COUNT</code>]] function 
[[#FN-DEF-COUNT-IF|<code>COUNT-IF</code>]] function 
[[#FN-DEF-CPOP|<code>CPOP</code>]] macro 
[[#FN-DEF-CPROGV|<code>CPROGV</code>]] macro 
[[#FN-DEF-CPUSH|<code>CPUSH</code>]] macro 
[[#FN-DEF-CPUSHNEW|<code>CPUSHNEW</code>]] macro 
[[#FN-DEF-CREDUCE|<code>CREDUCE</code>]] function 
[[#FN-DEF-CSETF|<code>CSETF</code>]] macro 
[[#FN-DEF-CSETQ|<code>CSETQ</code>]] macro 
[[#FN-DEF-CSOME|<code>CSOME</code>]] macro 
[[#FN-DEF-CTIME|<code>CTIME</code>]] macro 
[[#FN-DEF-CUNWIND-PROTECT|<code>CUNWIND-PROTECT</code>]] macro [[|]]

==== D ====

 
[[#FN-DEF-DEBUG|<code>DEBUG</code>]] function 
[[#FN-DEF-DECLAIM|<code>DECLAIM</code>]] macro 
[[#FN-DEF-DECLARE|<code>DECLARE</code>]] function 
[[#FN-DEF-DECODE-UNIVERSAL-TIME|<code>DECODE-UNIVERSAL-TIME</code>]] function 
[[#FN-DEF-DEFAULT-SIGNAL-HANDLER|<code>DEFAULT-SIGNAL-HANDLER</code>]] function 
[[#FN-DEF-DEFAULT-STRUCT-PRINT-FUNCTION|<code>DEFAULT-STRUCT-PRINT-FUNCTION</code>]] function 
[[#FN-DEF-DEFCONSTANT|<code>DEFCONSTANT</code>]] macro 
[[#FN-DEF-DEFINE|<code>DEFINE</code>]] macro 
[[#FN-DEF-DEFINE-METHOD|<code>DEFINE-METHOD</code>]] macro 
[[#FN-DEF-DEFMACRO|<code>DEFMACRO</code>]] macro 
[[#FN-DEF-DEFPARAMETER|<code>DEFPARAMETER</code>]] macro 
[[#FN-DEF-DEFPOLYMORPHIC|<code>DEFPOLYMORPHIC</code>]] macro 
[[#FN-DEF-DEFSTRUCT|<code>DEFSTRUCT</code>]] macro 
[[#FN-DEF-DEFVAR|<code>DEFVAR</code>]] macro 
[[#FN-DEF-DELETE|<code>DELETE</code>]] function 
[[#FN-DEF-DELETE-DUPLICATES|<code>DELETE-DUPLICATES</code>]] function 
[[#FN-DEF-DELETE-FILE|<code>DELETE-FILE</code>]] function 
[[#FN-DEF-DELETE-IF|<code>DELETE-IF</code>]] function 
[[#FN-DEF-DIGIT-CHAR-P|<code>DIGIT-CHAR-P</code>]] function 
[[#FN-DEF-DIRECTORY|<code>DIRECTORY</code>]] function 
[[#FN-DEF-DPB|<code>DPB</code>]] function [[|]]

==== E ====

 
[[#FN-DEF-EIGHTH|<code>EIGHTH</code>]] function 
[[#FN-DEF-ELT|<code>ELT</code>]] function 
[[#FN-DEF-ENCODE-TIMESTRING|<code>ENCODE-TIMESTRING</code>]] function 
[[#FN-DEF-ENCODE-UNIVERSAL-TIME|<code>ENCODE-UNIVERSAL-TIME</code>]] function 
[[#FN-DEF-ENDP|<code>ENDP</code>]] function 
[[#FN-DEF-EQ|<code>EQ</code>]] function 
[[#FN-DEF-EQL|<code>EQL</code>]] function 
[[#FN-DEF-EQUAL|<code>EQUAL</code>]] function 
[[#FN-DEF-EQUALP|<code>EQUALP</code>]] function 
[[#FN-DEF-ERROR|<code>ERROR</code>]] function 
[[#FN-DEF-EVAL|<code>EVAL</code>]] function 
[[#FN-DEF-EVENP|<code>EVENP</code>]] function [[|]]

==== F ====

 
[[#FN-DEF-FBOUNDP|<code>FBOUNDP</code>]] function 
[[#FN-DEF-FIF|<code>FIF</code>]] macro 
[[#FN-DEF-FIFTH|<code>FIFTH</code>]] function 
[[#FN-DEF-FILE-AUTHOR|<code>FILE-AUTHOR</code>]] function 
[[#FN-DEF-FILE-LENGTH|<code>FILE-LENGTH</code>]] function 
[[#FN-DEF-FILE-WRITE-DATE|<code>FILE-WRITE-DATE</code>]] function 
[[#FN-DEF-FILL|<code>FILL</code>]] function 
[[#FN-DEF-FIND|<code>FIND</code>]] function 
[[#FN-DEF-FIND-IF|<code>FIND-IF</code>]] function 
[[#FN-DEF-FIND-SYMBOL|<code>FIND-SYMBOL</code>]] function 
[[#FN-DEF-FIRST|<code>FIRST</code>]] function 
[[#FN-DEF-FIXNUMP|<code>FIXNUMP</code>]] function 
[[#FN-DEF-FLOAT|<code>FLOAT</code>]] function 
[[#FN-DEF-FLOATP|<code>FLOATP</code>]] function 
[[#FN-DEF-FLOOR|<code>FLOOR</code>]] function 
[[#FN-DEF-FMAKUNBOUND|<code>FMAKUNBOUND</code>]] function 
[[#FN-DEF-FORCE-OUTPUT|<code>FORCE-OUTPUT</code>]] function 
[[#FN-DEF-FORK-PROCESS|<code>FORK-PROCESS</code>]] function 
[[#FN-DEF-FORMAT|<code>FORMAT</code>]] function 
[[#FN-DEF-FOURTH|<code>FOURTH</code>]] function 
[[#FN-DEF-FUNCALL|<code>FUNCALL</code>]] function 
[[#FN-DEF-FUNCTION|<code>FUNCTION</code>]] macro 
[[#FN-DEF-FUNCTION-INFORMATION|<code>FUNCTION-INFORMATION</code>]] function 
[[#FN-DEF-FUNCTION-SPEC-P|<code>FUNCTION-SPEC-P</code>]] function 
[[#FN-DEF-FUNCTIONP|<code>FUNCTIONP</code>]] function 
[[#FN-DEF-FUNLESS|<code>FUNLESS</code>]] macro 
[[#FN-DEF-FWHEN|<code>FWHEN</code>]] macro [[|]]

==== G ====

 
[[#FN-DEF-GC|<code>GC</code>]] function 
[[#FN-DEF-GENSYM|<code>GENSYM</code>]] function 
[[#FN-DEF-GENTEMP|<code>GENTEMP</code>]] function 
[[#FN-DEF-GET|<code>GET</code>]] function 
[[#FN-DEF-GET-CONSING-STATE|<code>GET-CONSING-STATE</code>]] function 
[[#FN-DEF-GET-FILE-POSITION|<code>GET-FILE-POSITION</code>]] function 
[[#FN-DEF-GET-INTERNAL-REAL-TIME|<code>GET-INTERNAL-REAL-TIME</code>]] function 
[[#FN-DEF-GET-MACHINE-NAME|<code>GET-MACHINE-NAME</code>]] function 
[[#FN-DEF-GET-NETWORK-NAME|<code>GET-NETWORK-NAME</code>]] function 
[[#FN-DEF-GET-PROCESS-ID|<code>GET-PROCESS-ID</code>]] function 
[[#FN-DEF-GET-STRING-FROM-USER|<code>GET-STRING-FROM-USER</code>]] function 
[[#FN-DEF-GET-UNIVERSAL-TIME|<code>GET-UNIVERSAL-TIME</code>]] function 
[[#FN-DEF-GET-USER-NAME|<code>GET-USER-NAME</code>]] function 
[[#FN-DEF-GETHASH|<code>GETHASH</code>]] function [[|]]

==== H ====

 
[[#FN-DEF-HASH-TABLE-COUNT|<code>HASH-TABLE-COUNT</code>]] function 
[[#FN-DEF-HASH-TABLE-P|<code>HASH-TABLE-P</code>]] function [[|]]

==== I ====

 
[[#FN-DEF-IDENTITY|<code>IDENTITY</code>]] function 
[[#FN-DEF-IGNORE|<code>IGNORE</code>]] function 
[[#FN-DEF-IN-PACKAGE|<code>IN-PACKAGE</code>]] macro 
[[#FN-DEF-INPUT-STREAM-P|<code>INPUT-STREAM-P</code>]] function 
[[#FN-DEF-INSTALL-SIGNAL-HANDLER|<code>INSTALL-SIGNAL-HANDLER</code>]] function 
[[#FN-DEF-INT/|<code>INT/</code>]] function 
[[#FN-DEF-INTEGER-DECODE-FLOAT|<code>INTEGER-DECODE-FLOAT</code>]] function 
[[#FN-DEF-INTEGERP|<code>INTEGERP</code>]] function 
[[#FN-DEF-INTERN|<code>INTERN</code>]] function 
[[#FN-DEF-INTERSECTION|<code>INTERSECTION</code>]] function [[|]]

==== J ====

[[|]]

==== K ====

 
[[#FN-DEF-KEYWORDP|<code>KEYWORDP</code>]] function [[|]]

==== L ====

 
[[#FN-DEF-LAST|<code>LAST</code>]] function 
[[#FN-DEF-LDB|<code>LDB</code>]] function 
[[#FN-DEF-LDIFF|<code>LDIFF</code>]] function 
[[#FN-DEF-LENGTH|<code>LENGTH</code>]] function 
[[#FN-DEF-LIST|<code>LIST</code>]] function 
[[#FN-DEF-443877220|<code>LIST*</code>]] function 
[[#FN-DEF-LIST-LENGTH|]]<code>LIST-LENGTH</code> function function 
[[#FN-DEF-LISTP|]]<code>LISTP</code> function 
[[#FN-DEF-LOAD|]]<code>LOAD</code> function 
[[#FN-DEF-LOG-MESSAGE|]]<code>LOG-MESSAGE</code> function 
[[#FN-DEF-LOWER-CASE-P|]]<code>LOWER-CASE-P</code> function[[|]]

==== M ====

 
[[#FN-DEF-MAKE-HASH-TABLE|]]<code>MAKE-HASH-TABLE</code> function 
[[#FN-DEF-MAKE-LIST|]]<code>MAKE-LIST</code> function 
[[#FN-DEF-MAKE-STRING|]]<code>MAKE-STRING</code> function 
[[#FN-DEF-MAKE-SYMBOL|]]<code>MAKE-SYMBOL</code> function 
[[#FN-DEF-MAKE-VECTOR|]]<code>MAKE-VECTOR</code> function 
[[#FN-DEF-MAKUNBOUND|]]<code>MAKUNBOUND</code> function 
[[#FN-DEF-MAPC|]]<code>MAPC</code> function 
[[#FN-DEF-MAPCAN|]]<code>MAPCAN</code> function 
[[#FN-DEF-MAPCAR|]]<code>MAPCAR</code> function 
[[#FN-DEF-MAPCON|]]<code>MAPCON</code> function 
[[#FN-DEF-MAPHASH|]]<code>MAPHASH</code> function 
[[#FN-DEF-MAPL|]]<code>MAPL</code> function 
[[#FN-DEF-MAPLIST|]]<code>MAPLIST</code> function 
[[#FN-DEF-MAX|]]<code>MAX</code> function 
[[#FN-DEF-MEMBER|]]<code>MEMBER</code> function 
[[#FN-DEF-MEMBER-IF|]]<code>MEMBER-IF</code> function 
[[#FN-DEF-MIN|]]<code>MIN</code> function 
[[#FN-DEF-MINUSP|]]<code>MINUSP</code> function 
[[#FN-DEF-MISMATCH|]]<code>MISMATCH</code> function 
[[#FN-DEF-MOD|]]<code>MOD</code> macro 
[[#FN-DEF-MULTIPLE-VALUE-LIST|]]<code>MULTIPLE-VALUE-LIST</code> macro 
[[#FN-DEF-MUST|]]<code>MUST</code> function[[|]]

==== N ====

 
[[#FN-DEF-NBUTLAST|]]<code>NBUTLAST</code> function 
[[#FN-DEF-NCONC|]]<code>NCONC</code> function 
[[#FN-DEF-NINTERSECTION|]]<code>NINTERSECTION</code> function 
[[#FN-DEF-NINTH|]]<code>NINTH</code> function 
[[#FN-DEF-NOTE-ACTIVITY|]]<code>NOTE-ACTIVITY</code> function 
[[#FN-DEF-NOTE-NUMERIC-PROGRESS|]]<code>NOTE-NUMERIC-PROGRESS</code> function 
[[#FN-DEF-NOTE-PERCENT-PROGRESS|]]<code>NOTE-PERCENT-PROGRESS</code> function 
[[#FN-DEF-NOTIFY-USER|]]<code>NOTIFY-USER</code> macro 
[[#FN-DEF-NOTING-ACTIVITY|]]<code>NOTING-ACTIVITY</code> macro 
[[#FN-DEF-NOTING-NUMERIC-PROGRESS|]]<code>NOTING-NUMERIC-PROGRESS</code> macro 
[[#FN-DEF-NOTING-PERCENT-PROGRESS|]]<code>NOTING-PERCENT-PROGRESS</code> function 
[[#FN-DEF-NRECONC|]]<code>NRECONC</code> function 
[[#FN-DEF-NREVERSE|]]<code>NREVERSE</code> function 
[[#FN-DEF-NSET-DIFFERENCE|]]<code>NSET-DIFFERENCE</code> function 
[[#FN-DEF-NSET-EXCLUSIVE-OR|]]<code>NSET-EXCLUSIVE-OR</code> function 
[[#FN-DEF-NSTRING-CAPITALIZE|]]<code>NSTRING-CAPITALIZE</code> function 
[[#FN-DEF-NSTRING-DOWNCASE|]]<code>NSTRING-DOWNCASE</code> function 
[[#FN-DEF-NSTRING-UPCASE|]]<code>NSTRING-UPCASE</code> function 
[[#FN-DEF-NSUBLIS|]]<code>NSUBLIS</code> function 
[[#FN-DEF-NSUBST|]]<code>NSUBST</code> function 
[[#FN-DEF-NSUBST-IF|]]<code>NSUBST-IF</code> function 
[[#FN-DEF-NSUBSTITUTE|]]<code>NSUBSTITUTE</code> function 
[[#FN-DEF-NSUBSTITUTE-IF|]]<code>NSUBSTITUTE-IF</code> function 
[[#FN-DEF-NTH|]]<code>NTH</code> function 
[[#FN-DEF-NTHCDR|]]<code>NTHCDR</code> function 
[[#FN-DEF-NULL|]]<code>NULL</code> function 
[[#FN-DEF-NUMBERP|]]<code>NUMBERP</code> function 
[[#FN-DEF-NUNION|]]<code>NUNION</code> function[[|]]

==== O ====

 
[[#FN-DEF-ODDP|]]<code>ODDP</code> function 
[[#FN-DEF-OPEN-BINARY|]]<code>OPEN-BINARY</code> function 
[[#FN-DEF-OPEN-TCP-STREAM|]]<code>OPEN-TCP-STREAM</code> function 
[[#FN-DEF-OPEN-TEXT|]]<code>OPEN-TEXT</code> function 
[[#FN-DEF-OUTPUT-STREAM-P|]]<code>OUTPUT-STREAM-P</code> function[[|]]

==== P ====

 
[[#FN-DEF-PAIRLIS|]]<code>PAIRLIS</code> macro 
[[#FN-DEF-PCASE|]]<code>PCASE</code> macro 
[[#FN-DEF-PCOND|]]<code>PCOND</code> macro 
[[#FN-DEF-PIF|]]<code>PIF</code> function 
[[#FN-DEF-PLUSP|]]<code>PLUSP</code> function 
[[#FN-DEF-POSITION|]]<code>POSITION</code> function 
[[#FN-DEF-POSITION-IF|]]<code>POSITION-IF</code> function 
[[#FN-DEF-PRIN1|]]<code>PRIN1</code> function 
[[#FN-DEF-PRIN1-TO-STRING|]]<code>PRIN1-TO-STRING</code> function 
[[#FN-DEF-PRINC|]]<code>PRINC</code> function 
[[#FN-DEF-PRINC-TO-STRING|]]<code>PRINC-TO-STRING</code> function 
[[#FN-DEF-PRINT|]]<code>PRINT</code> macro 
[[#FN-DEF-PRINTING-OBJECT|]]<code>PRINTING-OBJECT</code> function 
[[#FN-DEF-PROBE-FILE|]]<code>PROBE-FILE</code> function 
[[#FN-DEF-PROCLAIM|]]<code>PROCLAIM</code> macro 
[[#FN-DEF-PROGN|]]<code>PROGN</code> macro 
[[#FN-DEF-PUNLESS|]]<code>PUNLESS</code> function 
[[#FN-DEF-PUT|]]<code>PUT</code> macro 
[[#FN-DEF-PWHEN|]]<code>PWHEN</code> function[[|]]

==== Q ====

 
[[#FN-DEF-QUOTE|]]<code>QUOTE</code> function[[|]]

==== R ====

 
[[#FN-DEF-RANDOM|]]<code>RANDOM</code> function 
[[#FN-DEF-RASSOC|]]<code>RASSOC</code> function 
[[#FN-DEF-RASSOC-IF|]]<code>RASSOC-IF</code> function 
[[#FN-DEF-READ|]]<code>READ</code> function 
[[#FN-DEF-READ-BYTE|]]<code>READ-BYTE</code> function 
[[#FN-DEF-READ-CHAR|]]<code>READ-CHAR</code> function 
[[#FN-DEF-READ-FROM-STRING|]]<code>READ-FROM-STRING</code> function 
[[#FN-DEF-READ-LINE|]]<code>READ-LINE</code> function 
[[#FN-DEF-REM|]]<code>REM</code> function 
[[#FN-DEF-REMHASH|]]<code>REMHASH</code> function 
[[#FN-DEF-REMOVE|]]<code>REMOVE</code> function 
[[#FN-DEF-REMOVE-DUPLICATES|]]<code>REMOVE-DUPLICATES</code> function 
[[#FN-DEF-REMOVE-IF|]]<code>REMOVE-IF</code> function 
[[#FN-DEF-REMPROP|]]<code>REMPROP</code> function 
[[#FN-DEF-RENAME-FILE|]]<code>RENAME-FILE</code> function 
[[#FN-DEF-REPLACE|]]<code>REPLACE</code> function 
[[#FN-DEF-REPORT-ERROR|]]<code>REPORT-ERROR</code> function 
[[#FN-DEF-REST|]]<code>REST</code> function 
[[#FN-DEF-RESTART-PROCESS|]]<code>RESTART-PROCESS</code> macro 
[[#FN-DEF-RET|]]<code>RET</code> function 
[[#FN-DEF-REVAPPEND|]]<code>REVAPPEND</code> function 
[[#FN-DEF-REVERSE|]]<code>REVERSE</code> function 
[[#FN-DEF-ROUND|]]<code>ROUND</code> function 
[[#FN-DEF-RPLACA|]]<code>RPLACA</code> function 
[[#FN-DEF-RPLACD|]]<code>RPLACD</code> function[[|]]

==== S ====

 
[[#FN-DEF-SCALE-FLOAT|]]<code>SCALE-FLOAT</code> function 
[[#FN-DEF-SEARCH|]]<code>SEARCH</code> function 
[[#FN-DEF-SECOND|]]<code>SECOND</code> function 
[[#FN-DEF-SEED-RANDOM|]]<code>SEED-RANDOM</code> function 
[[#FN-DEF-SEQUENCEP|]]<code>SEQUENCEP</code> function 
[[#FN-DEF-SET|]]<code>SET</code> function 
[[#FN-DEF-SET-AREF|]]<code>SET-AREF</code> function 
[[#FN-DEF-SET-CHAR|]]<code>SET-CHAR</code> function 
[[#FN-DEF-SET-CONSING-STATE|]]<code>SET-CONSING-STATE</code> function 
[[#FN-DEF-SET-DIFFERENCE|]]<code>SET-DIFFERENCE</code> function 
[[#FN-DEF-SET-EXCLUSIVE-OR|]]<code>SET-EXCLUSIVE-OR</code> function 
[[#FN-DEF-SET-FILE-POSITION|]]<code>SET-FILE-POSITION</code> function 
[[#FN-DEF-SET-NTH|]]<code>SET-NTH</code> function 
[[#FN-DEF-SETHASH|]]<code>SETHASH</code> function 
[[#FN-DEF-SEVENTH|]]<code>SEVENTH</code> function 
[[#FN-DEF-SIXTH|]]<code>SIXTH</code> function 
[[#FN-DEF-SLEEP|]]<code>SLEEP</code> function 
[[#FN-DEF-SORT|]]<code>SORT</code> function 
[[#FN-DEF-STABLE-SORT|]]<code>STABLE-SORT</code> function 
[[#FN-DEF-STREAMP|]]<code>STREAMP</code> function 
[[#FN-DEF-STRING|]]<code>STRING</code> function 
[[#FN-DEF-STRING-CAPITALIZE|]]<code>STRING-CAPITALIZE</code> function 
[[#FN-DEF-STRING-DOWNCASE|]]<code>STRING-DOWNCASE</code> function 
[[#FN-DEF-STRING-EQUAL|]]<code>STRING-EQUAL</code> function 
[[#FN-DEF-STRING-GREATERP|]]<code>STRING-GREATERP</code> function 
[[#FN-DEF-STRING-LEFT-TRIM|]]<code>STRING-LEFT-TRIM</code> function 
[[#FN-DEF-STRING-LESSP|]]<code>STRING-LESSP</code> function 
[[#FN-DEF-STRING-NOT-EQUAL|]]<code>STRING-NOT-EQUAL</code> function 
[[#FN-DEF-STRING-NOT-GREATERP|]]<code>STRING-NOT-GREATERP</code> function 
[[#FN-DEF-STRING-NOT-LESSP|]]<code>STRING-NOT-LESSP</code> function 
[[#FN-DEF-STRING-RIGHT-TRIM|]]<code>STRING-RIGHT-TRIM</code> function 
[[#FN-DEF-STRING-TRIM|]]<code>STRING-TRIM</code> function 
[[#FN-DEF-STRING-UPCASE|]]<code>STRING-UPCASE</code> function 
[[#FN-DEF-STRING/=|]]<code>STRING/=</code> function 
[[#FN-DEF-427203732|]]<code>STRING<</code> function 
[[#FN-DEF-994985164|]]<code>STRING<=</code> function 
[[#FN-DEF-STRING=|]]<code>STRING=</code> function 
[[#FN-DEF-427203988|]]<code>STRING></code> function 
[[#FN-DEF-995017932|]]<code>STRING>=</code> function 
[[#FN-DEF-STRINGP|]]<code>STRINGP</code> function 
[[#FN-DEF-SUBLIS|]]<code>SUBLIS</code> function 
[[#FN-DEF-SUBSEQ|]]<code>SUBSEQ</code> function 
[[#FN-DEF-SUBSETP|]]<code>SUBSETP</code> function 
[[#FN-DEF-SUBST|]]<code>SUBST</code> function 
[[#FN-DEF-SUBST-IF|]]<code>SUBST-IF</code> function 
[[#FN-DEF-SUBSTITUTE|]]<code>SUBSTITUTE</code> function 
[[#FN-DEF-SUBSTITUTE-IF|]]<code>SUBSTITUTE-IF</code> function 
[[#FN-DEF-SXHASH|]]<code>SXHASH</code> function 
[[#FN-DEF-SYMBOL-FUNCTION|]]<code>SYMBOL-FUNCTION</code> function 
[[#FN-DEF-SYMBOL-NAME|]]<code>SYMBOL-NAME</code> function 
[[#FN-DEF-SYMBOL-PLIST|]]<code>SYMBOL-PLIST</code> function 
[[#FN-DEF-SYMBOL-VALUE|]]<code>SYMBOL-VALUE</code> function 
[[#FN-DEF-SYMBOLP|]]<code>SYMBOLP</code> function[[|]]

==== T ====

 
[[#FN-DEF-TAILP|]]<code>TAILP</code> function 
[[#FN-DEF-TENTH|]]<code>TENTH</code> function 
[[#FN-DEF-TERPRI|]]<code>TERPRI</code> function 
[[#FN-DEF-THIRD|]]<code>THIRD</code> function 
[[#FN-DEF-THROW|]]<code>THROW</code> function 
[[#FN-DEF-TIME-FROM-NOW|]]<code>TIME-FROM-NOW</code> function 
[[#FN-DEF-TIME-HAS-ARRIVED?|]]<code>TIME-HAS-ARRIVED?</code> function 
[[#FN-DEF-TIMESTRING|]]<code>TIMESTRING</code> function 
[[#FN-DEF-TREE-EQUAL|]]<code>TREE-EQUAL</code> function 
[[#FN-DEF-TRUNCATE|]]<code>TRUNCATE</code> function[[|]]

==== U ====

 
[[#FN-DEF-UNION|]]<code>UNION</code> function 
[[#FN-DEF-UNREAD-CHAR|]]<code>UNREAD-CHAR</code> function 
[[#FN-DEF-UPPER-CASE-P|]]<code>UPPER-CASE-P</code> function 
[[#FN-DEF-USER-CONFIRM|]]<code>USER-CONFIRM</code> function[[|]]

==== V ====

 
[[#FN-DEF-VALUES|]]<code>VALUES</code> function 
[[#FN-DEF-VARIABLE-INFORMATION|]]<code>VARIABLE-INFORMATION</code> function 
[[#FN-DEF-VECTOR|]]<code>VECTOR</code> function 
[[#FN-DEF-VECTORP|]]<code>VECTORP</code> function[[|]]

==== W ====

 
[[#FN-DEF-WARN|]]<code>WARN</code> macro 
[[#FN-DEF-WITH-BINARY-FILE|]]<code>WITH-BINARY-FILE</code> macro 
[[#FN-DEF-WITH-STATIC-AREA|]]<code>WITH-STATIC-AREA</code> macro 
[[#FN-DEF-WITH-TEXT-FILE|]]<code>WITH-TEXT-FILE</code> function 
[[#FN-DEF-WRITE|]]<code>WRITE</code> function 
[[#FN-DEF-WRITE-BYTE|]]<code>WRITE-BYTE</code> function 
[[#FN-DEF-WRITE-CHAR|]]<code>WRITE-CHAR</code> function 
[[#FN-DEF-WRITE-IMAGE|]]<code>WRITE-IMAGE</code> function 
[[#FN-DEF-WRITE-LINE|]]<code>WRITE-LINE</code> function 
[[#FN-DEF-WRITE-STRING|]]<code>WRITE-STRING</code> function 
[[#FN-DEF-WRITE-TO-STRING|]]<code>WRITE-TO-STRING</code> function[[|]]

==== X ====

[[|]]

==== Y ====

[[|]]

==== Z ====

 
[[#FN-DEF-ZEROP|]]<code>ZEROP</code>

SubL

2017-04-17T09:56:40Z

DouglasRMiles:

[[|]]

== [http://web.archive.org/web/20060325065433/http://www.opencyc.org [[File:/web/20060325065433im_/http://www.cyc.com/cycdoc/img/opencyc-logo-small.gif|OpenCyc.org Homepage]]]SubL Reference ==

E-Mail Comments to: [http://web.archive.org/web/20060325065433/mailto:opencyc-doc@cyc.com opencyc-doc@cyc.com] 
Last Update: 03/28/2002 
''CopyrightÂ© 1996-2002 [http://web.archive.org/web/20060325065433/http://www.cyc.com Cycorp]. All rights reserved.''

-----

= How to Use this Document =

SubL is a computer language built by members of Cycorp. SubL was written to support the CycÂ® application, allowing it to run both under Lisp environments and as a C application generated by a SubL-to-C translator. This document describes the primitive functions of SubL.

Due to the close similarities between SubL and Common Lisp, the [[#Table-of-Contents|Table of Contents]] and structure of this document intentionally mirror that of

<blockquote>'''"Common Lisp: The Language"''', 
2nd Edition, 
Guy L. Steele Jr
</blockquote>
making it easy to compare and contrast the two languages. For the most part, this document focuses only on the differences between SubL and Common Lisp.

An online version of [http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/clm.html "Common Lisp: The Language"] can be found at

<blockquote>[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/clm.html '''<code>http://www.supelec.fr/docs/cltl/clm/clm.html</code>'''] **not working**
</blockquote>
and an [http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/index.html index to all Common Lisp functions] can be found at

<blockquote>[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/index.html '''<code>http://www.supelec.fr/docs/cltl/clm/index.html</code>'''] **this is working**
</blockquote>
Each section of this document contains a link labelled '''"CLtL2 Reference"''' to the corresponding sections of the above online Common Lisp reference. The reader is strongly encouraged to consult that reference in parallel with this document. [[|]]

-----

= 0 : Table of Contents =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node1.html CLtL2 Reference]

* [[#Table-of-Contents|0 : Table of Contents]]
* [[#Introduction|1 : Introduction]]
* [[#Data-Types|2 : Data Types]]
* [[#Scope-and-Extent|3 : Scope and Extent]]
* [[#Type-Specifiers|4 : Type Specifiers]]
* [[#Program-Structure|5 : Program Structure]]
** [[#Defining-Named-Functions|5.3.1 : Defining Named Functions]]
** [[#Declaring|5.3.2 : Declaring Global Variables and Named Constants]]
* [[#Predicates|6 : Predicates]]
** [[#Logical-Values|6.1 : Logical Values]]
** [[#Specific-Data-Type-Predicates|6.2.2 : Specific Data Type Predicates]]
** [[#Equality-Predicates|6.3 : Equality Predicates]]
** [[#Logical-Operators|6.4 : Logical Operators]]
* [[#Control-Structure|7 : Control Structure]]
** [[#Reference|7.1.1 : Reference]]
** [[#Assignment|7.1.2 : Assignment]]
** [[#Generalized-Variables|7.2 : Generalized Variables]]
** [[#Function-Invocation|7.3 : Function Invocation]]
** [[#Simple-Sequencing|7.4 : Simple Sequencing]]
** [[#Establishing-New-Variable-Bindings|7.5 : Establishing New Variable Bindings]]
** [[#Conditionals|7.6 : Conditionals]]
** [[#Blocks-and-Exits|7.7 : Blocks and Exits]]
** [[#General-Iteration|7.8.2 : General Iteration]]
** [[#Simple-Iteration-Constructs|7.8.3 : Simple Iteration Constructs]]
** [[#Mapping|7.8.4 : Mapping]]
** [[#Constructs-for-Handling-Multiple-Values|7.10.1 : Constructs for Handling Multiple Values]]
** [[#Rules-Governing-the-Passing-of-Multiple-Values|7.10.2 : Rules Governing the Passing of Multiple Values]]
** [[#Dynamic-Non-Local-Exits|7.11 : Dynamic Non-Local Exits]]
* [[#Macros|8 : Macros]]
** [[#Macro-Definition|8.1 : Macro Definition]]
** [[#Destructuring|8.3 : Destructuring]]
** [[#Environments|8.5 : Environments]]
* [[#Declarations|9 : Declarations]]
** [[#Declaration-Syntax|9.1 : Declaration Syntax]]
** [[#Declaration-Specifiers|9.2 : Declaration Specifiers]]
* [[#Symbols|10 : Symbols]]
** [[#The-Property-List|10.1 : The Property List]]
** [[#The-Print-Name|10.2 : The Print Name]]
** [[#Creating-Symbols|10.3 : Creating Symbols]]
* [[#Packages|11 : Packages]]
* [[#Numbers|12 : Numbers]]
** [[#Predicates-on-Numbers|12.2 : Predicates on Numbers]]
** [[#Comparisons-on-Numbers|12.3 : Comparisons on Numbers]]
** [[#Arithmetic-Operations|12.4 : Arithmetic Operations]]
** [[#Irrational-and-Transcendental-Functions|12.5 : Irrational and Transcendental Functions]]
** [[#Type-Conversions-and-Component-Extractions-on-Numbers|12.6 : Type Conversions and Component Extractions on Numbers]]
** [[#Logical-Operations-on-Numbers|12.7 : Logical Operations on Numbers]]
** [[#Byte-Manipulation-Functions|12.8 : Byte Manipulation Functions]]
** [[#Random-Numbers|12.9 : Random Numbers]]
** [[#Implementation-Parameters|12.10 : Implementation Parameters]]
* [[#Characters|13 : Characters]]
** [[#Character-Attributes|13.1 : Character Attributes]]
** [[#Predicates-on-Characters|13.2 : Predicates on Characters]]
** [[#Character-Construction-and-Selection|13.3 : Character Construction and Selection]]
** [[#Character-Conversions|13.4 : Character Conversions]]
* [[#Sequences|14 : Sequences]]
** [[#Simple-Sequence-Functions|14.1 : Simple Sequence Functions]]
** [[#Concatenating-Mapping-and-Reducing-Sequences|14.2 : Concatenating, Mapping and Reducing Sequences]]
** [[#Modifying-Sequences|14.3 : Modifying Sequences]]
** [[#Searching-Sequences-for-Terms|14.4 : Searching Sequences for Terms]]
** [[#Sorting-and-Merging|14.5 : Sorting and Merging]]
* [[#Lists-Chapter|15 : Lists]]
** [[#Conses|15.1 : Conses]]
** [[#Lists|15.2 : Lists]]
** [[#Alteration-of-List-Structure|15.3 : Alteration of List Structure]]
** [[#Substitution-of-Expressions|15.4 : Substitution of Expressions]]
** [[#Using-Lists-as-Sets|15.5 : Using Lists as Sets]]
** [[#Association-Lists|15.6 : Association Lists]]
* [[#Hash-Tables|16 : Hash Tables]]
** [[#Hash-Table-Functions|16.1 : Hash Table Functions]]
** [[#Primitive-Hash-Function|16.2 : Primitive Hash Function]]
* [[#Arrays|17 : Arrays]]
** [[#Vector-Creation|17.1 : Vector Creation]]
** [[#Vector-Access|17.2 : Vector Access]]
* [[#Strings|18 : Strings]]
** [[#String-Access|18.1 : String Access]]
** [[#String-Comparison|18.2 : String Comparison]]
** [[#String-Construction-and-Manipulation|18.3 : String Construction and Manipulation]]
* [[#Structures|19 : Structures]]
* [[#The-Evaluator|20 : The Evaluator]]
** [[#Run-Time-Evaluation-of-Forms|20.1 : Run-Time Evaluation of Forms]]
** [[#The-Top-Level-Loop|20.2 : The Top-Level Loop]]
* [[#Streams|21 : Streams]]
** [[#Standard-Streams|21.1 : Standard Streams]]
** [[#Creating-new-Streams|21.2 : Creating new Streams]]
** [[#Operations-on-Streams|21.3 : Operations on Streams]]
* [[#Input-Output|22 : Input/Output]]
** [[#Printed-Representation-of-SubL-Objects|22.1 : Printed Representation of SubL Objects]]
** [[#Macro-Characters|22.1.3 : Macro Characters]]
** [[#Standard-Dispatching-Macro-Character-Syntax|22.1.4 : Standard Dispatching Macro Character Syntax]]
** [[#The-Readtable|22.1.5 : The Readtable]]
** [[#What-the-Print-Function-Produces|22.1.6 : What the Print Function Produces]]
** [[#Input-from-Character-Streams|22.2.1 : Input from Character Streams]]
** [[#Input-from-Binary-Streams|22.2.2 : Input from Binary Streams]]
** [[#Output-to-Character-Streams|22.3.1 : Output to Character Streams]]
** [[#Output-to-Binary-Streams|22.3.2 : Output to Binary Streams]]
** [[#Formatted-Output-to-Character-Streams|22.3.3 : Formatted Output to Character Streams]]
* [[#File-System-Interface|23 : File System Interface]]
** [[#File-Names|23.1 : File Names]]
** [[#Opening-and-Closing-Files|23.2 : Opening and Closing Files]]
** [[#Renaming-Deleting-and-Other-File-Operations|23.3 : Renaming, Deleting and Other File Operations]]
** [[#Loading-Files|23.4 : Loading Files]]
** [[#Accessing-Directories|23.5 : Accessing Directories]]
* [[#Errors|24 : Errors]]
** [[#General-Error-Signalling-Functions|24.1 : General Error-Signalling Functions]]
** [[#Specialized-Error-Signalling-Forms-and-Macros|24.2 : Specialized Error-Signalling Forms and Macros]]
* [[#Miscellaneous-Features|25 : Miscellaneous Features]]
** [[#The-Compiler|25.1 : The Compiler]]
** [[#Debugging-Tools|25.3 : Debugging Tools]]
** [[#Time-Functions|25.4.1 : Time Functions]]
** [[#Identity-Function|25.5 : Identity Function]]
* [[#Common-Lisp-Object-System|28 : Common Lisp Object System]]
* [[#SubL-Specific-Features|SubL-Specific Features]]
** [[#Signals|SubL.1 : Signals]]
** [[#System-Properties|SubL.2 : System Properties]]
** [[#Progress-Pacifiers|SubL.3 : Progress Pacifiers]]
** [[#Process-Manipulation|SubL.4 : Process Manipulation]]
** [[#Memory-Interaction|SubL.5 : Memory Interaction]]
* [[#Index|Index]]

[[|]]

-----

= 1 : Introduction =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node5.html CLtL2 Reference]

SubL is a programming language intended to be very similar to a simplified version of Common Lisp where those features that are either complex, rarely-used, or difficult to implement in a prodecural language have been excised.

Unlike Common Lisp, SubL is not a purely functional language. Several SubL constructs can only be used procedurally. In order to emphasize this difference, the following naming convention for SubL constructs is used:

<blockquote>A SubL function will have the same name as the analogous Common Lisp function if it is intended to have the exact same basic functionality. The argument list may be simplified, but the intent and use are likely to be the same.
</blockquote>
If there is a substantial behavioral difference between a SubL function and its Common Lisp counterpart, its name will be the Common Lisp name prepended with a single character -- either "c", "p" or "f".

<blockquote>"c" indicates a construct that is either only procedural or functional. 
"p" indicates the procedural version of a Common Lisp construct. 
"f" indicates the functional version of a Common Lisp construct.
</blockquote>
A procedural construct in SubL is one which is suitable for evaluation as either one form in an explicit [[#FN-DEF-PROGN|<code>PROGN</code>]] or as one form in an implicit progn, which occur in the <code>&body;</code> sections of many of the procedural forms such as [[#FN-DEF-CLET|<code>CLET</code>]], [[#FN-DEF-PWHEN|<code>PWHEN</code>]], [[#FN-DEF-CDOLIST|<code>CDOLIST</code>]] etc.

Here is a table of all the procedural constructs in SubL and the Common Lisp analog:

<blockquote>'''SubL Procedural Construct'''

'''Common Lisp Equivalent'''

-----

<code>PROGN</code>

<code>progn</code>

<code>PIF</code>

<code>if</code>

<code>PWHEN</code>

<code>when</code>

<code>PUNLESS</code>

<code>unless</code>

<code>PCOND</code>

<code>cond</code>

<code>PCASE</code>

<code>case</code>

<code>CSETQ</code>

<code>setq</code>

<code>CSETF</code>

<code>setf</code>

<code>CINC</code>

<code>incf</code>

<code>CDEC</code>

<code>decf</code>

<code>CPUSH</code>

<code>push</code>

<code>CPUSHNEW</code>

<code>pushnew</code>

<code>CPOP</code>

<code>pop</code>

<code>CLET</code>

<code>let*</code>

<code>CMULTIPLE-VALUE-BIND</code>

<code>multiple-value-bind</code>

<code>CDO</code>

<code>do*</code>

<code>CDOLIST</code>

<code>dolist</code>

<code>CSOME</code>

` `

<code>CDOTIMES</code>

<code>dotimes</code>

<code>CDOHASH</code>

` `

<code>CCATCH</code>

<code>catch</code>

<code>CUNWIND-PROTECT</code>

<code>unwind-protect</code>

<code>RET</code>

<code>return-from</code>
</blockquote>
A functional construct in SubL is one which returns a value. Here is a table of all the functional constructs in SubL and the Common Lisp analog:

<blockquote>'''SubL Functional Construct'''

'''Common Lisp Equvalent'''

-----

<code>CAND</code>

<code>and</code>

<code>COR</code>

<code>or</code>

<code>CNOT</code>

<code>not</code>

<code>FIF</code>

<code>if</code>

<code>FWHEN</code>

<code>when</code>

<code>FUNLESS</code>

<code>unless</code>
</blockquote>
The body of a function or macro definition is considered an implicit progn, and so all forms in the body should be procedural. A function call can be used as a procedural construct. In this case, the returned value is simply ignored. [[|]]

-----

= 2 : Data Types =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node15.html CLtL2 Reference]

SubL has a flat type heirarchy. Each type is described in more detail in the sections about the methods for that particular type.

SubL supports these built-in Common Lisp datatypes:

<blockquote><table>
<colgroup>
<col width="50%" />
<col width="50%" />
</colgroup>
<tbody>
<tr class="odd">
<td align="left">Numbers:</td>
<td align="left">fixnum</td>
</tr>
<tr class="even">
<td align="left"></td>
<td align="left">float</td>
</tr>
<tr class="odd">
<td align="left">Symbols:</td>
<td align="left">symbol</td>
</tr>
<tr class="even">
<td align="left">Lists:</td>
<td align="left">cons</td>
</tr>
<tr class="odd">
<td align="left">Arrays:</td>
<td align="left">vector</td>
</tr>
<tr class="even">
<td align="left">Characters:</td>
<td align="left">character</td>
</tr>
<tr class="odd">
<td align="left">Strings:</td>
<td align="left">string</td>
</tr>
<tr class="even">
<td align="left">Hashtables:</td>
<td align="left">eq hashtable</td>
</tr>
<tr class="odd">
<td align="left"></td>
<td align="left">eql hashtable</td>
</tr>
<tr class="even">
<td align="left"></td>
<td align="left">equal hashtable</td>
</tr>
<tr class="odd">
<td align="left"></td>
<td align="left">equalp hashtable</td>
</tr>
<tr class="even">
<td align="left">Streams:</td>
<td align="left">stream</td>
</tr>
<tr class="odd">
<td align="left">Functions:</td>
<td align="left">function</td>
</tr>
</tbody>
</table>
SubL does '''not''' support these Common Lisp datatypes:
</blockquote>
<blockquote>Multi-dimensional arrays 
Packages 
Pathnames 
Random-states 
Lambda-Expressions or Closures
</blockquote>
SubL has only special-case support for these datatypes:

<blockquote>{|
| Readtables:
| SubL only supports a single internal readtable
|}

New data types can be introduced via [[#FN-DEF-DEFSTRUCT|<code>DEFSTRUCT</code>]]. [[|]]
</blockquote>

-----

= 3 : Scope and Extent =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node43.html CLtL2 Reference]

Special variables in SubL are all (and only) those variables defined globally with [[#FN-DEF-DEFVAR|<code>DEFVAR</code>]] or [[#FN-DEF-DEFPARAMETER|<code>DEFPARAMETER</code>]]. In addition, the name of each special variable must begin and end with an asterisk character : <code>'*'</code>.

Special variables have indefinite scope and dynamic extent. All other variables have lexical scope and dynamic extent

Variables are introduced via:

'''Function call''' 
A new set of variables for the formal parameters of the function are introduced. The extent of the function arguments is the duration of the function invocation.

'''[[#FN-DEF-CLET|<code>CLET</code>]], [[#FN-DEF-CMULTIPLE-VALUE-BIND|<code>CMULTIPLE-VALUE-BIND</code>]], [[#FN-DEF-CDESTRUCTURING-BIND|<code>CDESTRUCTURING-BIND</code>]]''' 
These constructs explicitly introduce and initialize new local variables. The extent of these variables is until exit from the constuct.

'''[[#FN-DEF-CDO|<code>CDO</code>]], [[#FN-DEF-CDOLIST|<code>CDOLIST</code>]], [[#FN-DEF-CSOME|<code>CSOME</code>]], [[#FN-DEF-CDOTIMES|<code>CDOTIMES</code>]], [[#FN-DEF-CDOHASH|<code>CDOHASH</code>]]''' 
These iteration constructs explicitly introduce and update local variables which represent the state of the iteration. The extent of these variables is until exit from the iteration construct.

When a local variable is introduced with the same name as a local variable which is already within the current scope and extent, the new variable shadows the outer variable.

The initialization of a local variable is considered to occur within the scope of the new local variable. Consequently, a variable which is shadowing an outer variable cannot be initialized in terms of the outer value. For example, this is not allowed :

<blockquote><pre>(define foo (x)
(clet ((x (+ x 1)))
(print x))
(ret nil))</pre></blockquote>
However, if the variable is a special variable, the [[#FN-DEF-CLET|<code>CLET</code>]] is actually introducing a binding for the special variable, not introducing a new local variable. In this case, the initialization of the binding can be a function of its current value for the variable being bound. For example, this is allowed:

<blockquote><pre>(defvar *some-var* 1)

(define foo (x)
(clet ((*some-var* (+ *some-var* x)))
(print *some-var*))
(ret nil))</pre></blockquote>
The construct [[#FN-DEF-RET|<code>RET</code>]] must be used for a function or macro definition to return its intended result. [[|]]

-----

= 4 : Type Specifiers =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node44.html CLtL2 Reference]

SubL does not support type specifiers. [[|]]

-----

= 5 : Program Structure =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node55.html CLtL2 Reference]

Program structure in SubL mirrors that of Common Lisp almost exactly. All objects except lists and symbols are self-evaluating. This includes numbers, characters, strings, vectors and hashtables. In addition :

* Keyword symbols are self-evaluating.
* The symbols T and NIL are self-evaluating.

[[|]]

== 5.3.1 : Defining Named Functions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node66.html CLtL2 Reference] 
[[|]]macro <code>DEFINE : (name arglist &body body)</code>

All functions in SubL must be named and therefore defined via the SubL construct [[#FN-DEF-DEFINE|<code>DEFINE</code>]]. See also the similar construct [[#FN-DEF-DEFPOLYMORPHIC|<code>DEFPOLYMORPHIC</code>]] which is used to define generic functions which switch off the type of the first argument.

Argument lists for user-defined function can only be of this form:

<blockquote><pre>( {var}* [&optional; {var | ( var [initform [supplied-var]] ) }*] )</pre></blockquote>
In short, SubL supports <code>&optional;</code> arguments for user-defined functions but does '''not''' support <code>&keyword;</code>, <code>&aux;</code> or <code>&rest;</code> arguments for user-defined functions. [[|]]

== 5.3.2 : Declaring Global Variables and Named Constants ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node67.html CLtL2 Reference] 
[[|]]macro <code>DEFVAR : (variable &optional initialization documentation)</code> 
[[|]]macro <code>DEFPARAMETER : (variable initialization &optional documentation)</code>

[[#FN-DEF-DEFVAR|<code>DEFVAR</code>]] and [[#FN-DEF-DEFPARAMETER|<code>DEFPARAMETER</code>]] are the SubL constructs used to define global variables. The name of each variable must begin and end with an asterisk.

SubL enforces an important distinction between these two constructs, which is described in greater detail under [[#FN-DEF-WRITE-IMAGE|<code>WRITE-IMAGE</code>]]. 
[[|]]macro <code>DEFCONSTANT : (variable initialization &optional documentation)</code>

As with [[#FN-DEF-DEFVAR|<code>DEFVAR</code>]] and [[#FN-DEF-DEFPARAMETER|<code>DEFPARAMETER</code>]], the name of each named constant defined via [[#FN-DEF-DEFCONSTANT|<code>DEFCONSTANT</code>]] must begin and end with an asterisk. [[|]]

-----

= 6 : Predicates =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node69.html CLtL2 Reference] [[|]]

== 6.1 : Logical Values ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node70.html CLtL2 Reference]

The symbols NIL and T are used to represent the logical values "true" and "false" in SubL and behave exactly as they do in Common Lisp. [[|]]

== 6.2.2 : Specific Data Type Predicates ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node73.html CLtL2 Reference]

For the most part, the following predicates which check for specific data types behave exactly as they do in Common Lisp. 
[[|]]function <code>NULL : (x)</code> 
[[|]]function <code>SYMBOLP : (x)</code> 
[[|]]function <code>ATOM : (x)</code> 
[[|]]function <code>CONSP : (x)</code> 
[[|]]function <code>LISTP : (x)</code> 
[[|]]function <code>NUMBERP : (x)</code> 
[[|]]function <code>INTEGERP : (x)</code> 
[[|]]function <code>FLOATP : (x)</code> 
[[|]]function <code>CHARACTERP : (x)</code> 
[[|]]function <code>STRINGP : (x)</code> 
[[|]]function <code>VECTORP : (x)</code> 
[[|]]function <code>FUNCTIONP : (x)</code> 
Follows the CLtL2 implementation 
[[|]]function <code>FUNCTION-SPEC-P : (x)</code> 
Returns T IFF x is an object suitable for FUNCALL

In SubL, [[#FN-DEF-FUNCTIONP|<code>FUNCTIONP</code>]] only returns T if its argument is a function object. The function [[#FN-DEF-FUNCTION-SPEC-P|<code>FUNCTION-SPEC-P</code>]] returns T if its argument is suitable for [[#FN-DEF-FUNCALL|<code>FUNCALL</code>]] or [[#FN-DEF-APPLY|<code>APPLY</code>]]. [[|]]

== 6.3 : Equality Predicates ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node74.html CLtL2 Reference]

The SubL equality predicates behave exactly like their Common Lisp counterparts. 
[[|]]function <code>EQ : (x y)</code> 
[[|]]function <code>EQL : (x y)</code> 
[[|]]function <code>EQUAL : (x y)</code> 
[[|]]function <code>EQUALP : (x y)</code> [[|]]

== 6.4 : Logical Operators ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node75.html CLtL2 Reference]

SubL logical operations '''only''' return T or NIL. Otherwise, they behave like their Common Lisp counterparts. 
[[|]]macro <code>CNOT : (x)</code> 
[[|]]macro <code>CAND : (&rest args)</code> 
[[|]]macro <code>COR : (&rest args)</code> [[|]]

-----

= 7 : Control Structure =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node76.html CLtL2 Reference] [[|]]

== 7.1.1 : Reference ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node78.html CLtL2 Reference]

These SubL constructs behave exactly like their Common Lisp counterparts. 
[[|]]function <code>QUOTE : (data)</code> 
[[|]]macro <code>FUNCTION : (fspec)</code> 
[[|]]function <code>SYMBOL-VALUE : (x)</code> 
[[|]]function <code>SYMBOL-FUNCTION : (x)</code> 
[[|]]function <code>BOUNDP : (x)</code> 
[[|]]function <code>FBOUNDP : (x)</code> [[|]]

== 7.1.2 : Assignment ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node79.html CLtL2 Reference] 
[[|]]macro <code>CSETQ : (var value &rest var-val-pairs)</code>

Since [[#FN-DEF-CSETQ|<code>CSETQ</code>]] is procedural in SubL, it does not return a value. Otherwise, it behaves just like <code>setq</code> in Common Lisp.

These SubL functions for setting and unsetting symbol properties behave like their Common Lisp counterparts. 
[[|]]function <code>SET : (symbol value)</code> 
[[|]]function <code>MAKUNBOUND : (symbol)</code> 
[[|]]function <code>FMAKUNBOUND : (symbol)</code> [[|]]

== 7.2 : Generalized Variables ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node80.html CLtL2 Reference] 
[[|]]macro <code>CSETF : (place val)</code>

[[#FN-DEF-CSETF|<code>CSETF</code>]] is a more restricted version of <code>setf</code> in Common Lisp. First, since it is procedural, like [[#FN-DEF-CSETQ|<code>CSETQ</code>]] it does not return a value. Second, there is a much more restricted set of place-specifiers which are allowable. Here is a complete table of the allowable [[#FN-DEF-CSETF|<code>CSETF</code>]] forms, and their equivalent SubL expansions:

'''CSETF form'''

'''Equivalent SubL expansion'''

-----

<code>(CSETF</code> variable value''')'''

<code>(CSETQ</code> variable value''')'''

<code>(CSETF</code> ([[#FN-DEF-AREF|<code>AREF</code>]] vector n''')''' value''')'''

<code>(SET-AREF</code> vector n value''')'''

<code>(CSETF</code> ([[#FN-DEF-NTH|<code>NTH</code>]] n list''')''' value''')'''

<code>(SET-NTH</code> n list value''')'''

<code>(CSETF</code> ([[#FN-DEF-CAR|<code>CAR</code>]] cons''')''' value''')'''

<code>(RPLACA</code> cons value''')'''

<code>(CSETF</code> ([[#FN-DEF-CDR|<code>CDR</code>]] cons''')''' value''')'''

<code>(RPLACD</code> cons value''')'''

<code>(CSETF</code> ([[#FN-DEF-GET|<code>GET</code>]] symbol indicator''')''' value''')'''

<code>(PUT</code> symbol indicator value''')'''

<code>(CSETF</code> ([[#FN-DEF-GETHASH|<code>GETHASH</code>]] key hashtable''')''' value''')'''

<code>(SETHASH</code> key hashtable value''')'''

<code>(CSETF</code> ([[#FN-DEF-SYMBOL-VALUE|<code>SYMBOL-VALUE</code>]] symbol''')''' value''')'''

<code>(SET</code> symbol value''')'''

<code>(CSETF</code> (defstruct-slot object''')''' value''')'''

<code>(set-defstruct-slot object value)</code>

In the above table, '''defstruct-slot''' refers to any structure slot accessor function which got defined via defstruct, and '''set-defstruct-slot''' refers to the corresponding setter function for the given accessor. [[|]]

== 7.3 : Function Invocation ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node81.html CLtL2 Reference]

These functions behave like their Common Lisp counterparts. 
[[|]]function <code>APPLY : (function argument &rest arguments)</code> 
[[|]]function <code>FUNCALL : (function &rest args)</code>

The first argument to both [[#FN-DEF-APPLY|<code>APPLY</code>]] and [[#FN-DEF-FUNCALL|<code>FUNCALL</code>]] must satisfy [[#FN-DEF-FUNCTION-SPEC-P|<code>FUNCTION-SPEC-P</code>]]. [[|]]

== 7.4 : Simple Sequencing ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node82.html CLtL2 Reference] 
[[|]]macro <code>PROGN : (&body body)</code>

In SubL, [[#FN-DEF-PROGN|<code>PROGN</code>]] is procedural and therefore does not return a value. Since it is intended to be essentially procedural in Common Lisp as well, the same name is used even though they have slightly different semantics. [[|]]

== 7.5 : Establishing New Variable Bindings ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node83.html CLtL2 Reference] 
[[|]]macro <code>CLET : (bindings &body body)</code>

The SubL construct [[#FN-DEF-CLET|<code>CLET</code>]] can be used to introduce new local variables or bind special variables. The variables are initialized in order just like <code>LET*</code> in Common Lisp. Since it is procedural, it does not return a value.

SubL has no counterpart to Common Lisp's <code>LET</code> construct. 
[[|]]macro <code>CPROGV : (special-vars bindings &body body)</code>

[[#FN-DEF-CPROGV|<code>CPROGV</code>]] is procedural and therefore does not return a value. Otherwise, it is equivalent to <code>progv</code> in Common Lisp. [[|]]

== 7.6 : Conditionals ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node84.html CLtL2 Reference] 
[[|]]macro <code>PIF : (condition action else-action)</code> 
[[|]]macro <code>PWHEN : (condition &body body)</code> 
[[|]]macro <code>PUNLESS : (condition &body body)</code>

[[#FN-DEF-PIF|<code>PIF</code>]], [[#FN-DEF-PWHEN|<code>PWHEN</code>]] and [[#FN-DEF-PUNLESS|<code>PUNLESS</code>]] are the SubL procedural variants of <code>if</code>, <code>when</code> and <code>unless</code> from Common Lisp. For each, the condition argument must be a functional construct. Also, [[#FN-DEF-PIF|<code>PIF</code>]] takes exactly three arguments, making the action and else-actions identical in form. 
[[|]]macro <code>FIF : (condition true-value false-value)</code> 
[[|]]macro <code>FWHEN : (condition true-value)</code> 
[[|]]macro <code>FUNLESS : (condition false-value)</code>

[[#FN-DEF-FIF|<code>FIF</code>]], [[#FN-DEF-FWHEN|<code>FWHEN</code>]] and [[#FN-DEF-FUNLESS|<code>FUNLESS</code>]] are the SubL functional variants of <code>if</code>, <code>when</code> and <code>unless</code> from Common Lisp. 
[[|]]macro <code>PCOND : (&rest clauses)</code> 
[[|]]macro <code>PCASE : (test-object &body clauses)</code>

[[#FN-DEF-PCOND|<code>PCOND</code>]] and [[#FN-DEF-PCASE|<code>PCASE</code>]] are the SubL procedural equivalents of <code>cond</code> and <code>case</code> from Common Lisp. [[|]]

== 7.7 : Blocks and Exits ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node85.html CLtL2 Reference] 
[[|]]macro <code>RET : (expression)</code> 
SubL functions must always return a value, since C functions must return values and all SubL functions must translate into C.

[[#FN-DEF-RET|<code>RET</code>]] is used to return a value from a function or macro definition. All functions and macro definitions behave as if an implicit

<blockquote><pre>(ret nil)</pre></blockquote>
appears at the very end of each function. [[|]]

== 7.8.2 : General Iteration ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node88.html CLtL2 Reference] 
[[|]]macro <code>CDO : (vars endtest &body body)</code> 
cdo is procedural. It binds its variables in sequence, as with CommonLisp do* [[|]]

== 7.8.3 : Simple Iteration Constructs ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node89.html CLtL2 Reference] 
[[|]]macro <code>CDOLIST : ((var listform) &body body)</code> 
[[|]]macro <code>CSOME : ((var list endvar) &body body)</code> 
[[|]]macro <code>CDOTIMES : ((var integer) &body body)</code> 
[[|]]macro <code>CDOHASH : ((key val table) &body body)</code> [[|]]

== 7.8.4 : Mapping ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node90.html CLtL2 Reference] 
[[|]]function <code>MAPCAR : (function list &rest more-lists)</code> 
[[|]]function <code>MAPLIST : (function list &rest more-lists)</code> 
[[|]]function <code>MAPC : (function list &rest more-lists)</code> 
[[|]]function <code>MAPL : (function list &rest more-lists)</code> 
[[|]]function <code>MAPCAN : (function list &rest more-lists)</code> 
[[|]]function <code>MAPCON : (function list &rest more-lists)</code> [[|]]

== 7.10.1 : Constructs for Handling Multiple Values ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node94.html CLtL2 Reference] 
[[|]]function <code>VALUES : (value &rest more-values)</code> 
values returns its args such that they can be bound in a dynamically enclosing multiple-value-bind. The first value is returned as well, since all SubL functions must return a value. 
[[|]]variable <code>*MULTIPLE-VALUES-LIMIT*</code> 
[[|]]macro <code>MULTIPLE-VALUE-LIST : (form)</code> 
[[|]]macro <code>CMULTIPLE-VALUE-BIND : (vars value &body body)</code> [[|]]

== 7.10.2 : Rules Governing the Passing of Multiple Values ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node95.html CLtL2 Reference]

In SubL, multiple values are governed the same way that they are in Common Lisp, except that if ANY of the return statements in your function are (values ...) then all of them must be. [[|]]

== 7.11 : Dynamic Non-Local Exits ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node96.html CLtL2 Reference] 
[[|]]macro <code>CCATCH : (tag ans-var &body body)</code> 
ccatch is procedural, and so does not return values. 
[[|]]macro <code>CUNWIND-PROTECT : (protected-form &body body)</code> 
[[|]]function <code>THROW : (tag result)</code> [[|]]

-----

= 8 : Macros =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node97.html CLtL2 Reference] [[|]]

== 8.1 : Macro Definition ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node98.html CLtL2 Reference] 
[[|]]macro <code>DEFMACRO : (name pattern &body body)</code>

SubL Macros are expanded at translation-time. Full Common Lisp macro support is available. However, the macro-expander must use [[#FN-DEF-RET|<code>RET</code>]] to return the expansion. [[|]]

== 8.3 : Destructuring ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node100.html CLtL2 Reference] 
[[|]]macro <code>CDESTRUCTURING-BIND : (pattern datum &body body)</code> [[|]]

== 8.5 : Environments ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node102.html CLtL2 Reference] 
[[|]]function <code>VARIABLE-INFORMATION : (variable)</code> 
[[|]]function <code>FUNCTION-INFORMATION : (function)</code> [[|]]

-----

= 9 : Declarations =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node103.html CLtL2 Reference] [[|]]

== 9.1 : Declaration Syntax ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node104.html CLtL2 Reference] 
[[|]]function <code>DECLARE : (&rest ignore)</code> 
[[|]]function <code>PROCLAIM : (declaration-specifier)</code> 
[[|]]macro <code>DECLAIM : (&rest declaration-specifiers)</code> [[|]]

== 9.2 : Declaration Specifiers ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node105.html CLtL2 Reference] 
[[|]]function <code>IGNORE : (&rest values)</code>

The [[#FN-DEF-IGNORE|<code>IGNORE</code>]] function can be used to indicate that a particular variable's value is not used. [[|]]

-----

= 10 : Symbols =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node107.html CLtL2 Reference] 
[[|]]function <code>SYMBOLP : (x)</code> [[|]]

== 10.1 : The Property List ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node108.html CLtL2 Reference] 
[[|]]function <code>GET : (symbol indicator &optional default)</code> 
[[|]]function <code>PUT : (symbol indicator new-value)</code> 
[[|]]function <code>REMPROP : (symbol indicator)</code> 
[[|]]function <code>SYMBOL-PLIST : (symbol)</code> [[|]]

== 10.2 : The Print Name ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node109.html CLtL2 Reference] 
[[|]]function <code>SYMBOL-NAME : (symbol)</code> 
Returns the string which is the name of SYMBOL. When called on a keyword, it returns the ":" prefix as part of the name [[|]]

== 10.3 : Creating Symbols ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node110.html CLtL2 Reference] 
[[|]]function <code>MAKE-SYMBOL : (print-name)</code> 
[[|]]function <code>GENSYM : (&optional x)</code> 
GENSYM returns new, interned symbols, which are combinations of a string prefix and a numeric suffix. It guarantees that the new symbol was not previously interned. 
If the argument X is a number, the gensym counter (used to generate the suffix) is set to X before the new symbol is generated. 
if the argument X is a string, the gensym prefix is set to X before the new symbol is generated. 
The initial gensym counter value is 1 and the initial gensym prefix is 'G'. 
[[|]]function <code>GENTEMP : (&optional (prefix "T"))</code> 
[[|]]function <code>KEYWORDP : (x)</code> 
In SubL, which does not have packages, keywords are any symbol whose name begins with ":" [[|]]

-----

= 11 : Packages =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node111.html CLtL2 Reference] 
[[|]]macro <code>IN-PACKAGE : (name)</code> 
[[|]]function <code>INTERN : (string)</code> 
Finds and returns a symbol whose name is STRING. INTERN will create the symbol if it does not exist. Unlike Common LISP intern, the SubL version does not allow an argument to specify the package, since SubL does not support packages. 
[[|]]function <code>FIND-SYMBOL : (string)</code> 
Finds and returns a symbol whose name is STRING. Unlike Common LISP FIND-SYMBOL, the SubL version does not allow an argument to specify the package, since SubL does not support packages. [[|]]

-----

= 12 : Numbers =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node121.html CLtL2 Reference]

SubL only supports fixnums and floats. Fixnums have at least 28 bits of precision. 
[[|]]function <code>NUMBERP : (x)</code> 
[[|]]function <code>FIXNUMP : (x)</code> 
[[|]]function <code>INTEGERP : (x)</code> 
[[|]]function <code>FLOATP : (x)</code> [[|]]

== 12.2 : Predicates on Numbers ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node123.html CLtL2 Reference] 
[[|]]function <code>ZEROP : (x)</code> 
[[|]]function <code>PLUSP : (x)</code> 
[[|]]function <code>MINUSP : (x)</code> 
[[|]]function <code>ODDP : (x)</code> 
[[|]]function <code>EVENP : (x)</code> [[|]]

== 12.3 : Comparisons on Numbers ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node124.html CLtL2 Reference] 
[[|]]function <code>= : (num1 num2)</code> 
[[|]]function <code>/= : (num1 num2)</code> 
[[|]]function <code>< : (num1 num2)</code> 
[[|]]function <code>> : (num1 num2)</code> 
[[|]]function <code><= : (num1 num2)</code> 
[[|]]function <code>>= : (num1 num2)</code>

The above numeric comparison functions take exactly 2 arguments, unlike their Common Lisp counterparts which take variable numbers of arguments. 
[[|]]function <code>MAX : (num &rest numbers)</code> 
[[|]]function <code>MIN : (num &rest numbers)</code> [[|]]

== 12.4 : Arithmetic Operations ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node125.html CLtL2 Reference] 
[[|]]function <code>+ : (&rest numbers)</code> 
[[|]]function <code>- : (num &rest numbers)</code> 
[[|]]function <code>* : (&rest numbers)</code> 
[[|]]function <code>/ : (num &rest numbers)</code> 
[[|]]function <code>INT/ : (num1 num2)</code> 
[[|]]macro <code>CINC : (place &optional (delta 1))</code> 
[[|]]macro <code>CDEC : (place &optional (delta 1))</code> [[|]]

== 12.5 : Irrational and Transcendental Functions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node126.html CLtL2 Reference]

SubL does not currently support any irrational, transcendental or trigonometric functions. [[|]]

== 12.6 : Type Conversions and Component Extractions on Numbers ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node130.html CLtL2 Reference] 
[[|]]function <code>FLOAT : (x)</code> 
[[|]]function <code>FLOOR : (x)</code> 
[[|]]function <code>CEILING : (x)</code> 
[[|]]function <code>TRUNCATE : (x)</code> 
[[|]]function <code>ROUND : (x)</code> 
[[|]]function <code>MOD : (number divisor)</code> 
[[|]]function <code>REM : (number divisor)</code> 
[[|]]function <code>SCALE-FLOAT : (float integer)</code> 
[[|]]function <code>INTEGER-DECODE-FLOAT : (float)</code> [[|]]

== 12.7 : Logical Operations on Numbers ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node131.html CLtL2 Reference]

SubL does not currently support any logical operations on numbers. [[|]]

== 12.8 : Byte Manipulation Functions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node132.html CLtL2 Reference] 
[[|]]macro <code>BYTE : (size position)</code> 
[[|]]function <code>LDB : (bytespec integer)</code> 
[[|]]function <code>DPB : (newbyte bytespec integer)</code> [[|]]

== 12.9 : Random Numbers ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node133.html CLtL2 Reference] 
[[|]]variable <code>*RAND-MAX*</code> 
*rand-max* is the largest fixnum that the function random can accept. 
[[|]]function <code>SEED-RANDOM : (&optional (seed-fixnum (mod (get-internal-real-time) *rand-max*)))</code> 
If seed-fixnum is omitted to seed-random, the internal clock is used 
in an implementation specific manner. 
[[|]]function <code>RANDOM : (number)</code> [[|]]

== 12.10 : Implementation Parameters ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node134.html CLtL2 Reference] 
[[|]]variable <code>*MOST-POSITIVE-FIXNUM*</code> 
[[|]]variable <code>*MOST-NEGATIVE-FIXNUM*</code> [[|]]

-----

= 13 : Characters =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node135.html CLtL2 Reference] 
[[|]]function <code>CHARACTERP : (x)</code> [[|]]

== 13.1 : Character Attributes ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node136.html CLtL2 Reference]

SubL does not currently support any attributes for characters. A character exists for each ASCII character code between 0 and 255 inclusive. Thus, the SubL equivalent of Common Lisp's <code>CHAR-CODE-LIMIT</code> is 256. [[|]]

== 13.2 : Predicates on Characters ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node137.html CLtL2 Reference] 
[[|]]function <code>ALPHA-CHAR-P : (char)</code> 
[[|]]function <code>UPPER-CASE-P : (char)</code> 
[[|]]function <code>LOWER-CASE-P : (char)</code> 
[[|]]function <code>BOTH-CASE-P : (char)</code> 
[[|]]function <code>DIGIT-CHAR-P : (char)</code> 
[[|]]function <code>ALPHANUMERICP : (char)</code> 
[[|]]function <code>CHAR= : (char1 char2)</code> 
[[|]]function <code>CHAR/= : (char1 char2)</code> 
[[|]]function <code>CHAR< : (char1 char2)</code> 
[[|]]function <code>CHAR> : (char1 char2)</code> 
[[|]]function <code>CHAR<= : (char1 char2)</code> 
[[|]]function <code>CHAR>= : (char1 char2)</code> 
[[|]]function <code>CHAR-EQUAL : (char1 char2)</code> 
[[|]]function <code>CHAR-NOT-EQUAL : (char1 char2)</code> 
[[|]]function <code>CHAR-LESSP : (char1 char2)</code> 
[[|]]function <code>CHAR-GREATERP : (char1 char2)</code> 
[[|]]function <code>CHAR-NOT-GREATERP : (char1 char2)</code> 
[[|]]function <code>CHAR-NOT-LESSP : (char1 char2)</code> [[|]]

== 13.3 : Character Construction and Selection ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node138.html CLtL2 Reference] 
[[|]]function <code>CHAR-CODE : (char)</code> 
[[|]]function <code>CODE-CHAR : (code)</code> [[|]]

== 13.4 : Character Conversions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node139.html CLtL2 Reference] 
[[|]]function <code>CHAR-DOWNCASE : (char)</code> 
[[|]]function <code>CHAR-UPCASE : (char)</code> [[|]]

-----

= 14 : Sequences =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node141.html CLtL2 Reference] 
[[|]]function <code>SEQUENCEP : (x)</code> [[|]]

== 14.1 : Simple Sequence Functions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node142.html CLtL2 Reference] 
[[|]]function <code>ELT : (sequence index)</code> 
[[|]]function <code>SUBSEQ : (sequence start &optional end)</code> 
[[|]]function <code>COPY-SEQ : (sequence)</code> 
[[|]]function <code>LENGTH : (sequence)</code> 
[[|]]function <code>REVERSE : (sequence)</code> 
[[|]]function <code>NREVERSE : (sequence)</code> [[|]]

== 14.2 : Concatenating, Mapping and Reducing Sequences ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node143.html CLtL2 Reference] 
[[|]]function <code>CCONCATENATE : (seq &rest more-seqs)</code> 
[[|]]function <code>CREDUCE : (function sequence &optional (start 0) end (init-value :none))</code> [[|]]

== 14.3 : Modifying Sequences ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node144.html CLtL2 Reference] 
[[|]]function <code>FILL : (sequence item &optional (start 0) (end (length sequence)))</code> 
[[|]]function <code>REPLACE : (sequence1 sequence2 &optional (start1 0) end1 (start2 0) end2)</code> 
[[|]]function <code>REMOVE : (item sequence &optional (test #'eql) (key #'identity) (start 0) end count)</code> 
[[|]]function <code>REMOVE-IF : (test sequence &optional (key #'identity) (start 0) end count)</code> 
[[|]]function <code>DELETE : (item sequence &optional (test #'eql) (key #'identity) (start 0) end count)</code> 
[[|]]function <code>DELETE-IF : (test sequence &optional (key #'identity) (start 0) end count)</code> 
[[|]]function <code>REMOVE-DUPLICATES : (sequence &optional (test #'eql) (key #'identity) (start 0) end)</code> 
[[|]]function <code>DELETE-DUPLICATES : (sequence &optional (test #'eql) (key #'identity) (start 0) end)</code> 
[[|]]function <code>SUBSTITUTE : (new old sequence &optional (test #'eql) (key #'identity) (start 0) end count)</code> 
[[|]]function <code>SUBSTITUTE-IF : (new test sequence &optional (key #'identity) (start 0) end count)</code> 
[[|]]function <code>NSUBSTITUTE : (new old sequence &optional (test #'eql) (key #'identity) (start 0) end count)</code> 
[[|]]function <code>NSUBSTITUTE-IF : (new test sequence &optional (key #'identity) (start 0) end count)</code> [[|]]

== 14.4 : Searching Sequences for Terms ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node145.html CLtL2 Reference] 
[[|]]function <code>FIND : (item seq &optional (test #'eql) (key #'identity) (start 0) end)</code> 
[[|]]function <code>FIND-IF : (test seq &optional (key #'identity) (start 0) end)</code> 
[[|]]function <code>POSITION : (item seq &optional (test #'eql) (key #'identity) (start 0) end)</code> 
[[|]]function <code>POSITION-IF : (test seq &optional (key #'identity) (start 0) end)</code> 
[[|]]function <code>COUNT : (item seq &optional (test #'eql) (key #'identity) (start 0) end)</code> 
[[|]]function <code>COUNT-IF : (test seq &optional (key #'identity) (start 0) end)</code> 
[[|]]function <code>MISMATCH : (seq1 seq2 &optional (test #'eql) (key #'identity) (start1 0) end1 (start2 0) end2)</code> 
[[|]]function <code>SEARCH : (seq1 seq2 &optional (test #'eql) (key #'identity) (start1 0) end1 (start2 0) end2)</code> [[|]]

== 14.5 : Sorting and Merging ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node146.html CLtL2 Reference] 
[[|]]function <code>SORT : (seq predicate &optional (key #'identity))</code> 
[[|]]function <code>STABLE-SORT : (seq predicate &optional (key #'identity))</code> 
[[|]]function <code>CMERGE : (seq1 seq2 predicate &optional (key #'identity))</code> [[|]]

-----

= 15 : Lists =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node147.html CLtL2 Reference] 
[[|]]function <code>LISTP : (x)</code> 
[[|]]function <code>CONSP : (x)</code> 
[[|]]function <code>ATOM : (x)</code> [[|]]

== 15.1 : Conses ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node148.html CLtL2 Reference] 
[[|]]function <code>CAR : (cons)</code> 
[[|]]function <code>CDR : (cons)</code> 
[[|]]function <code>CAAR : (cons)</code> 
[[|]]function <code>CADR : (cons)</code> 
[[|]]function <code>CDAR : (cons)</code> 
[[|]]function <code>CDDR : (cons)</code> 
[[|]]function <code>CONS : (car cdr)</code> 
[[|]]function <code>TREE-EQUAL : (tree1 tree2 &optional (test #'eql))</code> [[|]]

== 15.2 : Lists ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node149.html CLtL2 Reference] 
[[|]]function <code>ENDP : (object)</code> 
[[|]]function <code>LIST-LENGTH : (list)</code> 
[[|]]function <code>NTH : (n list)</code> 
[[|]]function <code>FIRST : (list)</code> 
[[|]]function <code>SECOND : (list)</code> 
[[|]]function <code>THIRD : (list)</code> 
[[|]]function <code>FOURTH : (list)</code> 
[[|]]function <code>FIFTH : (list)</code> 
[[|]]function <code>SIXTH : (list)</code> 
[[|]]function <code>SEVENTH : (list)</code> 
[[|]]function <code>EIGHTH : (list)</code> 
[[|]]function <code>NINTH : (list)</code> 
[[|]]function <code>TENTH : (list)</code> 
[[|]]function <code>REST : (list)</code> 
[[|]]function <code>NTHCDR : (n list)</code> 
[[|]]function <code>LAST : (list &optional (n 1))</code> 
[[|]]function <code>LIST : (&rest objects)</code> 
[[|]]function <code>LIST* : (arg &rest objects)</code> 
[[|]]function <code>MAKE-LIST : (size &optional initial-element)</code> 
[[|]]function <code>APPEND : (&rest lists)</code> 
[[|]]function <code>COPY-LIST : (list)</code> 
[[|]]function <code>COPY-ALIST : (list)</code> 
[[|]]function <code>COPY-TREE : (tree)</code> 
[[|]]function <code>REVAPPEND : (list1 list2)</code> 
[[|]]function <code>NCONC : (&rest lists)</code> 
[[|]]function <code>NRECONC : (list1 list2)</code> 
[[|]]macro <code>CPUSH : (item place)</code> 
[[|]]macro <code>CPUSHNEW : (item place &optional (test '#'eql) (key '#'identity))</code> 
[[|]]macro <code>CPOP : (place)</code> 
[[|]]function <code>BUTLAST : (list &optional (n 1))</code> 
[[|]]function <code>NBUTLAST : (list &optional (n 1))</code> 
[[|]]function <code>LDIFF : (list sublist)</code> [[|]]

== 15.3 : Alteration of List Structure ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node150.html CLtL2 Reference] 
[[|]]function <code>RPLACA : (cons newcar)</code> 
[[|]]function <code>RPLACD : (cons newcdr)</code> 
[[|]]function <code>SET-NTH : (n list value)</code> [[|]]

== 15.4 : Substitution of Expressions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node151.html CLtL2 Reference] 
[[|]]function <code>SUBST : (new old tree &optional (test #'eql) (key #'identity))</code> 
[[|]]function <code>SUBST-IF : (new test tree &optional (key #'identity))</code> 
[[|]]function <code>NSUBST : (new old tree &optional (test #'eql) (key #'identity))</code> 
[[|]]function <code>NSUBST-IF : (new test tree &optional (key #'identity))</code> 
[[|]]function <code>SUBLIS : (alist tree &optional (test #'eql) (key #'identity))</code> 
[[|]]function <code>NSUBLIS : (alist tree &optional (test #'eql) (key #'identity))</code> [[|]]

== 15.5 : Using Lists as Sets ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node152.html CLtL2 Reference] 
[[|]]function <code>MEMBER : (item list &optional (test #'eql) (key #'identity))</code> 
[[|]]function <code>MEMBER-IF : (test list &optional (key #'identity))</code> 
[[|]]function <code>TAILP : (sublist list)</code> 
[[|]]function <code>ADJOIN : (item list &optional (test #'eql) (key #'identity))</code> 
[[|]]function <code>UNION : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
[[|]]function <code>NUNION : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
[[|]]function <code>INTERSECTION : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
[[|]]function <code>NINTERSECTION : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
[[|]]function <code>SET-DIFFERENCE : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
[[|]]function <code>NSET-DIFFERENCE : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
[[|]]function <code>SET-EXCLUSIVE-OR : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
[[|]]function <code>NSET-EXCLUSIVE-OR : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
[[|]]function <code>SUBSETP : (list1 list2 &optional (test #'eql) (key #'identity))</code> [[|]]

== 15.6 : Association Lists ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node153.html CLtL2 Reference] 
[[|]]function <code>ACONS : (key datum alist)</code> 
[[|]]function <code>PAIRLIS : (keys data &optional alist)</code> 
[[|]]function <code>ASSOC : (item alist &optional (test #'eql) (key #'identity))</code> 
[[|]]function <code>ASSOC-IF : (predicate alist)</code> 
[[|]]function <code>RASSOC : (item alist &optional (test #'eql) (key #'identity))</code> 
[[|]]function <code>RASSOC-IF : (predicate alist)</code> [[|]]

-----

= 16 : Hash Tables =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node154.html CLtL2 Reference]

[[|]]

== 16.1 : Hash Table Functions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node155.html CLtL2 Reference] 
[[|]]function <code>MAKE-HASH-TABLE : (size &optional (test #'eql) (area default-cons-area))</code> 
[[|]]function <code>HASH-TABLE-P : (x)</code> 
[[|]]function <code>GETHASH : (key table &optional default)</code> 
[[|]]function <code>SETHASH : (key table value)</code> 
[[|]]function <code>REMHASH : (key table)</code> 
[[|]]function <code>MAPHASH : (function table)</code> 
[[|]]function <code>CLRHASH : (table)</code> 
[[|]]function <code>HASH-TABLE-COUNT : (table)</code> [[|]]

== 16.2 : Primitive Hash Function ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node156.html CLtL2 Reference] 
[[|]]function <code>SXHASH : (object)</code> [[|]]

-----

= 17 : Arrays =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node157.html CLtL2 Reference]

SubL only supports one-dimensional arrays, which are called vectors. 
[[|]]function <code>VECTORP : (x)</code> [[|]]

== 17.1 : Vector Creation ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node158.html CLtL2 Reference] 
[[|]]function <code>MAKE-VECTOR : (size &optional initial-element)</code> 
[[|]]function <code>VECTOR : (&rest objects)</code> [[|]]

== 17.2 : Vector Access ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node159.html CLtL2 Reference] 
[[|]]function <code>AREF : (vector index)</code> 
[[|]]function <code>SET-AREF : (vector index value)</code> [[|]]

-----

= 18 : Strings =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node164.html CLtL2 Reference] 
[[|]]function <code>STRINGP : (x)</code> [[|]]

== 18.1 : String Access ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node165.html CLtL2 Reference] 
[[|]]function <code>CHAR : (string index)</code> 
[[|]]function <code>SET-CHAR : (string index value)</code> [[|]]

== 18.2 : String Comparison ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node166.html CLtL2 Reference] 
[[|]]function <code>STRING= : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
[[|]]function <code>STRING-EQUAL : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
[[|]]function <code>STRING< : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
[[|]]function <code>STRING> : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
[[|]]function <code>STRING<= : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
[[|]]function <code>STRING>= : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
[[|]]function <code>STRING/= : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
[[|]]function <code>STRING-LESSP : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
[[|]]function <code>STRING-GREATERP : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
[[|]]function <code>STRING-NOT-GREATERP : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
[[|]]function <code>STRING-NOT-LESSP : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
[[|]]function <code>STRING-NOT-EQUAL : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> [[|]]

== 18.3 : String Construction and Manipulation ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node167.html CLtL2 Reference] 
[[|]]function <code>MAKE-STRING : (size &optional (initial-element #\Space))</code> 
[[|]]function <code>STRING-TRIM : (char-list string)</code> 
[[|]]function <code>STRING-LEFT-TRIM : (char-list string)</code> 
[[|]]function <code>STRING-RIGHT-TRIM : (char-list string)</code> 
[[|]]function <code>STRING-UPCASE : (string &optional (start 0) end)</code> 
[[|]]function <code>STRING-DOWNCASE : (string &optional (start 0) end)</code> 
[[|]]function <code>STRING-CAPITALIZE : (string &optional (start 0) end)</code> 
[[|]]function <code>NSTRING-UPCASE : (string &optional (start 0) end)</code> 
[[|]]function <code>NSTRING-DOWNCASE : (string &optional (start 0) end)</code> 
[[|]]function <code>NSTRING-CAPITALIZE : (string &optional (start 0) end)</code> 
[[|]]function <code>STRING : (x)</code> [[|]]

-----

= 19 : Structures =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node168.html CLtL2 Reference] 
[[|]]macro <code>DEFSTRUCT : ((name &rest options) &body slots)</code> 
Like Common Lisp defstruct except:

(1) slot initializations are not allowed.

(2) the only other options: 
(:conc-name whatever) 
(:print-function #'whatever)

the default structure print function is 
default-struct-print-function : object stream depth

(3) The make constructor takes no arguments and only makes an empty structure.

(4) Reading of structures is not supported by the reader. 
[[|]]function <code>DEFAULT-STRUCT-PRINT-FUNCTION : (object stream depth)</code> 
[[|]]macro <code>PRINTING-OBJECT : ((object stream) &body body)</code> [[|]]

-----

= 20 : The Evaluator =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node179.html CLtL2 Reference]

[[|]]

== 20.1 : Run-Time Evaluation of Forms ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node180.html CLtL2 Reference] 
[[|]]function <code>EVAL : (form)</code> 
[[|]]function <code>CONSTANTP : (object &optional env)</code>

The Common Lisp functions <code>evalhook</code> and <code>applyhook</code> are not supported in SubL. [[|]]

== 20.2 : The Top-Level Loop ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node181.html CLtL2 Reference] 
[[|]]variable <code>*</code> 
[[|]]variable <code>**</code> 
[[|]]variable <code>***</code>

For convenience, the top-level readloop binds the following variables after each form is evaluated:

<blockquote><pre>* the last value returned
** the previous value of *
*** the previous value of **</pre></blockquote>
[[|]]

-----

= 21 : Streams =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node182.html CLtL2 Reference] 
[[|]]function <code>STREAMP : (x)</code> [[|]]

== 21.1 : Standard Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node183.html CLtL2 Reference] 
[[|]]variable <code>*STANDARD-INPUT*</code> 
[[|]]variable <code>*STANDARD-OUTPUT*</code> 
[[|]]variable <code>*ERROR-OUTPUT*</code> 
[[|]]variable <code>*NULL-OUTPUT*</code> 
A bit-sink output stream. All output is ignored

The other standard streams supported by Common Lisp are not supported by SubL. [[|]]

== 21.2 : Creating new Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node184.html CLtL2 Reference] 
[[|]]function <code>OPEN-TCP-STREAM : (host port)</code> [[|]]

== 21.3 : Operations on Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node185.html CLtL2 Reference] 
[[|]]function <code>STREAMP : (x)</code> 
[[|]]function <code>INPUT-STREAM-P : (object)</code> 
[[|]]function <code>OUTPUT-STREAM-P : (object)</code> 
[[|]]function <code>CLOSE : (stream)</code> [[|]]

-----

= 22 : Input/Output =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node186.html CLtL2 Reference] [[|]]

== 22.1 : Printed Representation of SubL Objects ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node187.html CLtL2 Reference] [[|]]

== 22.1.3 : Macro Characters ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node190.html CLtL2 Reference]

The SubL reader supports the following macro characters, whose meaning is identical to their meaning in Common Lisp :

<blockquote>'''Macro Character''' 
Â Â Â 
'''Reader Action'''

-----

<code>(</code> 
Begin reading a list. 
<code>)</code> 
End reading a list or a vector. 
<code>'</code> 
Read in a quoted expression. 
<code>;</code> 
Read a comment until end-of-line. 
<code>"</code> 
Begin or end reading a string. 
<code>`</code> 
Read in a backquoted expression.
</blockquote>
In addition, the following comma-readers are supported inside of backquote :

<blockquote><pre>,
,@
,.</pre></blockquote>
Their behavior is identical to their Common Lisp counterparts. [[|]]

== 22.1.4 : Standard Dispatching Macro Character Syntax ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node191.html CLtL2 Reference]

'''<code>'#'</code>''' is the SubL standard dispatching macro character. The SubL reader supports the following dispatch macro character sequences, whose meanings are identical to their meanings in Common Lisp :

<blockquote>'''Dispatch Sequence''' 
Â Â Â 
'''Reader Action'''

-----

<code>#\(</code> 
Read a character constant. 
<code>#'</code> 
Read a function constant. 
<code>#(</code> 
Begin reading a vector. 
<code>#|</code> 
Begin reading a comment section. 
<code>|#</code> 
End reading a comment section.
</blockquote>
Additionally, SubL supports the dispatch sequence '''<code>#$</code>''' as follows :

<blockquote><code>#$foo</code> reads the Cyc constant whose name is <code>"foo"</code>
</blockquote>
[[|]]

== 22.1.5 : The Readtable ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node192.html CLtL2 Reference]

SubL internally uses a readtable, but it is not visible to the programmer. [[|]]

== 22.1.6 : What the Print Function Produces ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node193.html CLtL2 Reference] 
[[|]]variable <code>*PRINT-ESCAPE*</code> [[|]]

== 22.2.1 : Input from Character Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node195.html CLtL2 Reference] 
[[|]]function <code>READ : (&optional (stream *standard-input*) (eof-error-p t) (eof-value :eof))</code> 
Returns FORM if read was successful. 
Returns the values NIL :ERROR if there was a reader error. 
Returns the values EOF-VALUE :ERROR if EOF-ERROR-P is nil and EOF occurs. 
Causes an error if EOF-ERROR-P is not nil and EOF occurs.

Differences from Common Lisp: 
<code>`Numbers are only read in decimal notation with no specified radix.</code> <code>No character modifiers: only standard chars plus specials like Space, Return etc.</code> <code>The || notation and \\ syntax for symbols are not supported. []()function</code>READ-LINE : (&optional (stream ''standard-input'') (eof-error-p t) (eof-value :eof))<code>[]()function</code>READ-CHAR : (&optional (stream ''standard-input'') (eof-error-p t) (eof-value :eof))<code>[]()function</code>UNREAD-CHAR : (char &optional (stream ''standard-input''))<code>[]()function</code>READ-FROM-STRING : (string &optional (eof-error-p t) (eof-value :eof) (start 0) end)` 
Returns the values FORM NEW-START if read was successful. 
Returns the values NIL :ERROR if there was a reader error. 
Returns the values EOF-VALUE :ERROR if EOF-ERROR-P is nil and EOF occurs. 
Causes an error if EOF-ERROR-P is not nil and EOF occurs. 
Returns a second value which is an integer indicating the position in the string to 
start reading from again or :ERROR if there was some kind of reader error. [[|]]

== 22.2.2 : Input from Binary Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node196.html CLtL2 Reference] 
[[|]]function <code>READ-BYTE : (stream &optional (eof-error-p t) (eof-value :eof))</code> [[|]]

== 22.3.1 : Output to Character Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node198.html CLtL2 Reference] 
[[|]]function <code>WRITE : (object &optional (stream *standard-output*) (escape *print-escape*))</code> 
[[|]]function <code>PRIN1 : (object &optional (stream *standard-output*))</code> 
[[|]]function <code>PRINT : (object &optional (stream *standard-output*))</code> 
[[|]]function <code>PRINC : (object &optional (stream *standard-output*))</code> 
[[|]]function <code>WRITE-TO-STRING : (object &optional (escape *print-escape*))</code> 
[[|]]function <code>PRIN1-TO-STRING : (object)</code> 
[[|]]function <code>PRINC-TO-STRING : (object)</code> 
[[|]]function <code>WRITE-CHAR : (char &optional (stream *standard-output*))</code> 
[[|]]function <code>WRITE-STRING : (string &optional (stream *standard-output*) (start 0) end)</code> 
[[|]]function <code>WRITE-LINE : (string &optional (stream *standard-output*) (start 0) end)</code> 
[[|]]function <code>TERPRI : (&optional (stream *standard-output*))</code> 
[[|]]function <code>FORCE-OUTPUT : (&optional (stream *standard-output*))</code> [[|]]

== 22.3.2 : Output to Binary Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node199.html CLtL2 Reference] 
[[|]]function <code>WRITE-BYTE : (integer stream)</code> [[|]]

== 22.3.3 : Formatted Output to Character Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node200.html CLtL2 Reference] 
[[|]]function <code>FORMAT : (destination control-string &rest arguments)</code> 
Format ARGUMENTS to the text stream DESTINATION according to the specifications in CONTROL-STRING. SubL format is more limited than the Common Lisp version: the only escapes allowed in the control string are: ~A ~a ~S ~s ~D ~d (with width and pad parameters optional) ~C ~c ~G ~g ~% ~~ [[|]]

-----

= 23 : File System Interface =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node202.html CLtL2 Reference] [[|]]

== 23.1 : File Names ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node203.html CLtL2 Reference] 
[[|]]variable <code>*DEFAULT-PATHNAME-DEFAULTS*</code> 
[[|]]function <code>CONSTRUCT-FILENAME : (directory-list filename &optional extension relative?)</code>

Pathnames are just strings in SubL. Common Lisp pathname objects are not supported. [[|]]

== 23.2 : Opening and Closing Files ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node215.html CLtL2 Reference] 
[[|]]function <code>OPEN-TEXT : (filename direction)</code> 
Attempts to open the file FILENAME. If successful, returns an 8-bit character text stream. If DIRECTION is :input, then input operations can be performed on the stream. If DIRECTION is output, then output is directed to the file FILENAME, overwriting any existing file. If DIRECTION is :append, then output is appended to the file. For either output case, a new file is created if no file named FILENAME already exists. 
[[|]]function <code>OPEN-BINARY : (filename direction)</code> 
Attempts to open the file FILENAME. If successful, returns an 8-bit binary byte stream. If DIRECTION is :input, then input operations can be performed on the stream. If DIRECTION is output, then output is directed to the file FILENAME, overwriting any existing file. If DIRECTION is :append, then output is appended to the file. For either output case, a new file is created if no file named FILENAME already exists. 
[[|]]macro <code>WITH-TEXT-FILE : ((stream filestring direction) &body body)</code> 
In the scope of a WITH-TEXT-FILE expression, the file FILESTRING is opened for character i/o and a stream to this file is created and bound to the variable STREAM. If DIRECTION is :input, then input operations can be performed on STREAM. If DIRECTION is :output, then output operations can be performed, overwriting any existing file. If DIRECTION is :append, then output is appended to an existing file. 
[[|]]macro <code>WITH-BINARY-FILE : ((stream filestring direction) &body body)</code> 
In the scope of a WITH-BINARY-FILE expression, the file FILESTRING is opened for binary i/o and a stream to this file is created and bound to the variable STREAM. If DIRECTION is :input, then input operations can be performed on STREAM. If DIRECTION is :output, then output operations can be performed, overwriting any existing file. If DIRECTION is :append, then output is appended to an existing file. [[|]]

== 23.3 : Renaming, Deleting and Other File Operations ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node216.html CLtL2 Reference] 
[[|]]function <code>RENAME-FILE : (filename new-name)</code> 
[[|]]function <code>DELETE-FILE : (filename)</code> 
[[|]]function <code>PROBE-FILE : (filename)</code> 
[[|]]function <code>APPEND-FILES : (filename-1 filename-2 &optional (mode :text))</code> 
Append filename-1 to filename-2 
[[|]]function <code>FILE-WRITE-DATE : (filename)</code> 
[[|]]function <code>FILE-AUTHOR : (filename)</code> 
[[|]]function <code>GET-FILE-POSITION : (stream)</code> 
[[|]]function <code>SET-FILE-POSITION : (stream n)</code> 
[[|]]function <code>FILE-LENGTH : (stream)</code> [[|]]

== 23.4 : Loading Files ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node217.html CLtL2 Reference] 
[[|]]function <code>LOAD : (filename)</code> [[|]]

== 23.5 : Accessing Directories ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node218.html CLtL2 Reference] 
[[|]]function <code>DIRECTORY : (directory-name &optional include-directory)</code> [[|]]

-----

= 24 : Errors =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node219.html CLtL2 Reference] [[|]]

== 24.1 : General Error-Signalling Functions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node220.html CLtL2 Reference] 
[[|]]variable <code>*ERROR-ABORT-HANDLER*</code> 
If *error-abort-handler* is non-nil, then an ABORT option is available inside ERROR and CERROR. 
If chosen, then the handler is funcalled on no arguments. 
[[|]]variable <code>*ERROR-HANDLER*</code> 
If *ERROR-SIGNAL* is non-nil, then that function is called upon an error. Otherwise, the debugger is invoked. 
[[|]]variable <code>*ERROR-MESSAGE*</code> 
[[|]]function <code>ERROR : (format-string &rest arguments)</code> 
[[|]]variable <code>*CONTINUE-CERROR?*</code> 
[[|]]function <code>CERROR : (continue-string format-string &rest arguments)</code> 
[[|]]variable <code>*IGNORE-WARNS?*</code> 
If T, all warnings forms are ignored 
[[|]]function <code>WARN : (format-string &rest arguments)</code> 
[[|]]variable <code>*IGNORE-BREAKS?*</code> 
If non-NIL, all break forms are ignored 
[[|]]function <code>BREAK : (format-string &rest arguments)</code> [[|]]

== 24.2 : Specialized Error-Signalling Forms and Macros ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node221.html CLtL2 Reference] 
[[|]]variable <code>*IGNORE-MUSTS?*</code> 
If non-NIL, all must forms are ignored 
[[|]]macro <code>MUST : (form format-string &rest arguments)</code> 
[[|]]variable <code>*SUSPEND-TYPE-CHECKING?*</code> 
CHECK-TYPE tests are performed iff this is non-nil 
[[|]]macro <code>CHECK-TYPE : (object pred)</code> [[|]]

-----

= 25 : Miscellaneous Features =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node223.html CLtL2 Reference] [[|]]

== 25.1 : The Compiler ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node224.html CLtL2 Reference]

SubL currently does not provide any compilation support. [[|]]

== 25.3 : Debugging Tools ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node230.html CLtL2 Reference] 
[[|]]macro <code>CTIME : (var &body body)</code> 
[[|]]function <code>DEBUG : ()</code> 
Pauses execution and invokes the debugger. [[|]]

== 25.4.1 : Time Functions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node232.html CLtL2 Reference] 
[[|]]variable <code>*EPOCH*</code> 
*epoch* is the current epoch in use, which is a universal time. 
The system needs to at least be able to handle epochs back to midnight Jan 1 1970. 
*epoch* is globally initialized to midnight Jan 1 1970. 
All universal times are relative to *epoch*. 
[[|]]function <code>GET-UNIVERSAL-TIME : ()</code> 
[[|]]function <code>DECODE-UNIVERSAL-TIME : (universal-time)</code> 
[[|]]function <code>ENCODE-UNIVERSAL-TIME : (second minute hour date month year)</code> 
[[|]]function <code>TIME-FROM-NOW : (delta)</code> 
[[|]]function <code>TIME-HAS-ARRIVED? : (time)</code> 
[[|]]function <code>ENCODE-TIMESTRING : (second minute hour date month year)</code> 
[[|]]function <code>TIMESTRING : (&optional (universal-time (get-universal-time)))</code> 
timestring returns a string in the format dd/mm/yy hh:mm:ss from the 
universal time given. If none is given, the current time is used. 
[[|]]variable <code>*CLOCK-GRANULARITY*</code> 
*clock-granularity* is the number of internal clock units per second. 
time evals form and returns the number of internal clock units it took 
to execute. 
[[|]]function <code>GET-INTERNAL-REAL-TIME : ()</code> 
[[|]]function <code>SLEEP : (seconds)</code> [[|]]

== 25.5 : Identity Function ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node234.html CLtL2 Reference] 
[[|]]function <code>IDENTITY : (object)</code> [[|]]

-----

= 28 : Common Lisp Object System =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node260.html CLtL2 Reference] 
[[|]]macro <code>DEFPOLYMORPHIC : (name lambda-list &body body)</code> 
Defines a new polymorphic function that dispatches on the type of its first argument. <body> defines a default method. The function define-method can be used to define additional methods. For example:

(defpolymorphic test (a b) 
` `(list a b))

(define-method test ((a cons) b) 
` `(cons b a))

(define-method test ((a fixnum) b) 
` `(+ a b))

The defpolymorphic form defines the function TEST with a default method. 
` `The two define-method forms specialize the behavior of TEST for lists and fixnums.

(test 'foo 'bar) => (FOO BAR) 
<code>`(test '(foo) 'bar) =&gt; (BAR FOO)</code> <code>(test 2 3) =&gt; 5 []()macro</code>DEFINE-METHOD : (name lambda-list &body body)` 
Defines a method for the polymorphic function <name> that runs if 
<dispatch-arg> is of type <type>. The lambda list must have the same 
structure as in the DEFPOLYMORPHIC call. [[|]]

-----

= SubL-Specific Features =

[[|]] '''SubL.1 : Signals''' 
[[|]]variable <code>*SIGNAL-MAX*</code> 
There are *signal-max* total signals available. 
[[|]]function <code>DEFAULT-SIGNAL-HANDLER : (signal)</code> 
[[|]]function <code>INSTALL-SIGNAL-HANDLER : (signal function)</code>

[[|]] '''SubL.2 : System Properties''' 
[[|]]function <code>GET-PROCESS-ID : (&optional default)</code> 
Return the current heavyweight process id of this current SubL 
program. Return DEFAULT if this cannot be determined. 
[[|]]function <code>GET-MACHINE-NAME : (&optional default)</code> 
[[|]]function <code>GET-NETWORK-NAME : (&optional default)</code> 
[[|]]function <code>GET-USER-NAME : (&optional default)</code>

[[|]] '''SubL.3 : Progress Pacifiers''' 
[[|]]variable <code>*SILENT-PROGRESS?*</code> 
[[|]]macro <code>NOTING-ACTIVITY : (string &body body)</code> 
[[|]]function <code>NOTE-ACTIVITY : ()</code> 
[[|]]macro <code>NOTING-NUMERIC-PROGRESS : (string &body body)</code> 
[[|]]function <code>NOTE-NUMERIC-PROGRESS : (num)</code> 
[[|]]macro <code>NOTING-PERCENT-PROGRESS : (string &body body)</code> 
[[|]]function <code>NOTE-PERCENT-PROGRESS : (index max)</code>

[[|]] '''SubL.4 : Process Manipulation''' 
[[|]]function <code>FORK-PROCESS : (function &optional callback output-file)</code> 
Spawn a heavyweight child process to call FUNCTION, which takes no arguments. 
FUNCTION must return an integer. 
CALLBACK, if provided, must be a function of one argument which is called 
on the returned value within the address space of the parent process. 
OUTPUT-FILE, if provided, is a file to which standard output and error are piped 
while executing FUNCTION. 
[[|]]function <code>RESTART-PROCESS : (&optional world-spec init-file-pathname init-form-spec)</code> 
Restart the current heavyweight process. 
WORLD-SPEC, if provided, is the filename of a world to use. 
INIT-FILE-PATHNAME, if provided, is a file of initializatio forms to eval. 
INIT-FORM-SPEC, if provided, is a form to execute. 
The values used for these when the current process was started are used if unprovided.

[[|]] '''SubL.5 : Memory Interaction''' 
[[|]]function <code>GC : (&optional level)</code> 
[[|]]macro <code>WITH-STATIC-AREA : (&body body)</code> 
[[|]]function <code>WRITE-IMAGE : (filename &optional do-full-gc)</code> 
Save the current state of virtual memory in a file called FILENAME. 
If DO-FULL-GC is true, then a full garbage collection is 
performed before writing the image. Otherwise, a dynamic 
garbage collection is performed and remaining objects are 
promoted to being static ones.

During the initialization of a SubL system at startup, variables defined via [[#FN-DEF-DEFVAR|<code>DEFVAR</code>]] have their initial values set via their state in the world file used at startup, ignoring the initial value specified by the code. [[#FN-DEF-DEFPARAMETER|<code>DEFPARAMETER</code>]] variables and [[#FN-DEF-DEFCONSTANT|<code>DEFCONSTANT</code>]] global constants have their values initialized via the code on startup.

The net result of this distinction is as follows: if a world is saved out via WRITE-IMAGE, and then used to restart a SubL system, the values of [[#FN-DEF-DEFVAR|<code>DEFVAR</code>]] variables will persist, while any changes to [[#FN-DEF-DEFPARAMETER|<code>DEFPARAMETER</code>]] variables will be lost when they are reset to their original code-specified initial values on startup. [[|]]

-----

= Index =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/index.html CLtL2 Reference]

'''[[#Index-A|A]] | [[#Index-B|B]] | [[#Index-C|C]] | [[#Index-D|D]] | [[#Index-E|E]] | [[#Index-F|F]] | [[#Index-G|G]] | [[#Index-H|H]] | [[#Index-I|I]] | [[#Index-J|J]] | [[#Index-K|K]] | [[#Index-L|L]] | [[#Index-M|M]] | [[#Index-N|N]] | [[#Index-O|O]] | [[#Index-P|P]] | [[#Index-Q|Q]] | [[#Index-R|R]] | [[#Index-S|S]] | [[#Index-T|T]] | [[#Index-U|U]] | [[#Index-V|V]] | [[#Index-W|W]] | [[#Index-X|X]] | [[#Index-Y|Y]] | [[#Index-Z|Z]]'''

[[#FN-DEF-1280|<code>*</code>]] function 
[[#SYM-DEF-1280|<code>*</code>]] variable 
[[#SYM-DEF-165120|<code>**</code>]] variable 
[[#SYM-DEF-21136640|<code>***</code>]] variable 
[[#SYM-DEF-1161467279|<code>*CLOCK-GRANULARITY*</code>]] variable 
[[#SYM-DEF-1424597890|<code>*CONTINUE-CERROR?*</code>]] variable 
[[#SYM-DEF-609384130|<code>*DEFAULT-PATHNAME-DEFAULTS*</code>]] variable 
[[#SYM-DEF-2020021124|<code>*EPOCH*</code>]] variable 
[[#SYM-DEF-860597104|<code>*ERROR-ABORT-HANDLER*</code>]] variable 
[[#SYM-DEF-354311860|<code>*ERROR-HANDLER*</code>]] variable 
[[#SYM-DEF-1079241228|<code>*ERROR-MESSAGE*</code>]] variable 
[[#SYM-DEF-704643174|<code>*ERROR-OUTPUT*</code>]] variable 
[[#SYM-DEF-204607828|<code>*IGNORE-BREAKS?*</code>]] variable 
[[#SYM-DEF-2065003033|<code>*IGNORE-MUSTS?*</code>]] variable 
[[#SYM-DEF-1528898064|<code>*IGNORE-WARNS?*</code>]] variable 
[[#SYM-DEF-1188374285|<code>*MOST-NEGATIVE-FIXNUM*</code>]] variable 
[[#SYM-DEF-113980253|<code>*MOST-POSITIVE-FIXNUM*</code>]] variable 
[[#SYM-DEF-1624760991|<code>*MULTIPLE-VALUES-LIMIT*</code>]] variable 
[[#SYM-DEF-1405149315|<code>*NULL-OUTPUT*</code>]] variable 
[[#SYM-DEF-313735324|<code>*PRINT-ESCAPE*</code>]] variable 
[[#SYM-DEF-430643141|<code>*RAND-MAX*</code>]] variable 
[[#SYM-DEF-371148559|<code>*SIGNAL-MAX*</code>]] variable 
[[#SYM-DEF-694198800|<code>*SILENT-PROGRESS?*</code>]] variable 
[[#SYM-DEF-1112282190|<code>*STANDARD-INPUT*</code>]] variable 
[[#SYM-DEF-1982975489|<code>*STANDARD-OUTPUT*</code>]] variable 
[[#SYM-DEF-1570894042|<code>*SUSPEND-TYPE-CHECKING?*</code>]] variable 
[[#FN-DEF-+|<code>+</code>]] function 
[[#FN-DEF--|<code>-</code>]] function 
[[#FN-DEF-/|<code>/</code>]] function 
[[#FN-DEF-/=|<code>/=</code>]] function 
[[#FN-DEF-3584|<code><</code>]] function 
[[#FN-DEF-462464|<code><=</code>]] function 
[[#FN-DEF-=|<code>=</code>]] function 
[[#FN-DEF-3840|<code>></code>]] function 
[[#FN-DEF-495232|<code>>=</code>]] function [[|]]

==== A ====

[[#FN-DEF-ACONS|<code>ACONS</code>]] function 
[[#FN-DEF-ADJOIN|<code>ADJOIN</code>]] function 
[[#FN-DEF-ALERT-USER|<code>ALERT-USER</code>]] function 
[[#FN-DEF-ALPHA-CHAR-P|<code>ALPHA-CHAR-P</code>]] function 
[[#FN-DEF-ALPHANUMERICP|<code>ALPHANUMERICP</code>]] function 
[[#FN-DEF-APPEND|<code>APPEND</code>]] function 
[[#FN-DEF-APPEND-FILES|<code>APPEND-FILES</code>]] function 
[[#FN-DEF-APPLY|<code>APPLY</code>]] function 
[[#FN-DEF-AREF|<code>AREF</code>]] function 
[[#FN-DEF-ASSOC|<code>ASSOC</code>]] function 
[[#FN-DEF-ASSOC-IF|<code>ASSOC-IF</code>]] function 
[[#FN-DEF-ATOM|<code>ATOM</code>]] function [[|]]

==== B ====

[[#FN-DEF-BOTH-CASE-P|<code>BOTH-CASE-P</code>]] function 
[[#FN-DEF-BOUNDP|<code>BOUNDP</code>]] function 
[[#FN-DEF-BREAK|<code>BREAK</code>]] function 
[[#FN-DEF-BUTLAST|<code>BUTLAST</code>]] function 
[[#FN-DEF-BYTE|<code>BYTE</code>]] macro [[|]]

==== C ====

[[#FN-DEF-CAAR|<code>CAAR</code>]] function 
[[#FN-DEF-CADR|<code>CADR</code>]] function 
[[#FN-DEF-CAND|<code>CAND</code>]] macro 
[[#FN-DEF-CAR|<code>CAR</code>]] function 
[[#FN-DEF-CCATCH|<code>CCATCH</code>]] macro 
[[#FN-DEF-CCONCATENATE|<code>CCONCATENATE</code>]] function 
[[#FN-DEF-CDAR|<code>CDAR</code>]] function 
[[#FN-DEF-CDDR|<code>CDDR</code>]] function 
[[#FN-DEF-CDEC|<code>CDEC</code>]] macro 
[[#FN-DEF-CDESTRUCTURING-BIND|<code>CDESTRUCTURING-BIND</code>]] macro 
[[#FN-DEF-CDO|<code>CDO</code>]] macro 
[[#FN-DEF-CDOHASH|<code>CDOHASH</code>]] macro 
[[#FN-DEF-CDOLIST|<code>CDOLIST</code>]] macro 
[[#FN-DEF-CDOTIMES|<code>CDOTIMES</code>]] macro 
[[#FN-DEF-CDR|<code>CDR</code>]] function 
[[#FN-DEF-CEILING|<code>CEILING</code>]] function 
[[#FN-DEF-CERROR|<code>CERROR</code>]] function 
[[#FN-DEF-CHAR|<code>CHAR</code>]] function 
[[#FN-DEF-CHAR-CODE|<code>CHAR-CODE</code>]] function 
[[#FN-DEF-CHAR-DOWNCASE|<code>CHAR-DOWNCASE</code>]] function 
[[#FN-DEF-CHAR-EQUAL|<code>CHAR-EQUAL</code>]] function 
[[#FN-DEF-CHAR-GREATERP|<code>CHAR-GREATERP</code>]] function 
[[#FN-DEF-CHAR-LESSP|<code>CHAR-LESSP</code>]] function 
[[#FN-DEF-CHAR-NOT-EQUAL|<code>CHAR-NOT-EQUAL</code>]] function 
[[#FN-DEF-CHAR-NOT-GREATERP|<code>CHAR-NOT-GREATERP</code>]] function 
[[#FN-DEF-CHAR-NOT-LESSP|<code>CHAR-NOT-LESSP</code>]] function 
[[#FN-DEF-CHAR-UPCASE|<code>CHAR-UPCASE</code>]] function 
[[#FN-DEF-CHAR/=|<code>CHAR/=</code>]] function 
[[#FN-DEF-137661468|<code>CHAR<</code>]] function 
[[#FN-DEF-440795332|<code>CHAR<=</code>]] function 
[[#FN-DEF-CHAR=|<code>CHAR=</code>]] function 
[[#FN-DEF-137661724|<code>CHAR></code>]] function 
[[#FN-DEF-440828100|<code>CHAR>=</code>]] function 
[[#FN-DEF-CHARACTERP|<code>CHARACTERP</code>]] function 
[[#FN-DEF-CHECK-TYPE|<code>CHECK-TYPE</code>]] macro 
[[#FN-DEF-CINC|<code>CINC</code>]] macro 
[[#FN-DEF-CLET|<code>CLET</code>]] macro 
[[#FN-DEF-CLOSE|<code>CLOSE</code>]] function 
[[#FN-DEF-CLRHASH|<code>CLRHASH</code>]] function 
[[#FN-DEF-CMERGE|<code>CMERGE</code>]] function 
[[#FN-DEF-CMULTIPLE-VALUE-BIND|<code>CMULTIPLE-VALUE-BIND</code>]] macro 
[[#FN-DEF-CNOT|<code>CNOT</code>]] macro 
[[#FN-DEF-CODE-CHAR|<code>CODE-CHAR</code>]] function 
[[#FN-DEF-CONS|<code>CONS</code>]] function 
[[#FN-DEF-CONSP|<code>CONSP</code>]] function 
[[#FN-DEF-CONSTANTP|<code>CONSTANTP</code>]] function 
[[#FN-DEF-CONSTRUCT-FILENAME|<code>CONSTRUCT-FILENAME</code>]] function 
[[#FN-DEF-COPY-ALIST|<code>COPY-ALIST</code>]] function 
[[#FN-DEF-COPY-LIST|<code>COPY-LIST</code>]] function 
[[#FN-DEF-COPY-SEQ|<code>COPY-SEQ</code>]] function 
[[#FN-DEF-COPY-TREE|<code>COPY-TREE</code>]] function 
[[#FN-DEF-COR|<code>COR</code>]] macro 
[[#FN-DEF-COUNT|<code>COUNT</code>]] function 
[[#FN-DEF-COUNT-IF|<code>COUNT-IF</code>]] function 
[[#FN-DEF-CPOP|<code>CPOP</code>]] macro 
[[#FN-DEF-CPROGV|<code>CPROGV</code>]] macro 
[[#FN-DEF-CPUSH|<code>CPUSH</code>]] macro 
[[#FN-DEF-CPUSHNEW|<code>CPUSHNEW</code>]] macro 
[[#FN-DEF-CREDUCE|<code>CREDUCE</code>]] function 
[[#FN-DEF-CSETF|<code>CSETF</code>]] macro 
[[#FN-DEF-CSETQ|<code>CSETQ</code>]] macro 
[[#FN-DEF-CSOME|<code>CSOME</code>]] macro 
[[#FN-DEF-CTIME|<code>CTIME</code>]] macro 
[[#FN-DEF-CUNWIND-PROTECT|<code>CUNWIND-PROTECT</code>]] macro [[|]]

==== D ====

[[#FN-DEF-DEBUG|<code>DEBUG</code>]] function 
[[#FN-DEF-DECLAIM|<code>DECLAIM</code>]] macro 
[[#FN-DEF-DECLARE|<code>DECLARE</code>]] function 
[[#FN-DEF-DECODE-UNIVERSAL-TIME|<code>DECODE-UNIVERSAL-TIME</code>]] function 
[[#FN-DEF-DEFAULT-SIGNAL-HANDLER|<code>DEFAULT-SIGNAL-HANDLER</code>]] function 
[[#FN-DEF-DEFAULT-STRUCT-PRINT-FUNCTION|<code>DEFAULT-STRUCT-PRINT-FUNCTION</code>]] function 
[[#FN-DEF-DEFCONSTANT|<code>DEFCONSTANT</code>]] macro 
[[#FN-DEF-DEFINE|<code>DEFINE</code>]] macro 
[[#FN-DEF-DEFINE-METHOD|<code>DEFINE-METHOD</code>]] macro 
[[#FN-DEF-DEFMACRO|<code>DEFMACRO</code>]] macro 
[[#FN-DEF-DEFPARAMETER|<code>DEFPARAMETER</code>]] macro 
[[#FN-DEF-DEFPOLYMORPHIC|<code>DEFPOLYMORPHIC</code>]] macro 
[[#FN-DEF-DEFSTRUCT|<code>DEFSTRUCT</code>]] macro 
[[#FN-DEF-DEFVAR|<code>DEFVAR</code>]] macro 
[[#FN-DEF-DELETE|<code>DELETE</code>]] function 
[[#FN-DEF-DELETE-DUPLICATES|<code>DELETE-DUPLICATES</code>]] function 
[[#FN-DEF-DELETE-FILE|<code>DELETE-FILE</code>]] function 
[[#FN-DEF-DELETE-IF|<code>DELETE-IF</code>]] function 
[[#FN-DEF-DIGIT-CHAR-P|<code>DIGIT-CHAR-P</code>]] function 
[[#FN-DEF-DIRECTORY|<code>DIRECTORY</code>]] function 
[[#FN-DEF-DPB|<code>DPB</code>]] function [[|]]

==== E ====

[[#FN-DEF-EIGHTH|<code>EIGHTH</code>]] function 
[[#FN-DEF-ELT|<code>ELT</code>]] function 
[[#FN-DEF-ENCODE-TIMESTRING|<code>ENCODE-TIMESTRING</code>]] function 
[[#FN-DEF-ENCODE-UNIVERSAL-TIME|<code>ENCODE-UNIVERSAL-TIME</code>]] function 
[[#FN-DEF-ENDP|<code>ENDP</code>]] function 
[[#FN-DEF-EQ|<code>EQ</code>]] function 
[[#FN-DEF-EQL|<code>EQL</code>]] function 
[[#FN-DEF-EQUAL|<code>EQUAL</code>]] function 
[[#FN-DEF-EQUALP|<code>EQUALP</code>]] function 
[[#FN-DEF-ERROR|<code>ERROR</code>]] function 
[[#FN-DEF-EVAL|<code>EVAL</code>]] function 
[[#FN-DEF-EVENP|<code>EVENP</code>]] function [[|]]

==== F ====

[[#FN-DEF-FBOUNDP|<code>FBOUNDP</code>]] function 
[[#FN-DEF-FIF|<code>FIF</code>]] macro 
[[#FN-DEF-FIFTH|<code>FIFTH</code>]] function 
[[#FN-DEF-FILE-AUTHOR|<code>FILE-AUTHOR</code>]] function 
[[#FN-DEF-FILE-LENGTH|<code>FILE-LENGTH</code>]] function 
[[#FN-DEF-FILE-WRITE-DATE|<code>FILE-WRITE-DATE</code>]] function 
[[#FN-DEF-FILL|<code>FILL</code>]] function 
[[#FN-DEF-FIND|<code>FIND</code>]] function 
[[#FN-DEF-FIND-IF|<code>FIND-IF</code>]] function 
[[#FN-DEF-FIND-SYMBOL|<code>FIND-SYMBOL</code>]] function 
[[#FN-DEF-FIRST|<code>FIRST</code>]] function 
[[#FN-DEF-FIXNUMP|<code>FIXNUMP</code>]] function 
[[#FN-DEF-FLOAT|<code>FLOAT</code>]] function 
[[#FN-DEF-FLOATP|<code>FLOATP</code>]] function 
[[#FN-DEF-FLOOR|<code>FLOOR</code>]] function 
[[#FN-DEF-FMAKUNBOUND|<code>FMAKUNBOUND</code>]] function 
[[#FN-DEF-FORCE-OUTPUT|<code>FORCE-OUTPUT</code>]] function 
[[#FN-DEF-FORK-PROCESS|<code>FORK-PROCESS</code>]] function 
[[#FN-DEF-FORMAT|<code>FORMAT</code>]] function 
[[#FN-DEF-FOURTH|<code>FOURTH</code>]] function 
[[#FN-DEF-FUNCALL|<code>FUNCALL</code>]] function 
[[#FN-DEF-FUNCTION|<code>FUNCTION</code>]] macro 
[[#FN-DEF-FUNCTION-INFORMATION|<code>FUNCTION-INFORMATION</code>]] function 
[[#FN-DEF-FUNCTION-SPEC-P|<code>FUNCTION-SPEC-P</code>]] function 
[[#FN-DEF-FUNCTIONP|<code>FUNCTIONP</code>]] function 
[[#FN-DEF-FUNLESS|<code>FUNLESS</code>]] macro 
[[#FN-DEF-FWHEN|<code>FWHEN</code>]] macro [[|]]

==== G ====

[[#FN-DEF-GC|<code>GC</code>]] function 
[[#FN-DEF-GENSYM|<code>GENSYM</code>]] function 
[[#FN-DEF-GENTEMP|<code>GENTEMP</code>]] function 
[[#FN-DEF-GET|<code>GET</code>]] function 
[[#FN-DEF-GET-CONSING-STATE|<code>GET-CONSING-STATE</code>]] function 
[[#FN-DEF-GET-FILE-POSITION|<code>GET-FILE-POSITION</code>]] function 
[[#FN-DEF-GET-INTERNAL-REAL-TIME|<code>GET-INTERNAL-REAL-TIME</code>]] function 
[[#FN-DEF-GET-MACHINE-NAME|<code>GET-MACHINE-NAME</code>]] function 
[[#FN-DEF-GET-NETWORK-NAME|<code>GET-NETWORK-NAME</code>]] function 
[[#FN-DEF-GET-PROCESS-ID|<code>GET-PROCESS-ID</code>]] function 
[[#FN-DEF-GET-STRING-FROM-USER|<code>GET-STRING-FROM-USER</code>]] function 
[[#FN-DEF-GET-UNIVERSAL-TIME|<code>GET-UNIVERSAL-TIME</code>]] function 
[[#FN-DEF-GET-USER-NAME|<code>GET-USER-NAME</code>]] function 
[[#FN-DEF-GETHASH|<code>GETHASH</code>]] function [[|]]

==== H ====

[[#FN-DEF-HASH-TABLE-COUNT|<code>HASH-TABLE-COUNT</code>]] function 
[[#FN-DEF-HASH-TABLE-P|<code>HASH-TABLE-P</code>]] function [[|]]

==== I ====

[[#FN-DEF-IDENTITY|<code>IDENTITY</code>]] function 
[[#FN-DEF-IGNORE|<code>IGNORE</code>]] function 
[[#FN-DEF-IN-PACKAGE|<code>IN-PACKAGE</code>]] macro 
[[#FN-DEF-INPUT-STREAM-P|<code>INPUT-STREAM-P</code>]] function 
[[#FN-DEF-INSTALL-SIGNAL-HANDLER|<code>INSTALL-SIGNAL-HANDLER</code>]] function 
[[#FN-DEF-INT/|<code>INT/</code>]] function 
[[#FN-DEF-INTEGER-DECODE-FLOAT|<code>INTEGER-DECODE-FLOAT</code>]] function 
[[#FN-DEF-INTEGERP|<code>INTEGERP</code>]] function 
[[#FN-DEF-INTERN|<code>INTERN</code>]] function 
[[#FN-DEF-INTERSECTION|<code>INTERSECTION</code>]] function [[|]]

==== J ====

[[|]]

==== K ====

[[#FN-DEF-KEYWORDP|<code>KEYWORDP</code>]] function [[|]]

==== L ====

[[#FN-DEF-LAST|<code>LAST</code>]] function 
[[#FN-DEF-LDB|<code>LDB</code>]] function 
[[#FN-DEF-LDIFF|<code>LDIFF</code>]] function 
[[#FN-DEF-LENGTH|<code>LENGTH</code>]] function 
[[#FN-DEF-LIST|<code>LIST</code>]] function 
[[#FN-DEF-443877220|<code>LIST*</code>]] function 
[[#FN-DEF-LIST-LENGTH|]]<code>LIST-LENGTH</code> function function 
[[#FN-DEF-LISTP|]]<code>LISTP</code> function 
[[#FN-DEF-LOAD|]]<code>LOAD</code> function 
[[#FN-DEF-LOG-MESSAGE|]]<code>LOG-MESSAGE</code> function 
[[#FN-DEF-LOWER-CASE-P|]]<code>LOWER-CASE-P</code> function[[|]]

==== M ====

[[#FN-DEF-MAKE-HASH-TABLE|]]<code>MAKE-HASH-TABLE</code> function 
[[#FN-DEF-MAKE-LIST|]]<code>MAKE-LIST</code> function 
[[#FN-DEF-MAKE-STRING|]]<code>MAKE-STRING</code> function 
[[#FN-DEF-MAKE-SYMBOL|]]<code>MAKE-SYMBOL</code> function 
[[#FN-DEF-MAKE-VECTOR|]]<code>MAKE-VECTOR</code> function 
[[#FN-DEF-MAKUNBOUND|]]<code>MAKUNBOUND</code> function 
[[#FN-DEF-MAPC|]]<code>MAPC</code> function 
[[#FN-DEF-MAPCAN|]]<code>MAPCAN</code> function 
[[#FN-DEF-MAPCAR|]]<code>MAPCAR</code> function 
[[#FN-DEF-MAPCON|]]<code>MAPCON</code> function 
[[#FN-DEF-MAPHASH|]]<code>MAPHASH</code> function 
[[#FN-DEF-MAPL|]]<code>MAPL</code> function 
[[#FN-DEF-MAPLIST|]]<code>MAPLIST</code> function 
[[#FN-DEF-MAX|]]<code>MAX</code> function 
[[#FN-DEF-MEMBER|]]<code>MEMBER</code> function 
[[#FN-DEF-MEMBER-IF|]]<code>MEMBER-IF</code> function 
[[#FN-DEF-MIN|]]<code>MIN</code> function 
[[#FN-DEF-MINUSP|]]<code>MINUSP</code> function 
[[#FN-DEF-MISMATCH|]]<code>MISMATCH</code> function 
[[#FN-DEF-MOD|]]<code>MOD</code> macro 
[[#FN-DEF-MULTIPLE-VALUE-LIST|]]<code>MULTIPLE-VALUE-LIST</code> macro 
[[#FN-DEF-MUST|]]<code>MUST</code> function[[|]]

==== N ====

[[#FN-DEF-NBUTLAST|]]<code>NBUTLAST</code> function 
[[#FN-DEF-NCONC|]]<code>NCONC</code> function 
[[#FN-DEF-NINTERSECTION|]]<code>NINTERSECTION</code> function 
[[#FN-DEF-NINTH|]]<code>NINTH</code> function 
[[#FN-DEF-NOTE-ACTIVITY|]]<code>NOTE-ACTIVITY</code> function 
[[#FN-DEF-NOTE-NUMERIC-PROGRESS|]]<code>NOTE-NUMERIC-PROGRESS</code> function 
[[#FN-DEF-NOTE-PERCENT-PROGRESS|]]<code>NOTE-PERCENT-PROGRESS</code> function 
[[#FN-DEF-NOTIFY-USER|]]<code>NOTIFY-USER</code> macro 
[[#FN-DEF-NOTING-ACTIVITY|]]<code>NOTING-ACTIVITY</code> macro 
[[#FN-DEF-NOTING-NUMERIC-PROGRESS|]]<code>NOTING-NUMERIC-PROGRESS</code> macro 
[[#FN-DEF-NOTING-PERCENT-PROGRESS|]]<code>NOTING-PERCENT-PROGRESS</code> function 
[[#FN-DEF-NRECONC|]]<code>NRECONC</code> function 
[[#FN-DEF-NREVERSE|]]<code>NREVERSE</code> function 
[[#FN-DEF-NSET-DIFFERENCE|]]<code>NSET-DIFFERENCE</code> function 
[[#FN-DEF-NSET-EXCLUSIVE-OR|]]<code>NSET-EXCLUSIVE-OR</code> function 
[[#FN-DEF-NSTRING-CAPITALIZE|]]<code>NSTRING-CAPITALIZE</code> function 
[[#FN-DEF-NSTRING-DOWNCASE|]]<code>NSTRING-DOWNCASE</code> function 
[[#FN-DEF-NSTRING-UPCASE|]]<code>NSTRING-UPCASE</code> function 
[[#FN-DEF-NSUBLIS|]]<code>NSUBLIS</code> function 
[[#FN-DEF-NSUBST|]]<code>NSUBST</code> function 
[[#FN-DEF-NSUBST-IF|]]<code>NSUBST-IF</code> function 
[[#FN-DEF-NSUBSTITUTE|]]<code>NSUBSTITUTE</code> function 
[[#FN-DEF-NSUBSTITUTE-IF|]]<code>NSUBSTITUTE-IF</code> function 
[[#FN-DEF-NTH|]]<code>NTH</code> function 
[[#FN-DEF-NTHCDR|]]<code>NTHCDR</code> function 
[[#FN-DEF-NULL|]]<code>NULL</code> function 
[[#FN-DEF-NUMBERP|]]<code>NUMBERP</code> function 
[[#FN-DEF-NUNION|]]<code>NUNION</code> function[[|]]

==== O ====

[[#FN-DEF-ODDP|]]<code>ODDP</code> function 
[[#FN-DEF-OPEN-BINARY|]]<code>OPEN-BINARY</code> function 
[[#FN-DEF-OPEN-TCP-STREAM|]]<code>OPEN-TCP-STREAM</code> function 
[[#FN-DEF-OPEN-TEXT|]]<code>OPEN-TEXT</code> function 
[[#FN-DEF-OUTPUT-STREAM-P|]]<code>OUTPUT-STREAM-P</code> function[[|]]

==== P ====

[[#FN-DEF-PAIRLIS|]]<code>PAIRLIS</code> macro 
[[#FN-DEF-PCASE|]]<code>PCASE</code> macro 
[[#FN-DEF-PCOND|]]<code>PCOND</code> macro 
[[#FN-DEF-PIF|]]<code>PIF</code> function 
[[#FN-DEF-PLUSP|]]<code>PLUSP</code> function 
[[#FN-DEF-POSITION|]]<code>POSITION</code> function 
[[#FN-DEF-POSITION-IF|]]<code>POSITION-IF</code> function 
[[#FN-DEF-PRIN1|]]<code>PRIN1</code> function 
[[#FN-DEF-PRIN1-TO-STRING|]]<code>PRIN1-TO-STRING</code> function 
[[#FN-DEF-PRINC|]]<code>PRINC</code> function 
[[#FN-DEF-PRINC-TO-STRING|]]<code>PRINC-TO-STRING</code> function 
[[#FN-DEF-PRINT|]]<code>PRINT</code> macro 
[[#FN-DEF-PRINTING-OBJECT|]]<code>PRINTING-OBJECT</code> function 
[[#FN-DEF-PROBE-FILE|]]<code>PROBE-FILE</code> function 
[[#FN-DEF-PROCLAIM|]]<code>PROCLAIM</code> macro 
[[#FN-DEF-PROGN|]]<code>PROGN</code> macro 
[[#FN-DEF-PUNLESS|]]<code>PUNLESS</code> function 
[[#FN-DEF-PUT|]]<code>PUT</code> macro 
[[#FN-DEF-PWHEN|]]<code>PWHEN</code> function[[|]]

==== Q ====

[[#FN-DEF-QUOTE|]]<code>QUOTE</code> function[[|]]

==== R ====

[[#FN-DEF-RANDOM|]]<code>RANDOM</code> function 
[[#FN-DEF-RASSOC|]]<code>RASSOC</code> function 
[[#FN-DEF-RASSOC-IF|]]<code>RASSOC-IF</code> function 
[[#FN-DEF-READ|]]<code>READ</code> function 
[[#FN-DEF-READ-BYTE|]]<code>READ-BYTE</code> function 
[[#FN-DEF-READ-CHAR|]]<code>READ-CHAR</code> function 
[[#FN-DEF-READ-FROM-STRING|]]<code>READ-FROM-STRING</code> function 
[[#FN-DEF-READ-LINE|]]<code>READ-LINE</code> function 
[[#FN-DEF-REM|]]<code>REM</code> function 
[[#FN-DEF-REMHASH|]]<code>REMHASH</code> function 
[[#FN-DEF-REMOVE|]]<code>REMOVE</code> function 
[[#FN-DEF-REMOVE-DUPLICATES|]]<code>REMOVE-DUPLICATES</code> function 
[[#FN-DEF-REMOVE-IF|]]<code>REMOVE-IF</code> function 
[[#FN-DEF-REMPROP|]]<code>REMPROP</code> function 
[[#FN-DEF-RENAME-FILE|]]<code>RENAME-FILE</code> function 
[[#FN-DEF-REPLACE|]]<code>REPLACE</code> function 
[[#FN-DEF-REPORT-ERROR|]]<code>REPORT-ERROR</code> function 
[[#FN-DEF-REST|]]<code>REST</code> function 
[[#FN-DEF-RESTART-PROCESS|]]<code>RESTART-PROCESS</code> macro 
[[#FN-DEF-RET|]]<code>RET</code> function 
[[#FN-DEF-REVAPPEND|]]<code>REVAPPEND</code> function 
[[#FN-DEF-REVERSE|]]<code>REVERSE</code> function 
[[#FN-DEF-ROUND|]]<code>ROUND</code> function 
[[#FN-DEF-RPLACA|]]<code>RPLACA</code> function 
[[#FN-DEF-RPLACD|]]<code>RPLACD</code> function[[|]]

==== S ====

[[#FN-DEF-SCALE-FLOAT|]]<code>SCALE-FLOAT</code> function 
[[#FN-DEF-SEARCH|]]<code>SEARCH</code> function 
[[#FN-DEF-SECOND|]]<code>SECOND</code> function 
[[#FN-DEF-SEED-RANDOM|]]<code>SEED-RANDOM</code> function 
[[#FN-DEF-SEQUENCEP|]]<code>SEQUENCEP</code> function 
[[#FN-DEF-SET|]]<code>SET</code> function 
[[#FN-DEF-SET-AREF|]]<code>SET-AREF</code> function 
[[#FN-DEF-SET-CHAR|]]<code>SET-CHAR</code> function 
[[#FN-DEF-SET-CONSING-STATE|]]<code>SET-CONSING-STATE</code> function 
[[#FN-DEF-SET-DIFFERENCE|]]<code>SET-DIFFERENCE</code> function 
[[#FN-DEF-SET-EXCLUSIVE-OR|]]<code>SET-EXCLUSIVE-OR</code> function 
[[#FN-DEF-SET-FILE-POSITION|]]<code>SET-FILE-POSITION</code> function 
[[#FN-DEF-SET-NTH|]]<code>SET-NTH</code> function 
[[#FN-DEF-SETHASH|]]<code>SETHASH</code> function 
[[#FN-DEF-SEVENTH|]]<code>SEVENTH</code> function 
[[#FN-DEF-SIXTH|]]<code>SIXTH</code> function 
[[#FN-DEF-SLEEP|]]<code>SLEEP</code> function 
[[#FN-DEF-SORT|]]<code>SORT</code> function 
[[#FN-DEF-STABLE-SORT|]]<code>STABLE-SORT</code> function 
[[#FN-DEF-STREAMP|]]<code>STREAMP</code> function 
[[#FN-DEF-STRING|]]<code>STRING</code> function 
[[#FN-DEF-STRING-CAPITALIZE|]]<code>STRING-CAPITALIZE</code> function 
[[#FN-DEF-STRING-DOWNCASE|]]<code>STRING-DOWNCASE</code> function 
[[#FN-DEF-STRING-EQUAL|]]<code>STRING-EQUAL</code> function 
[[#FN-DEF-STRING-GREATERP|]]<code>STRING-GREATERP</code> function 
[[#FN-DEF-STRING-LEFT-TRIM|]]<code>STRING-LEFT-TRIM</code> function 
[[#FN-DEF-STRING-LESSP|]]<code>STRING-LESSP</code> function 
[[#FN-DEF-STRING-NOT-EQUAL|]]<code>STRING-NOT-EQUAL</code> function 
[[#FN-DEF-STRING-NOT-GREATERP|]]<code>STRING-NOT-GREATERP</code> function 
[[#FN-DEF-STRING-NOT-LESSP|]]<code>STRING-NOT-LESSP</code> function 
[[#FN-DEF-STRING-RIGHT-TRIM|]]<code>STRING-RIGHT-TRIM</code> function 
[[#FN-DEF-STRING-TRIM|]]<code>STRING-TRIM</code> function 
[[#FN-DEF-STRING-UPCASE|]]<code>STRING-UPCASE</code> function 
[[#FN-DEF-STRING/=|]]<code>STRING/=</code> function 
[[#FN-DEF-427203732|]]<code>STRING<</code> function 
[[#FN-DEF-994985164|]]<code>STRING<=</code> function 
[[#FN-DEF-STRING=|]]<code>STRING=</code> function 
[[#FN-DEF-427203988|]]<code>STRING></code> function 
[[#FN-DEF-995017932|]]<code>STRING>=</code> function 
[[#FN-DEF-STRINGP|]]<code>STRINGP</code> function 
[[#FN-DEF-SUBLIS|]]<code>SUBLIS</code> function 
[[#FN-DEF-SUBSEQ|]]<code>SUBSEQ</code> function 
[[#FN-DEF-SUBSETP|]]<code>SUBSETP</code> function 
[[#FN-DEF-SUBST|]]<code>SUBST</code> function 
[[#FN-DEF-SUBST-IF|]]<code>SUBST-IF</code> function 
[[#FN-DEF-SUBSTITUTE|]]<code>SUBSTITUTE</code> function 
[[#FN-DEF-SUBSTITUTE-IF|]]<code>SUBSTITUTE-IF</code> function 
[[#FN-DEF-SXHASH|]]<code>SXHASH</code> function 
[[#FN-DEF-SYMBOL-FUNCTION|]]<code>SYMBOL-FUNCTION</code> function 
[[#FN-DEF-SYMBOL-NAME|]]<code>SYMBOL-NAME</code> function 
[[#FN-DEF-SYMBOL-PLIST|]]<code>SYMBOL-PLIST</code> function 
[[#FN-DEF-SYMBOL-VALUE|]]<code>SYMBOL-VALUE</code> function 
[[#FN-DEF-SYMBOLP|]]<code>SYMBOLP</code> function[[|]]

==== T ====

[[#FN-DEF-TAILP|]]<code>TAILP</code> function 
[[#FN-DEF-TENTH|]]<code>TENTH</code> function 
[[#FN-DEF-TERPRI|]]<code>TERPRI</code> function 
[[#FN-DEF-THIRD|]]<code>THIRD</code> function 
[[#FN-DEF-THROW|]]<code>THROW</code> function 
[[#FN-DEF-TIME-FROM-NOW|]]<code>TIME-FROM-NOW</code> function 
[[#FN-DEF-TIME-HAS-ARRIVED?|]]<code>TIME-HAS-ARRIVED?</code> function 
[[#FN-DEF-TIMESTRING|]]<code>TIMESTRING</code> function 
[[#FN-DEF-TREE-EQUAL|]]<code>TREE-EQUAL</code> function 
[[#FN-DEF-TRUNCATE|]]<code>TRUNCATE</code> function[[|]]

==== U ====

[[#FN-DEF-UNION|]]<code>UNION</code> function 
[[#FN-DEF-UNREAD-CHAR|]]<code>UNREAD-CHAR</code> function 
[[#FN-DEF-UPPER-CASE-P|]]<code>UPPER-CASE-P</code> function 
[[#FN-DEF-USER-CONFIRM|]]<code>USER-CONFIRM</code> function[[|]]

==== V ====

[[#FN-DEF-VALUES|]]<code>VALUES</code> function 
[[#FN-DEF-VARIABLE-INFORMATION|]]<code>VARIABLE-INFORMATION</code> function 
[[#FN-DEF-VECTOR|]]<code>VECTOR</code> function 
[[#FN-DEF-VECTORP|]]<code>VECTORP</code> function[[|]]

==== W ====

[[#FN-DEF-WARN|]]<code>WARN</code> macro 
[[#FN-DEF-WITH-BINARY-FILE|]]<code>WITH-BINARY-FILE</code> macro 
[[#FN-DEF-WITH-STATIC-AREA|]]<code>WITH-STATIC-AREA</code> macro 
[[#FN-DEF-WITH-TEXT-FILE|]]<code>WITH-TEXT-FILE</code> function 
[[#FN-DEF-WRITE|]]<code>WRITE</code> function 
[[#FN-DEF-WRITE-BYTE|]]<code>WRITE-BYTE</code> function 
[[#FN-DEF-WRITE-CHAR|]]<code>WRITE-CHAR</code> function 
[[#FN-DEF-WRITE-IMAGE|]]<code>WRITE-IMAGE</code> function 
[[#FN-DEF-WRITE-LINE|]]<code>WRITE-LINE</code> function 
[[#FN-DEF-WRITE-STRING|]]<code>WRITE-STRING</code> function 
[[#FN-DEF-WRITE-TO-STRING|]]<code>WRITE-TO-STRING</code> function[[|]]

==== X ====

[[|]]

==== Y ====

[[|]]

==== Z ====

[[#FN-DEF-ZEROP|]]<code>ZEROP</code>

SubL

2017-04-17T09:53:21Z

DouglasRMiles: Created page with "| == [http://web.archive.org/web/20060325065433/http://www.opencyc.org File:/web/20060325065433im_/http://www.cyc.com/cycdoc/img/opencyc-logo-small.gif|OpenCyc.org Home..."

[[|]]

== [http://web.archive.org/web/20060325065433/http://www.opencyc.org [[File:/web/20060325065433im_/http://www.cyc.com/cycdoc/img/opencyc-logo-small.gif|OpenCyc.org Homepage]]]SubL Reference ==

E-Mail Comments to: [http://web.archive.org/web/20060325065433/mailto:opencyc-doc@cyc.com opencyc-doc@cyc.com] 
Last Update: 03/28/2002 
''CopyrightÂ© 1996-2002 [http://web.archive.org/web/20060325065433/http://www.cyc.com Cycorp]. All rights reserved.'' 

-----

= How to Use this Document =

SubL is a computer language built by members of Cycorp. SubL was written to support the CycÂ® application, allowing it to run both under Lisp environments and as a C application generated by a SubL-to-C translator. This document describes the primitive functions of SubL.

Due to the close similarities between SubL and Common Lisp, the [[#Table-of-Contents|Table of Contents]] and structure of this document intentionally mirror that of

<blockquote>'''"Common Lisp: The Language"''', 
2nd Edition, 
Guy L. Steele Jr 
</blockquote>
making it easy to compare and contrast the two languages. For the most part, this document focuses only on the differences between SubL and Common Lisp.

An online version of [http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/clm.html "Common Lisp: The Language"] can be found at

<blockquote>[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/clm.html '''<code>http://www.supelec.fr/docs/cltl/clm/clm.html</code>'''] **not working**</blockquote>
and an [http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/index.html index to all Common Lisp functions] can be found at

<blockquote>[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/index.html '''<code>http://www.supelec.fr/docs/cltl/clm/index.html</code>'''] **this is working**</blockquote>
Each section of this document contains a link labelled '''"CLtL2 Reference"''' to the corresponding sections of the above online Common Lisp reference. The reader is strongly encouraged to consult that reference in parallel with this document. [[|]]

-----

= 0 : Table of Contents =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node1.html CLtL2 Reference]

* [[#Table-of-Contents|0 : Table of Contents]]
* [[#Introduction|1 : Introduction]]
* [[#Data-Types|2 : Data Types]]
* [[#Scope-and-Extent|3 : Scope and Extent]]
* [[#Type-Specifiers|4 : Type Specifiers]]
* [[#Program-Structure|5 : Program Structure]]
** [[#Defining-Named-Functions|5.3.1 : Defining Named Functions]]
** [[#Declaring|5.3.2 : Declaring Global Variables and Named Constants]]
* [[#Predicates|6 : Predicates]]
** [[#Logical-Values|6.1 : Logical Values]]
** [[#Specific-Data-Type-Predicates|6.2.2 : Specific Data Type Predicates]]
** [[#Equality-Predicates|6.3 : Equality Predicates]]
** [[#Logical-Operators|6.4 : Logical Operators]]
* [[#Control-Structure|7 : Control Structure]]
** [[#Reference|7.1.1 : Reference]]
** [[#Assignment|7.1.2 : Assignment]]
** [[#Generalized-Variables|7.2 : Generalized Variables]]
** [[#Function-Invocation|7.3 : Function Invocation]]
** [[#Simple-Sequencing|7.4 : Simple Sequencing]]
** [[#Establishing-New-Variable-Bindings|7.5 : Establishing New Variable Bindings]]
** [[#Conditionals|7.6 : Conditionals]]
** [[#Blocks-and-Exits|7.7 : Blocks and Exits]]
** [[#General-Iteration|7.8.2 : General Iteration]]
** [[#Simple-Iteration-Constructs|7.8.3 : Simple Iteration Constructs]]
** [[#Mapping|7.8.4 : Mapping]]
** [[#Constructs-for-Handling-Multiple-Values|7.10.1 : Constructs for Handling Multiple Values]]
** [[#Rules-Governing-the-Passing-of-Multiple-Values|7.10.2 : Rules Governing the Passing of Multiple Values]]
** [[#Dynamic-Non-Local-Exits|7.11 : Dynamic Non-Local Exits]]
* [[#Macros|8 : Macros]]
** [[#Macro-Definition|8.1 : Macro Definition]]
** [[#Destructuring|8.3 : Destructuring]]
** [[#Environments|8.5 : Environments]]
* [[#Declarations|9 : Declarations]]
** [[#Declaration-Syntax|9.1 : Declaration Syntax]]
** [[#Declaration-Specifiers|9.2 : Declaration Specifiers]]
* [[#Symbols|10 : Symbols]]
** [[#The-Property-List|10.1 : The Property List]]
** [[#The-Print-Name|10.2 : The Print Name]]
** [[#Creating-Symbols|10.3 : Creating Symbols]]
* [[#Packages|11 : Packages]]
* [[#Numbers|12 : Numbers]]
** [[#Predicates-on-Numbers|12.2 : Predicates on Numbers]]
** [[#Comparisons-on-Numbers|12.3 : Comparisons on Numbers]]
** [[#Arithmetic-Operations|12.4 : Arithmetic Operations]]
** [[#Irrational-and-Transcendental-Functions|12.5 : Irrational and Transcendental Functions]]
** [[#Type-Conversions-and-Component-Extractions-on-Numbers|12.6 : Type Conversions and Component Extractions on Numbers]]
** [[#Logical-Operations-on-Numbers|12.7 : Logical Operations on Numbers]]
** [[#Byte-Manipulation-Functions|12.8 : Byte Manipulation Functions]]
** [[#Random-Numbers|12.9 : Random Numbers]]
** [[#Implementation-Parameters|12.10 : Implementation Parameters]]
* [[#Characters|13 : Characters]]
** [[#Character-Attributes|13.1 : Character Attributes]]
** [[#Predicates-on-Characters|13.2 : Predicates on Characters]]
** [[#Character-Construction-and-Selection|13.3 : Character Construction and Selection]]
** [[#Character-Conversions|13.4 : Character Conversions]]
* [[#Sequences|14 : Sequences]]
** [[#Simple-Sequence-Functions|14.1 : Simple Sequence Functions]]
** [[#Concatenating-Mapping-and-Reducing-Sequences|14.2 : Concatenating, Mapping and Reducing Sequences]]
** [[#Modifying-Sequences|14.3 : Modifying Sequences]]
** [[#Searching-Sequences-for-Terms|14.4 : Searching Sequences for Terms]]
** [[#Sorting-and-Merging|14.5 : Sorting and Merging]]
* [[#Lists-Chapter|15 : Lists]]
** [[#Conses|15.1 : Conses]]
** [[#Lists|15.2 : Lists]]
** [[#Alteration-of-List-Structure|15.3 : Alteration of List Structure]]
** [[#Substitution-of-Expressions|15.4 : Substitution of Expressions]]
** [[#Using-Lists-as-Sets|15.5 : Using Lists as Sets]]
** [[#Association-Lists|15.6 : Association Lists]]
* [[#Hash-Tables|16 : Hash Tables]]
** [[#Hash-Table-Functions|16.1 : Hash Table Functions]]
** [[#Primitive-Hash-Function|16.2 : Primitive Hash Function]]
* [[#Arrays|17 : Arrays]]
** [[#Vector-Creation|17.1 : Vector Creation]]
** [[#Vector-Access|17.2 : Vector Access]]
* [[#Strings|18 : Strings]]
** [[#String-Access|18.1 : String Access]]
** [[#String-Comparison|18.2 : String Comparison]]
** [[#String-Construction-and-Manipulation|18.3 : String Construction and Manipulation]]
* [[#Structures|19 : Structures]]
* [[#The-Evaluator|20 : The Evaluator]]
** [[#Run-Time-Evaluation-of-Forms|20.1 : Run-Time Evaluation of Forms]]
** [[#The-Top-Level-Loop|20.2 : The Top-Level Loop]]
* [[#Streams|21 : Streams]]
** [[#Standard-Streams|21.1 : Standard Streams]]
** [[#Creating-new-Streams|21.2 : Creating new Streams]]
** [[#Operations-on-Streams|21.3 : Operations on Streams]]
* [[#Input-Output|22 : Input/Output]]
** [[#Printed-Representation-of-SubL-Objects|22.1 : Printed Representation of SubL Objects]]
** [[#Macro-Characters|22.1.3 : Macro Characters]]
** [[#Standard-Dispatching-Macro-Character-Syntax|22.1.4 : Standard Dispatching Macro Character Syntax]]
** [[#The-Readtable|22.1.5 : The Readtable]]
** [[#What-the-Print-Function-Produces|22.1.6 : What the Print Function Produces]]
** [[#Input-from-Character-Streams|22.2.1 : Input from Character Streams]]
** [[#Input-from-Binary-Streams|22.2.2 : Input from Binary Streams]]
** [[#Output-to-Character-Streams|22.3.1 : Output to Character Streams]]
** [[#Output-to-Binary-Streams|22.3.2 : Output to Binary Streams]]
** [[#Formatted-Output-to-Character-Streams|22.3.3 : Formatted Output to Character Streams]]
* [[#File-System-Interface|23 : File System Interface]]
** [[#File-Names|23.1 : File Names]]
** [[#Opening-and-Closing-Files|23.2 : Opening and Closing Files]]
** [[#Renaming-Deleting-and-Other-File-Operations|23.3 : Renaming, Deleting and Other File Operations]]
** [[#Loading-Files|23.4 : Loading Files]]
** [[#Accessing-Directories|23.5 : Accessing Directories]]
* [[#Errors|24 : Errors]]
** [[#General-Error-Signalling-Functions|24.1 : General Error-Signalling Functions]]
** [[#Specialized-Error-Signalling-Forms-and-Macros|24.2 : Specialized Error-Signalling Forms and Macros]]
* [[#Miscellaneous-Features|25 : Miscellaneous Features]]
** [[#The-Compiler|25.1 : The Compiler]]
** [[#Debugging-Tools|25.3 : Debugging Tools]]
** [[#Time-Functions|25.4.1 : Time Functions]]
** [[#Identity-Function|25.5 : Identity Function]]
* [[#Common-Lisp-Object-System|28 : Common Lisp Object System]]
* [[#SubL-Specific-Features|SubL-Specific Features]]
** [[#Signals|SubL.1 : Signals]]
** [[#System-Properties|SubL.2 : System Properties]]
** [[#Progress-Pacifiers|SubL.3 : Progress Pacifiers]]
** [[#Process-Manipulation|SubL.4 : Process Manipulation]]
** [[#Memory-Interaction|SubL.5 : Memory Interaction]]
* [[#Index|Index]]

[[|]]

-----

= 1 : Introduction =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node5.html CLtL2 Reference]

SubL is a programming language intended to be very similar to a simplified version of Common Lisp where those features that are either complex, rarely-used, or difficult to implement in a prodecural language have been excised.

Unlike Common Lisp, SubL is not a purely functional language. Several SubL constructs can only be used procedurally. In order to emphasize this difference, the following naming convention for SubL constructs is used:

<blockquote>A SubL function will have the same name as the analogous Common Lisp function if it is intended to have the exact same basic functionality. The argument list may be simplified, but the intent and use are likely to be the same.</blockquote>
If there is a substantial behavioral difference between a SubL function and its Common Lisp counterpart, its name will be the Common Lisp name prepended with a single character -- either "c", "p" or "f".

<blockquote>"c" indicates a construct that is either only procedural or functional. 
"p" indicates the procedural version of a Common Lisp construct. 
"f" indicates the functional version of a Common Lisp construct. 
</blockquote>
A procedural construct in SubL is one which is suitable for evaluation as either one form in an explicit [[#FN-DEF-PROGN|<code>PROGN</code>]] or as one form in an implicit progn, which occur in the <code>&body;</code> sections of many of the procedural forms such as [[#FN-DEF-CLET|<code>CLET</code>]], [[#FN-DEF-PWHEN|<code>PWHEN</code>]], [[#FN-DEF-CDOLIST|<code>CDOLIST</code>]] etc.

Here is a table of all the procedural constructs in SubL and the Common Lisp analog:

<blockquote>'''SubL Procedural Construct'''

<pre> </pre>
'''Common Lisp Equivalent'''

-----

<code> PROGN</code>

<code> progn</code>

<code> PIF</code>

<code> if</code>

<code> PWHEN</code>

<code> when</code>

<code> PUNLESS</code>

<code> unless</code>

<code> PCOND</code>

<code> cond</code>

<code> PCASE</code>

<code> case</code>

<code> CSETQ</code>

<code> setq</code>

<code> CSETF</code>

<code> setf</code>

<code> CINC</code>

<code> incf</code>

<code> CDEC</code>

<code> decf</code>

<code> CPUSH</code>

<code> push</code>

<code> CPUSHNEW</code>

<code> pushnew</code>

<code> CPOP</code>

<code> pop</code>

<code> CLET</code>

<code> let*</code>

<code> CMULTIPLE-VALUE-BIND</code>

<code> multiple-value-bind</code>

<code> CDO</code>

<code> do*</code>

<code> CDOLIST</code>

<code> dolist</code>

<code> CSOME</code>

<code> </code>

<code> CDOTIMES</code>

<code> dotimes</code>

<code> CDOHASH</code>

<code> </code>

<code> CCATCH</code>

<code> catch</code>

<code> CUNWIND-PROTECT</code>

<code> unwind-protect</code>

<code> RET</code>

<code> return-from</code>
</blockquote>
A functional construct in SubL is one which returns a value. Here is a table of all the functional constructs in SubL and the Common Lisp analog:

<blockquote>'''SubL Functional Construct'''

<pre> </pre>
'''Common Lisp Equvalent'''

-----

<code> CAND</code>

<code> and</code>

<code> COR</code>

<code> or</code>

<code> CNOT</code>

<code> not</code>

<code> FIF</code>

<code> if</code>

<code> FWHEN</code>

<code> when</code>

<code> FUNLESS</code>

<code> unless</code>
</blockquote>
The body of a function or macro definition is considered an implicit progn, and so all forms in the body should be procedural. A function call can be used as a procedural construct. In this case, the returned value is simply ignored. [[|]]

-----

= 2 : Data Types =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node15.html CLtL2 Reference]

SubL has a flat type heirarchy. Each type is described in more detail in the sections about the methods for that particular type.

SubL supports these built-in Common Lisp datatypes:

<blockquote>{|
|width="50%"| Numbers:
|width="50%"| fixnum
|-
|

| float
|-
| Symbols:
| symbol
|-
| Lists:
| cons
|-
| Arrays:
| vector
|-
| Characters:
| character
|-
| Strings:
| string
|-
| Hashtables:
| eq hashtable
|-
|

| eql hashtable
|-
|

| equal hashtable
|-
|

| equalp hashtable
|-
| Streams:
| stream
|-
| Functions:
| function
|}
</blockquote>
SubL does '''not''' support these Common Lisp datatypes:

<blockquote>Multi-dimensional arrays 
Packages 
Pathnames 
Random-states 
Lambda-Expressions or Closures 
</blockquote>
SubL has only special-case support for these datatypes:

<blockquote>{|
| Readtables:
| SubL only supports a single internal readtable
|}
</blockquote>
New data types can be introduced via [[#FN-DEF-DEFSTRUCT|<code>DEFSTRUCT</code>]]. [[|]]

-----

= 3 : Scope and Extent =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node43.html CLtL2 Reference]

Special variables in SubL are all (and only) those variables defined globally with [[#FN-DEF-DEFVAR|<code>DEFVAR</code>]] or [[#FN-DEF-DEFPARAMETER|<code>DEFPARAMETER</code>]]. In addition, the name of each special variable must begin and end with an asterisk character : <code>'*'</code>.

Special variables have indefinite scope and dynamic extent. All other variables have lexical scope and dynamic extent

Variables are introduced via:

; '''Function call'''
: A new set of variables for the formal parameters of the function are introduced. The extent of the function arguments is the duration of the function invocation.
; '''[[#FN-DEF-CLET|<code>CLET</code>]], [[#FN-DEF-CMULTIPLE-VALUE-BIND|<code>CMULTIPLE-VALUE-BIND</code>]], [[#FN-DEF-CDESTRUCTURING-BIND|<code>CDESTRUCTURING-BIND</code>]]'''
: These constructs explicitly introduce and initialize new local variables. The extent of these variables is until exit from the constuct.
; '''[[#FN-DEF-CDO|<code>CDO</code>]], [[#FN-DEF-CDOLIST|<code>CDOLIST</code>]], [[#FN-DEF-CSOME|<code>CSOME</code>]], [[#FN-DEF-CDOTIMES|<code>CDOTIMES</code>]], [[#FN-DEF-CDOHASH|<code>CDOHASH</code>]]'''
: These iteration constructs explicitly introduce and update local variables which represent the state of the iteration. The extent of these variables is until exit from the iteration construct.

When a local variable is introduced with the same name as a local variable which is already within the current scope and extent, the new variable shadows the outer variable.

The initialization of a local variable is considered to occur within the scope of the new local variable. Consequently, a variable which is shadowing an outer variable cannot be initialized in terms of the outer value. For example, this is not allowed :

<blockquote><pre>(define foo (x)
(clet ((x (+ x 1)))
(print x))
(ret nil))</pre></blockquote>
However, if the variable is a special variable, the [[#FN-DEF-CLET|<code>CLET</code>]] is actually introducing a binding for the special variable, not introducing a new local variable. In this case, the initialization of the binding can be a function of its current value for the variable being bound. For example, this is allowed:

<blockquote><pre>(defvar *some-var* 1)

(define foo (x)
(clet ((*some-var* (+ *some-var* x)))
(print *some-var*))
(ret nil))</pre></blockquote>
The construct [[#FN-DEF-RET|<code>RET</code>]] must be used for a function or macro definition to return its intended result. [[|]]

-----

= 4 : Type Specifiers =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node44.html CLtL2 Reference]

SubL does not support type specifiers. [[|]]

-----

= 5 : Program Structure =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node55.html CLtL2 Reference]

Program structure in SubL mirrors that of Common Lisp almost exactly. All objects except lists and symbols are self-evaluating. This includes numbers, characters, strings, vectors and hashtables. In addition :

* Keyword symbols are self-evaluating.
* The symbols T and NIL are self-evaluating.

[[|]]

== 5.3.1 : Defining Named Functions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node66.html CLtL2 Reference] 
 
[[|]]macro <code>DEFINE : (name arglist &body body)</code>

All functions in SubL must be named and therefore defined via the SubL construct [[#FN-DEF-DEFINE|<code>DEFINE</code>]]. See also the similar construct [[#FN-DEF-DEFPOLYMORPHIC|<code>DEFPOLYMORPHIC</code>]] which is used to define generic functions which switch off the type of the first argument.

Argument lists for user-defined function can only be of this form:

<blockquote><pre>( {var}* [&optional; {var | ( var [initform [supplied-var]] ) }*] )</pre></blockquote>
In short, SubL supports <code>&optional;</code> arguments for user-defined functions but does '''not''' support <code>&keyword;</code>, <code>&aux;</code> or <code>&rest;</code> arguments for user-defined functions. [[|]]

== 5.3.2 : Declaring Global Variables and Named Constants ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node67.html CLtL2 Reference] 
 
[[|]]macro <code>DEFVAR : (variable &optional initialization documentation)</code> 
 
[[|]]macro <code>DEFPARAMETER : (variable initialization &optional documentation)</code>

[[#FN-DEF-DEFVAR|<code>DEFVAR</code>]] and [[#FN-DEF-DEFPARAMETER|<code>DEFPARAMETER</code>]] are the SubL constructs used to define global variables. The name of each variable must begin and end with an asterisk.

SubL enforces an important distinction between these two constructs, which is described in greater detail under [[#FN-DEF-WRITE-IMAGE|<code>WRITE-IMAGE</code>]]. 
 
[[|]]macro <code>DEFCONSTANT : (variable initialization &optional documentation)</code>

As with [[#FN-DEF-DEFVAR|<code>DEFVAR</code>]] and [[#FN-DEF-DEFPARAMETER|<code>DEFPARAMETER</code>]], the name of each named constant defined via [[#FN-DEF-DEFCONSTANT|<code>DEFCONSTANT</code>]] must begin and end with an asterisk. [[|]]

-----

= 6 : Predicates =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node69.html CLtL2 Reference] [[|]]

== 6.1 : Logical Values ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node70.html CLtL2 Reference]

The symbols NIL and T are used to represent the logical values "true" and "false" in SubL and behave exactly as they do in Common Lisp. [[|]]

== 6.2.2 : Specific Data Type Predicates ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node73.html CLtL2 Reference]

For the most part, the following predicates which check for specific data types behave exactly as they do in Common Lisp. 
 
[[|]]function <code>NULL : (x)</code> 
 
[[|]]function <code>SYMBOLP : (x)</code> 
 
[[|]]function <code>ATOM : (x)</code> 
 
[[|]]function <code>CONSP : (x)</code> 
 
[[|]]function <code>LISTP : (x)</code> 
 
[[|]]function <code>NUMBERP : (x)</code> 
 
[[|]]function <code>INTEGERP : (x)</code> 
 
[[|]]function <code>FLOATP : (x)</code> 
 
[[|]]function <code>CHARACTERP : (x)</code> 
 
[[|]]function <code>STRINGP : (x)</code> 
 
[[|]]function <code>VECTORP : (x)</code> 
 
[[|]]function <code>FUNCTIONP : (x)</code> 
Follows the CLtL2 implementation 
 
[[|]]function <code>FUNCTION-SPEC-P : (x)</code> 
Returns T IFF x is an object suitable for FUNCALL

In SubL, [[#FN-DEF-FUNCTIONP|<code>FUNCTIONP</code>]] only returns T if its argument is a function object. The function [[#FN-DEF-FUNCTION-SPEC-P|<code>FUNCTION-SPEC-P</code>]] returns T if its argument is suitable for [[#FN-DEF-FUNCALL|<code>FUNCALL</code>]] or [[#FN-DEF-APPLY|<code>APPLY</code>]]. [[|]]

== 6.3 : Equality Predicates ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node74.html CLtL2 Reference]

The SubL equality predicates behave exactly like their Common Lisp counterparts. 
 
[[|]]function <code>EQ : (x y)</code> 
 
[[|]]function <code>EQL : (x y)</code> 
 
[[|]]function <code>EQUAL : (x y)</code> 
 
[[|]]function <code>EQUALP : (x y)</code> [[|]]

== 6.4 : Logical Operators ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node75.html CLtL2 Reference]

SubL logical operations '''only''' return T or NIL. Otherwise, they behave like their Common Lisp counterparts. 
 
[[|]]macro <code>CNOT : (x)</code> 
 
[[|]]macro <code>CAND : (&rest args)</code> 
 
[[|]]macro <code>COR : (&rest args)</code> [[|]]

-----

= 7 : Control Structure =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node76.html CLtL2 Reference] [[|]]

== 7.1.1 : Reference ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node78.html CLtL2 Reference]

These SubL constructs behave exactly like their Common Lisp counterparts. 
 
[[|]]function <code>QUOTE : (data)</code> 
 
[[|]]macro <code>FUNCTION : (fspec)</code> 
 
[[|]]function <code>SYMBOL-VALUE : (x)</code> 
 
[[|]]function <code>SYMBOL-FUNCTION : (x)</code> 
 
[[|]]function <code>BOUNDP : (x)</code> 
 
[[|]]function <code>FBOUNDP : (x)</code> [[|]]

== 7.1.2 : Assignment ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node79.html CLtL2 Reference] 
 
[[|]]macro <code>CSETQ : (var value &rest var-val-pairs)</code>

Since [[#FN-DEF-CSETQ|<code>CSETQ</code>]] is procedural in SubL, it does not return a value. Otherwise, it behaves just like <code>setq</code> in Common Lisp.

These SubL functions for setting and unsetting symbol properties behave like their Common Lisp counterparts. 
 
[[|]]function <code>SET : (symbol value)</code> 
 
[[|]]function <code>MAKUNBOUND : (symbol)</code> 
 
[[|]]function <code>FMAKUNBOUND : (symbol)</code> [[|]]

== 7.2 : Generalized Variables ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node80.html CLtL2 Reference] 
 
[[|]]macro <code>CSETF : (place val)</code>

[[#FN-DEF-CSETF|<code>CSETF</code>]] is a more restricted version of <code>setf</code> in Common Lisp. First, since it is procedural, like [[#FN-DEF-CSETQ|<code>CSETQ</code>]] it does not return a value. Second, there is a much more restricted set of place-specifiers which are allowable. Here is a complete table of the allowable [[#FN-DEF-CSETF|<code>CSETF</code>]] forms, and their equivalent SubL expansions:

'''CSETF form'''

<pre> </pre>
'''Equivalent SubL expansion'''

-----

<code> (CSETF</code> variable value''')'''

<code> (CSETQ</code> variable value''')'''

<code> (CSETF</code> ([[#FN-DEF-AREF|<code>AREF</code>]] vector n''')''' value''')'''

<code> (SET-AREF</code> vector n value''')'''

<code> (CSETF</code> ([[#FN-DEF-NTH|<code>NTH</code>]] n list''')''' value''')'''

<code> (SET-NTH</code> n list value''')'''

<code> (CSETF</code> ([[#FN-DEF-CAR|<code>CAR</code>]] cons''')''' value''')'''

<code> (RPLACA</code> cons value''')'''

<code> (CSETF</code> ([[#FN-DEF-CDR|<code>CDR</code>]] cons''')''' value''')'''

<code> (RPLACD</code> cons value''')'''

<code> (CSETF</code> ([[#FN-DEF-GET|<code>GET</code>]] symbol indicator''')''' value''')'''

<code> (PUT</code> symbol indicator value''')'''

<code> (CSETF</code> ([[#FN-DEF-GETHASH|<code>GETHASH</code>]] key hashtable''')''' value''')'''

<code> (SETHASH</code> key hashtable value''')'''

<code> (CSETF</code> ([[#FN-DEF-SYMBOL-VALUE|<code>SYMBOL-VALUE</code>]] symbol''')''' value''')'''

<code> (SET</code> symbol value''')'''

<code> (CSETF</code> (defstruct-slot object''')''' value''')'''

<code> (set-defstruct-slot object value)</code>

In the above table, '''defstruct-slot''' refers to any structure slot accessor function which got defined via defstruct, and '''set-defstruct-slot''' refers to the corresponding setter function for the given accessor. [[|]]

== 7.3 : Function Invocation ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node81.html CLtL2 Reference]

These functions behave like their Common Lisp counterparts. 
 
[[|]]function <code>APPLY : (function argument &rest arguments)</code> 
 
[[|]]function <code>FUNCALL : (function &rest args)</code>

The first argument to both [[#FN-DEF-APPLY|<code>APPLY</code>]] and [[#FN-DEF-FUNCALL|<code>FUNCALL</code>]] must satisfy [[#FN-DEF-FUNCTION-SPEC-P|<code>FUNCTION-SPEC-P</code>]]. [[|]]

== 7.4 : Simple Sequencing ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node82.html CLtL2 Reference] 
 
[[|]]macro <code>PROGN : (&body body)</code>

In SubL, [[#FN-DEF-PROGN|<code>PROGN</code>]] is procedural and therefore does not return a value. Since it is intended to be essentially procedural in Common Lisp as well, the same name is used even though they have slightly different semantics. [[|]]

== 7.5 : Establishing New Variable Bindings ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node83.html CLtL2 Reference] 
 
[[|]]macro <code>CLET : (bindings &body body)</code>

The SubL construct [[#FN-DEF-CLET|<code>CLET</code>]] can be used to introduce new local variables or bind special variables. The variables are initialized in order just like <code>LET*</code> in Common Lisp. Since it is procedural, it does not return a value.

SubL has no counterpart to Common Lisp's <code>LET</code> construct. 
 
[[|]]macro <code>CPROGV : (special-vars bindings &body body)</code>

[[#FN-DEF-CPROGV|<code>CPROGV</code>]] is procedural and therefore does not return a value. Otherwise, it is equivalent to <code>progv</code> in Common Lisp. [[|]]

== 7.6 : Conditionals ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node84.html CLtL2 Reference] 
 
[[|]]macro <code>PIF : (condition action else-action)</code> 
 
[[|]]macro <code>PWHEN : (condition &body body)</code> 
 
[[|]]macro <code>PUNLESS : (condition &body body)</code>

[[#FN-DEF-PIF|<code>PIF</code>]], [[#FN-DEF-PWHEN|<code>PWHEN</code>]] and [[#FN-DEF-PUNLESS|<code>PUNLESS</code>]] are the SubL procedural variants of <code>if</code>, <code>when</code> and <code>unless</code> from Common Lisp. For each, the condition argument must be a functional construct. Also, [[#FN-DEF-PIF|<code>PIF</code>]] takes exactly three arguments, making the action and else-actions identical in form. 
 
[[|]]macro <code>FIF : (condition true-value false-value)</code> 
 
[[|]]macro <code>FWHEN : (condition true-value)</code> 
 
[[|]]macro <code>FUNLESS : (condition false-value)</code>

[[#FN-DEF-FIF|<code>FIF</code>]], [[#FN-DEF-FWHEN|<code>FWHEN</code>]] and [[#FN-DEF-FUNLESS|<code>FUNLESS</code>]] are the SubL functional variants of <code>if</code>, <code>when</code> and <code>unless</code> from Common Lisp. 
 
[[|]]macro <code>PCOND : (&rest clauses)</code> 
 
[[|]]macro <code>PCASE : (test-object &body clauses)</code>

[[#FN-DEF-PCOND|<code>PCOND</code>]] and [[#FN-DEF-PCASE|<code>PCASE</code>]] are the SubL procedural equivalents of <code>cond</code> and <code>case</code> from Common Lisp. [[|]]

== 7.7 : Blocks and Exits ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node85.html CLtL2 Reference] 
 
[[|]]macro <code>RET : (expression)</code> 
SubL functions must always return a value, since C functions must return values and all SubL functions must translate into C.

[[#FN-DEF-RET|<code>RET</code>]] is used to return a value from a function or macro definition. All functions and macro definitions behave as if an implicit

<blockquote><pre>(ret nil)</pre></blockquote>
appears at the very end of each function. [[|]]

== 7.8.2 : General Iteration ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node88.html CLtL2 Reference] 
 
[[|]]macro <code>CDO : (vars endtest &body body)</code> 
cdo is procedural. It binds its variables in sequence, as with CommonLisp do* [[|]]

== 7.8.3 : Simple Iteration Constructs ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node89.html CLtL2 Reference] 
 
[[|]]macro <code>CDOLIST : ((var listform) &body body)</code> 
 
[[|]]macro <code>CSOME : ((var list endvar) &body body)</code> 
 
[[|]]macro <code>CDOTIMES : ((var integer) &body body)</code> 
 
[[|]]macro <code>CDOHASH : ((key val table) &body body)</code> [[|]]

== 7.8.4 : Mapping ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node90.html CLtL2 Reference] 
 
[[|]]function <code>MAPCAR : (function list &rest more-lists)</code> 
 
[[|]]function <code>MAPLIST : (function list &rest more-lists)</code> 
 
[[|]]function <code>MAPC : (function list &rest more-lists)</code> 
 
[[|]]function <code>MAPL : (function list &rest more-lists)</code> 
 
[[|]]function <code>MAPCAN : (function list &rest more-lists)</code> 
 
[[|]]function <code>MAPCON : (function list &rest more-lists)</code> [[|]]

== 7.10.1 : Constructs for Handling Multiple Values ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node94.html CLtL2 Reference] 
 
[[|]]function <code>VALUES : (value &rest more-values)</code> 
values returns its args such that they can be bound in a dynamically enclosing multiple-value-bind. The first value is returned as well, since all SubL functions must return a value. 
 
[[|]]variable <code>*MULTIPLE-VALUES-LIMIT*</code> 
 
[[|]]macro <code>MULTIPLE-VALUE-LIST : (form)</code> 
 
[[|]]macro <code>CMULTIPLE-VALUE-BIND : (vars value &body body)</code> [[|]]

== 7.10.2 : Rules Governing the Passing of Multiple Values ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node95.html CLtL2 Reference]

In SubL, multiple values are governed the same way that they are in Common Lisp, except that if ANY of the return statements in your function are (values ...) then all of them must be. [[|]]

== 7.11 : Dynamic Non-Local Exits ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node96.html CLtL2 Reference] 
 
[[|]]macro <code>CCATCH : (tag ans-var &body body)</code> 
ccatch is procedural, and so does not return values. 
 
[[|]]macro <code>CUNWIND-PROTECT : (protected-form &body body)</code> 
 
[[|]]function <code>THROW : (tag result)</code> [[|]]

-----

= 8 : Macros =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node97.html CLtL2 Reference] [[|]]

== 8.1 : Macro Definition ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node98.html CLtL2 Reference] 
 
[[|]]macro <code>DEFMACRO : (name pattern &body body)</code>

SubL Macros are expanded at translation-time. Full Common Lisp macro support is available. However, the macro-expander must use [[#FN-DEF-RET|<code>RET</code>]] to return the expansion. [[|]]

== 8.3 : Destructuring ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node100.html CLtL2 Reference] 
 
[[|]]macro <code>CDESTRUCTURING-BIND : (pattern datum &body body)</code> [[|]]

== 8.5 : Environments ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node102.html CLtL2 Reference] 
 
[[|]]function <code>VARIABLE-INFORMATION : (variable)</code> 
 
[[|]]function <code>FUNCTION-INFORMATION : (function)</code> [[|]]

-----

= 9 : Declarations =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node103.html CLtL2 Reference] [[|]]

== 9.1 : Declaration Syntax ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node104.html CLtL2 Reference] 
 
[[|]]function <code>DECLARE : (&rest ignore)</code> 
 
[[|]]function <code>PROCLAIM : (declaration-specifier)</code> 
 
[[|]]macro <code>DECLAIM : (&rest declaration-specifiers)</code> [[|]]

== 9.2 : Declaration Specifiers ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node105.html CLtL2 Reference] 
 
[[|]]function <code>IGNORE : (&rest values)</code>

The [[#FN-DEF-IGNORE|<code>IGNORE</code>]] function can be used to indicate that a particular variable's value is not used. [[|]]

-----

= 10 : Symbols =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node107.html CLtL2 Reference] 
 
[[|]]function <code>SYMBOLP : (x)</code> [[|]]

== 10.1 : The Property List ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node108.html CLtL2 Reference] 
 
[[|]]function <code>GET : (symbol indicator &optional default)</code> 
 
[[|]]function <code>PUT : (symbol indicator new-value)</code> 
 
[[|]]function <code>REMPROP : (symbol indicator)</code> 
 
[[|]]function <code>SYMBOL-PLIST : (symbol)</code> [[|]]

== 10.2 : The Print Name ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node109.html CLtL2 Reference] 
 
[[|]]function <code>SYMBOL-NAME : (symbol)</code> 
Returns the string which is the name of SYMBOL. When called on a keyword, it returns the ":" prefix as part of the name [[|]]

== 10.3 : Creating Symbols ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node110.html CLtL2 Reference] 
 
[[|]]function <code>MAKE-SYMBOL : (print-name)</code> 
 
[[|]]function <code>GENSYM : (&optional x)</code> 
GENSYM returns new, interned symbols, which are combinations of a string prefix and a numeric suffix. It guarantees that the new symbol was not previously interned. 
If the argument X is a number, the gensym counter (used to generate the suffix) is set to X before the new symbol is generated. 
if the argument X is a string, the gensym prefix is set to X before the new symbol is generated. 
The initial gensym counter value is 1 and the initial gensym prefix is 'G'. 
 
[[|]]function <code>GENTEMP : (&optional (prefix "T"))</code> 
 
[[|]]function <code>KEYWORDP : (x)</code> 
In SubL, which does not have packages, keywords are any symbol whose name begins with ":" [[|]]

-----

= 11 : Packages =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node111.html CLtL2 Reference] 
 
[[|]]macro <code>IN-PACKAGE : (name)</code> 
 
[[|]]function <code>INTERN : (string)</code> 
Finds and returns a symbol whose name is STRING. INTERN will create the symbol if it does not exist. Unlike Common LISP intern, the SubL version does not allow an argument to specify the package, since SubL does not support packages. 
 
[[|]]function <code>FIND-SYMBOL : (string)</code> 
Finds and returns a symbol whose name is STRING. Unlike Common LISP FIND-SYMBOL, the SubL version does not allow an argument to specify the package, since SubL does not support packages. [[|]]

-----

= 12 : Numbers =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node121.html CLtL2 Reference]

SubL only supports fixnums and floats. Fixnums have at least 28 bits of precision. 
 
[[|]]function <code>NUMBERP : (x)</code> 
 
[[|]]function <code>FIXNUMP : (x)</code> 
 
[[|]]function <code>INTEGERP : (x)</code> 
 
[[|]]function <code>FLOATP : (x)</code> [[|]]

== 12.2 : Predicates on Numbers ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node123.html CLtL2 Reference] 
 
[[|]]function <code>ZEROP : (x)</code> 
 
[[|]]function <code>PLUSP : (x)</code> 
 
[[|]]function <code>MINUSP : (x)</code> 
 
[[|]]function <code>ODDP : (x)</code> 
 
[[|]]function <code>EVENP : (x)</code> [[|]]

== 12.3 : Comparisons on Numbers ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node124.html CLtL2 Reference] 
 
[[|]]function <code>= : (num1 num2)</code> 
 
[[|]]function <code>/= : (num1 num2)</code> 
 
[[|]]function <code>< : (num1 num2)</code> 
 
[[|]]function <code>> : (num1 num2)</code> 
 
[[|]]function <code><= : (num1 num2)</code> 
 
[[|]]function <code>>= : (num1 num2)</code>

The above numeric comparison functions take exactly 2 arguments, unlike their Common Lisp counterparts which take variable numbers of arguments. 
 
[[|]]function <code>MAX : (num &rest numbers)</code> 
 
[[|]]function <code>MIN : (num &rest numbers)</code> [[|]]

== 12.4 : Arithmetic Operations ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node125.html CLtL2 Reference] 
 
[[|]]function <code>+ : (&rest numbers)</code> 
 
[[|]]function <code>- : (num &rest numbers)</code> 
 
[[|]]function <code>* : (&rest numbers)</code> 
 
[[|]]function <code>/ : (num &rest numbers)</code> 
 
[[|]]function <code>INT/ : (num1 num2)</code> 
 
[[|]]macro <code>CINC : (place &optional (delta 1))</code> 
 
[[|]]macro <code>CDEC : (place &optional (delta 1))</code> [[|]]

== 12.5 : Irrational and Transcendental Functions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node126.html CLtL2 Reference]

SubL does not currently support any irrational, transcendental or trigonometric functions. [[|]]

== 12.6 : Type Conversions and Component Extractions on Numbers ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node130.html CLtL2 Reference] 
 
[[|]]function <code>FLOAT : (x)</code> 
 
[[|]]function <code>FLOOR : (x)</code> 
 
[[|]]function <code>CEILING : (x)</code> 
 
[[|]]function <code>TRUNCATE : (x)</code> 
 
[[|]]function <code>ROUND : (x)</code> 
 
[[|]]function <code>MOD : (number divisor)</code> 
 
[[|]]function <code>REM : (number divisor)</code> 
 
[[|]]function <code>SCALE-FLOAT : (float integer)</code> 
 
[[|]]function <code>INTEGER-DECODE-FLOAT : (float)</code> [[|]]

== 12.7 : Logical Operations on Numbers ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node131.html CLtL2 Reference]

SubL does not currently support any logical operations on numbers. [[|]]

== 12.8 : Byte Manipulation Functions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node132.html CLtL2 Reference] 
 
[[|]]macro <code>BYTE : (size position)</code> 
 
[[|]]function <code>LDB : (bytespec integer)</code> 
 
[[|]]function <code>DPB : (newbyte bytespec integer)</code> [[|]]

== 12.9 : Random Numbers ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node133.html CLtL2 Reference] 
 
[[|]]variable <code>*RAND-MAX*</code> 
*rand-max* is the largest fixnum that the function random can accept. 
 
[[|]]function <code>SEED-RANDOM : (&optional (seed-fixnum (mod (get-internal-real-time) *rand-max*)))</code> 
If seed-fixnum is omitted to seed-random, the internal clock is used 
in an implementation specific manner. 
 
[[|]]function <code>RANDOM : (number)</code> [[|]]

== 12.10 : Implementation Parameters ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node134.html CLtL2 Reference] 
 
[[|]]variable <code>*MOST-POSITIVE-FIXNUM*</code> 
 
[[|]]variable <code>*MOST-NEGATIVE-FIXNUM*</code> [[|]]

-----

= 13 : Characters =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node135.html CLtL2 Reference] 
 
[[|]]function <code>CHARACTERP : (x)</code> [[|]]

== 13.1 : Character Attributes ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node136.html CLtL2 Reference]

SubL does not currently support any attributes for characters. A character exists for each ASCII character code between 0 and 255 inclusive. Thus, the SubL equivalent of Common Lisp's <code>CHAR-CODE-LIMIT</code> is 256. [[|]]

== 13.2 : Predicates on Characters ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node137.html CLtL2 Reference] 
 
[[|]]function <code>ALPHA-CHAR-P : (char)</code> 
 
[[|]]function <code>UPPER-CASE-P : (char)</code> 
 
[[|]]function <code>LOWER-CASE-P : (char)</code> 
 
[[|]]function <code>BOTH-CASE-P : (char)</code> 
 
[[|]]function <code>DIGIT-CHAR-P : (char)</code> 
 
[[|]]function <code>ALPHANUMERICP : (char)</code> 
 
[[|]]function <code>CHAR= : (char1 char2)</code> 
 
[[|]]function <code>CHAR/= : (char1 char2)</code> 
 
[[|]]function <code>CHAR< : (char1 char2)</code> 
 
[[|]]function <code>CHAR> : (char1 char2)</code> 
 
[[|]]function <code>CHAR<= : (char1 char2)</code> 
 
[[|]]function <code>CHAR>= : (char1 char2)</code> 
 
[[|]]function <code>CHAR-EQUAL : (char1 char2)</code> 
 
[[|]]function <code>CHAR-NOT-EQUAL : (char1 char2)</code> 
 
[[|]]function <code>CHAR-LESSP : (char1 char2)</code> 
 
[[|]]function <code>CHAR-GREATERP : (char1 char2)</code> 
 
[[|]]function <code>CHAR-NOT-GREATERP : (char1 char2)</code> 
 
[[|]]function <code>CHAR-NOT-LESSP : (char1 char2)</code> [[|]]

== 13.3 : Character Construction and Selection ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node138.html CLtL2 Reference] 
 
[[|]]function <code>CHAR-CODE : (char)</code> 
 
[[|]]function <code>CODE-CHAR : (code)</code> [[|]]

== 13.4 : Character Conversions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node139.html CLtL2 Reference] 
 
[[|]]function <code>CHAR-DOWNCASE : (char)</code> 
 
[[|]]function <code>CHAR-UPCASE : (char)</code> [[|]]

-----

= 14 : Sequences =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node141.html CLtL2 Reference] 
 
[[|]]function <code>SEQUENCEP : (x)</code> [[|]]

== 14.1 : Simple Sequence Functions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node142.html CLtL2 Reference] 
 
[[|]]function <code>ELT : (sequence index)</code> 
 
[[|]]function <code>SUBSEQ : (sequence start &optional end)</code> 
 
[[|]]function <code>COPY-SEQ : (sequence)</code> 
 
[[|]]function <code>LENGTH : (sequence)</code> 
 
[[|]]function <code>REVERSE : (sequence)</code> 
 
[[|]]function <code>NREVERSE : (sequence)</code> [[|]]

== 14.2 : Concatenating, Mapping and Reducing Sequences ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node143.html CLtL2 Reference] 
 
[[|]]function <code>CCONCATENATE : (seq &rest more-seqs)</code> 
 
[[|]]function <code>CREDUCE : (function sequence &optional (start 0) end (init-value :none))</code> [[|]]

== 14.3 : Modifying Sequences ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node144.html CLtL2 Reference] 
 
[[|]]function <code>FILL : (sequence item &optional (start 0) (end (length sequence)))</code> 
 
[[|]]function <code>REPLACE : (sequence1 sequence2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>REMOVE : (item sequence &optional (test #'eql) (key #'identity) (start 0) end count)</code> 
 
[[|]]function <code>REMOVE-IF : (test sequence &optional (key #'identity) (start 0) end count)</code> 
 
[[|]]function <code>DELETE : (item sequence &optional (test #'eql) (key #'identity) (start 0) end count)</code> 
 
[[|]]function <code>DELETE-IF : (test sequence &optional (key #'identity) (start 0) end count)</code> 
 
[[|]]function <code>REMOVE-DUPLICATES : (sequence &optional (test #'eql) (key #'identity) (start 0) end)</code> 
 
[[|]]function <code>DELETE-DUPLICATES : (sequence &optional (test #'eql) (key #'identity) (start 0) end)</code> 
 
[[|]]function <code>SUBSTITUTE : (new old sequence &optional (test #'eql) (key #'identity) (start 0) end count)</code> 
 
[[|]]function <code>SUBSTITUTE-IF : (new test sequence &optional (key #'identity) (start 0) end count)</code> 
 
[[|]]function <code>NSUBSTITUTE : (new old sequence &optional (test #'eql) (key #'identity) (start 0) end count)</code> 
 
[[|]]function <code>NSUBSTITUTE-IF : (new test sequence &optional (key #'identity) (start 0) end count)</code> [[|]]

== 14.4 : Searching Sequences for Terms ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node145.html CLtL2 Reference] 
 
[[|]]function <code>FIND : (item seq &optional (test #'eql) (key #'identity) (start 0) end)</code> 
 
[[|]]function <code>FIND-IF : (test seq &optional (key #'identity) (start 0) end)</code> 
 
[[|]]function <code>POSITION : (item seq &optional (test #'eql) (key #'identity) (start 0) end)</code> 
 
[[|]]function <code>POSITION-IF : (test seq &optional (key #'identity) (start 0) end)</code> 
 
[[|]]function <code>COUNT : (item seq &optional (test #'eql) (key #'identity) (start 0) end)</code> 
 
[[|]]function <code>COUNT-IF : (test seq &optional (key #'identity) (start 0) end)</code> 
 
[[|]]function <code>MISMATCH : (seq1 seq2 &optional (test #'eql) (key #'identity) (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>SEARCH : (seq1 seq2 &optional (test #'eql) (key #'identity) (start1 0) end1 (start2 0) end2)</code> [[|]]

== 14.5 : Sorting and Merging ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node146.html CLtL2 Reference] 
 
[[|]]function <code>SORT : (seq predicate &optional (key #'identity))</code> 
 
[[|]]function <code>STABLE-SORT : (seq predicate &optional (key #'identity))</code> 
 
[[|]]function <code>CMERGE : (seq1 seq2 predicate &optional (key #'identity))</code> [[|]]

-----

= 15 : Lists =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node147.html CLtL2 Reference] 
 
[[|]]function <code>LISTP : (x)</code> 
 
[[|]]function <code>CONSP : (x)</code> 
 
[[|]]function <code>ATOM : (x)</code> [[|]]

== 15.1 : Conses ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node148.html CLtL2 Reference] 
 
[[|]]function <code>CAR : (cons)</code> 
 
[[|]]function <code>CDR : (cons)</code> 
 
[[|]]function <code>CAAR : (cons)</code> 
 
[[|]]function <code>CADR : (cons)</code> 
 
[[|]]function <code>CDAR : (cons)</code> 
 
[[|]]function <code>CDDR : (cons)</code> 
 
[[|]]function <code>CONS : (car cdr)</code> 
 
[[|]]function <code>TREE-EQUAL : (tree1 tree2 &optional (test #'eql))</code> [[|]]

== 15.2 : Lists ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node149.html CLtL2 Reference] 
 
[[|]]function <code>ENDP : (object)</code> 
 
[[|]]function <code>LIST-LENGTH : (list)</code> 
 
[[|]]function <code>NTH : (n list)</code> 
 
[[|]]function <code>FIRST : (list)</code> 
 
[[|]]function <code>SECOND : (list)</code> 
 
[[|]]function <code>THIRD : (list)</code> 
 
[[|]]function <code>FOURTH : (list)</code> 
 
[[|]]function <code>FIFTH : (list)</code> 
 
[[|]]function <code>SIXTH : (list)</code> 
 
[[|]]function <code>SEVENTH : (list)</code> 
 
[[|]]function <code>EIGHTH : (list)</code> 
 
[[|]]function <code>NINTH : (list)</code> 
 
[[|]]function <code>TENTH : (list)</code> 
 
[[|]]function <code>REST : (list)</code> 
 
[[|]]function <code>NTHCDR : (n list)</code> 
 
[[|]]function <code>LAST : (list &optional (n 1))</code> 
 
[[|]]function <code>LIST : (&rest objects)</code> 
 
[[|]]function <code>LIST* : (arg &rest objects)</code> 
 
[[|]]function <code>MAKE-LIST : (size &optional initial-element)</code> 
 
[[|]]function <code>APPEND : (&rest lists)</code> 
 
[[|]]function <code>COPY-LIST : (list)</code> 
 
[[|]]function <code>COPY-ALIST : (list)</code> 
 
[[|]]function <code>COPY-TREE : (tree)</code> 
 
[[|]]function <code>REVAPPEND : (list1 list2)</code> 
 
[[|]]function <code>NCONC : (&rest lists)</code> 
 
[[|]]function <code>NRECONC : (list1 list2)</code> 
 
[[|]]macro <code>CPUSH : (item place)</code> 
 
[[|]]macro <code>CPUSHNEW : (item place &optional (test '#'eql) (key '#'identity))</code> 
 
[[|]]macro <code>CPOP : (place)</code> 
 
[[|]]function <code>BUTLAST : (list &optional (n 1))</code> 
 
[[|]]function <code>NBUTLAST : (list &optional (n 1))</code> 
 
[[|]]function <code>LDIFF : (list sublist)</code> [[|]]

== 15.3 : Alteration of List Structure ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node150.html CLtL2 Reference] 
 
[[|]]function <code>RPLACA : (cons newcar)</code> 
 
[[|]]function <code>RPLACD : (cons newcdr)</code> 
 
[[|]]function <code>SET-NTH : (n list value)</code> [[|]]

== 15.4 : Substitution of Expressions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node151.html CLtL2 Reference] 
 
[[|]]function <code>SUBST : (new old tree &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>SUBST-IF : (new test tree &optional (key #'identity))</code> 
 
[[|]]function <code>NSUBST : (new old tree &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>NSUBST-IF : (new test tree &optional (key #'identity))</code> 
 
[[|]]function <code>SUBLIS : (alist tree &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>NSUBLIS : (alist tree &optional (test #'eql) (key #'identity))</code> [[|]]

== 15.5 : Using Lists as Sets ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node152.html CLtL2 Reference] 
 
[[|]]function <code>MEMBER : (item list &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>MEMBER-IF : (test list &optional (key #'identity))</code> 
 
[[|]]function <code>TAILP : (sublist list)</code> 
 
[[|]]function <code>ADJOIN : (item list &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>UNION : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>NUNION : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>INTERSECTION : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>NINTERSECTION : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>SET-DIFFERENCE : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>NSET-DIFFERENCE : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>SET-EXCLUSIVE-OR : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>NSET-EXCLUSIVE-OR : (list1 list2 &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>SUBSETP : (list1 list2 &optional (test #'eql) (key #'identity))</code> [[|]]

== 15.6 : Association Lists ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node153.html CLtL2 Reference] 
 
[[|]]function <code>ACONS : (key datum alist)</code> 
 
[[|]]function <code>PAIRLIS : (keys data &optional alist)</code> 
 
[[|]]function <code>ASSOC : (item alist &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>ASSOC-IF : (predicate alist)</code> 
 
[[|]]function <code>RASSOC : (item alist &optional (test #'eql) (key #'identity))</code> 
 
[[|]]function <code>RASSOC-IF : (predicate alist)</code> [[|]]

-----

= 16 : Hash Tables =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node154.html CLtL2 Reference]

[[|]]

== 16.1 : Hash Table Functions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node155.html CLtL2 Reference] 
 
[[|]]function <code>MAKE-HASH-TABLE : (size &optional (test #'eql) (area default-cons-area))</code> 
 
[[|]]function <code>HASH-TABLE-P : (x)</code> 
 
[[|]]function <code>GETHASH : (key table &optional default)</code> 
 
[[|]]function <code>SETHASH : (key table value)</code> 
 
[[|]]function <code>REMHASH : (key table)</code> 
 
[[|]]function <code>MAPHASH : (function table)</code> 
 
[[|]]function <code>CLRHASH : (table)</code> 
 
[[|]]function <code>HASH-TABLE-COUNT : (table)</code> [[|]]

== 16.2 : Primitive Hash Function ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node156.html CLtL2 Reference] 
 
[[|]]function <code>SXHASH : (object)</code> [[|]]

-----

= 17 : Arrays =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node157.html CLtL2 Reference]

SubL only supports one-dimensional arrays, which are called vectors. 
 
[[|]]function <code>VECTORP : (x)</code> [[|]]

== 17.1 : Vector Creation ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node158.html CLtL2 Reference] 
 
[[|]]function <code>MAKE-VECTOR : (size &optional initial-element)</code> 
 
[[|]]function <code>VECTOR : (&rest objects)</code> [[|]]

== 17.2 : Vector Access ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node159.html CLtL2 Reference] 
 
[[|]]function <code>AREF : (vector index)</code> 
 
[[|]]function <code>SET-AREF : (vector index value)</code> [[|]]

-----

= 18 : Strings =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node164.html CLtL2 Reference] 
 
[[|]]function <code>STRINGP : (x)</code> [[|]]

== 18.1 : String Access ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node165.html CLtL2 Reference] 
 
[[|]]function <code>CHAR : (string index)</code> 
 
[[|]]function <code>SET-CHAR : (string index value)</code> [[|]]

== 18.2 : String Comparison ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node166.html CLtL2 Reference] 
 
[[|]]function <code>STRING= : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING-EQUAL : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING< : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING> : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING<= : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING>= : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING/= : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING-LESSP : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING-GREATERP : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING-NOT-GREATERP : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING-NOT-LESSP : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> 
 
[[|]]function <code>STRING-NOT-EQUAL : (string1 string2 &optional (start1 0) end1 (start2 0) end2)</code> [[|]]

== 18.3 : String Construction and Manipulation ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node167.html CLtL2 Reference] 
 
[[|]]function <code>MAKE-STRING : (size &optional (initial-element #\Space))</code> 
 
[[|]]function <code>STRING-TRIM : (char-list string)</code> 
 
[[|]]function <code>STRING-LEFT-TRIM : (char-list string)</code> 
 
[[|]]function <code>STRING-RIGHT-TRIM : (char-list string)</code> 
 
[[|]]function <code>STRING-UPCASE : (string &optional (start 0) end)</code> 
 
[[|]]function <code>STRING-DOWNCASE : (string &optional (start 0) end)</code> 
 
[[|]]function <code>STRING-CAPITALIZE : (string &optional (start 0) end)</code> 
 
[[|]]function <code>NSTRING-UPCASE : (string &optional (start 0) end)</code> 
 
[[|]]function <code>NSTRING-DOWNCASE : (string &optional (start 0) end)</code> 
 
[[|]]function <code>NSTRING-CAPITALIZE : (string &optional (start 0) end)</code> 
 
[[|]]function <code>STRING : (x)</code> [[|]]

-----

= 19 : Structures =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node168.html CLtL2 Reference] 
 
[[|]]macro <code>DEFSTRUCT : ((name &rest options) &body slots)</code> 
Like Common Lisp defstruct except: 
(1) slot initializations are not allowed.

(2) the only other options: 
(:conc-name whatever) 
(:print-function #'whatever)

the default structure print function is 
default-struct-print-function : object stream depth

(3) The make constructor takes no arguments and only makes an empty structure.

(4) Reading of structures is not supported by the reader. 
 
[[|]]function <code>DEFAULT-STRUCT-PRINT-FUNCTION : (object stream depth)</code> 
 
[[|]]macro <code>PRINTING-OBJECT : ((object stream) &body body)</code> [[|]]

-----

= 20 : The Evaluator =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node179.html CLtL2 Reference]

[[|]]

== 20.1 : Run-Time Evaluation of Forms ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node180.html CLtL2 Reference] 
 
[[|]]function <code>EVAL : (form)</code> 
 
[[|]]function <code>CONSTANTP : (object &optional env)</code>

The Common Lisp functions <code>evalhook</code> and <code>applyhook</code> are not supported in SubL. [[|]]

== 20.2 : The Top-Level Loop ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node181.html CLtL2 Reference] 
 
[[|]]variable <code>*</code> 
 
[[|]]variable <code>**</code> 
 
[[|]]variable <code>***</code>

For convenience, the top-level readloop binds the following variables after each form is evaluated:

<blockquote><pre>* the last value returned
** the previous value of *
*** the previous value of **</pre></blockquote>
[[|]]

-----

= 21 : Streams =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node182.html CLtL2 Reference] 
 
[[|]]function <code>STREAMP : (x)</code> [[|]]

== 21.1 : Standard Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node183.html CLtL2 Reference] 
 
[[|]]variable <code>*STANDARD-INPUT*</code> 
 
[[|]]variable <code>*STANDARD-OUTPUT*</code> 
 
[[|]]variable <code>*ERROR-OUTPUT*</code> 
 
[[|]]variable <code>*NULL-OUTPUT*</code> 
A bit-sink output stream. All output is ignored

The other standard streams supported by Common Lisp are not supported by SubL. [[|]]

== 21.2 : Creating new Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node184.html CLtL2 Reference] 
 
[[|]]function <code>OPEN-TCP-STREAM : (host port)</code> [[|]]

== 21.3 : Operations on Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node185.html CLtL2 Reference] 
 
[[|]]function <code>STREAMP : (x)</code> 
 
[[|]]function <code>INPUT-STREAM-P : (object)</code> 
 
[[|]]function <code>OUTPUT-STREAM-P : (object)</code> 
 
[[|]]function <code>CLOSE : (stream)</code> [[|]]

-----

= 22 : Input/Output =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node186.html CLtL2 Reference] [[|]]

== 22.1 : Printed Representation of SubL Objects ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node187.html CLtL2 Reference] [[|]]

== 22.1.3 : Macro Characters ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node190.html CLtL2 Reference]

The SubL reader supports the following macro characters, whose meaning is identical to their meaning in Common Lisp :

<blockquote>'''Macro Character'''
Â Â Â
'''Reader Action'''

-----

<code> (</code>
Begin reading a list.
<code> )</code>
End reading a list or a vector.
<code> '</code>
Read in a quoted expression.
<code> ;</code>
Read a comment until end-of-line.
<code> "</code>
Begin or end reading a string.
<code> `</code>
Read in a backquoted expression.</blockquote>
In addition, the following comma-readers are supported inside of backquote :

<blockquote><pre>,
,@
,.</pre></blockquote>
Their behavior is identical to their Common Lisp counterparts. [[|]]

== 22.1.4 : Standard Dispatching Macro Character Syntax ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node191.html CLtL2 Reference]

'''<code>'#'</code>''' is the SubL standard dispatching macro character. The SubL reader supports the following dispatch macro character sequences, whose meanings are identical to their meanings in Common Lisp :

<blockquote>'''Dispatch Sequence'''
Â Â Â
'''Reader Action'''

-----

<code> #\(</code>
Read a character constant.
<code> #'</code>
Read a function constant.
<code> #(</code>
Begin reading a vector.
<code> #|</code>
Begin reading a comment section.
<code> |#</code>
End reading a comment section.</blockquote>
Additionally, SubL supports the dispatch sequence '''<code>#$</code>''' as follows :

<blockquote><code>#$foo</code> reads the Cyc constant whose name is <code>"foo"</code></blockquote>
[[|]]

== 22.1.5 : The Readtable ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node192.html CLtL2 Reference]

SubL internally uses a readtable, but it is not visible to the programmer. [[|]]

== 22.1.6 : What the Print Function Produces ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node193.html CLtL2 Reference] 
 
[[|]]variable <code>*PRINT-ESCAPE*</code> [[|]]

== 22.2.1 : Input from Character Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node195.html CLtL2 Reference] 
 
[[|]]function <code>READ : (&optional (stream *standard-input*) (eof-error-p t) (eof-value :eof))</code> 
Returns FORM if read was successful. 
Returns the values NIL :ERROR if there was a reader error. 
Returns the values EOF-VALUE :ERROR if EOF-ERROR-P is nil and EOF occurs. 
Causes an error if EOF-ERROR-P is not nil and EOF occurs.

Differences from Common Lisp: 
<code> </code>Numbers are only read in decimal notation with no specified radix. 
<code> </code>No character modifiers: only standard chars plus specials like Space, Return etc. 
<code> </code>The || notation and \ syntax for symbols are not supported. 
 
[[|]]function <code>READ-LINE : (&optional (stream *standard-input*) (eof-error-p t) (eof-value :eof))</code> 
 
[[|]]function <code>READ-CHAR : (&optional (stream *standard-input*) (eof-error-p t) (eof-value :eof))</code> 
 
[[|]]function <code>UNREAD-CHAR : (char &optional (stream *standard-input*))</code> 
 
[[|]]function <code>READ-FROM-STRING : (string &optional (eof-error-p t) (eof-value :eof) (start 0) end)</code> 
Returns the values FORM NEW-START if read was successful. 
Returns the values NIL :ERROR if there was a reader error. 
Returns the values EOF-VALUE :ERROR if EOF-ERROR-P is nil and EOF occurs. 
Causes an error if EOF-ERROR-P is not nil and EOF occurs. 
Returns a second value which is an integer indicating the position in the string to 
start reading from again or :ERROR if there was some kind of reader error. [[|]]

== 22.2.2 : Input from Binary Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node196.html CLtL2 Reference] 
 
[[|]]function <code>READ-BYTE : (stream &optional (eof-error-p t) (eof-value :eof))</code> [[|]]

== 22.3.1 : Output to Character Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node198.html CLtL2 Reference] 
 
[[|]]function <code>WRITE : (object &optional (stream *standard-output*) (escape *print-escape*))</code> 
 
[[|]]function <code>PRIN1 : (object &optional (stream *standard-output*))</code> 
 
[[|]]function <code>PRINT : (object &optional (stream *standard-output*))</code> 
 
[[|]]function <code>PRINC : (object &optional (stream *standard-output*))</code> 
 
[[|]]function <code>WRITE-TO-STRING : (object &optional (escape *print-escape*))</code> 
 
[[|]]function <code>PRIN1-TO-STRING : (object)</code> 
 
[[|]]function <code>PRINC-TO-STRING : (object)</code> 
 
[[|]]function <code>WRITE-CHAR : (char &optional (stream *standard-output*))</code> 
 
[[|]]function <code>WRITE-STRING : (string &optional (stream *standard-output*) (start 0) end)</code> 
 
[[|]]function <code>WRITE-LINE : (string &optional (stream *standard-output*) (start 0) end)</code> 
 
[[|]]function <code>TERPRI : (&optional (stream *standard-output*))</code> 
 
[[|]]function <code>FORCE-OUTPUT : (&optional (stream *standard-output*))</code> [[|]]

== 22.3.2 : Output to Binary Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node199.html CLtL2 Reference] 
 
[[|]]function <code>WRITE-BYTE : (integer stream)</code> [[|]]

== 22.3.3 : Formatted Output to Character Streams ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node200.html CLtL2 Reference] 
 
[[|]]function <code>FORMAT : (destination control-string &rest arguments)</code> 
Format ARGUMENTS to the text stream DESTINATION according to the specifications in CONTROL-STRING. SubL format is more limited than the Common Lisp version: the only escapes allowed in the control string are: ~A ~a ~S ~s ~D ~d (with width and pad parameters optional) ~C ~c ~G ~g ~% ~~ [[|]]

-----

= 23 : File System Interface =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node202.html CLtL2 Reference] [[|]]

== 23.1 : File Names ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node203.html CLtL2 Reference] 
 
[[|]]variable <code>*DEFAULT-PATHNAME-DEFAULTS*</code> 
 
[[|]]function <code>CONSTRUCT-FILENAME : (directory-list filename &optional extension relative?)</code>

Pathnames are just strings in SubL. Common Lisp pathname objects are not supported. [[|]]

== 23.2 : Opening and Closing Files ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node215.html CLtL2 Reference] 
 
[[|]]function <code>OPEN-TEXT : (filename direction)</code> 
Attempts to open the file FILENAME. If successful, returns an 8-bit character text stream. If DIRECTION is :input, then input operations can be performed on the stream. If DIRECTION is output, then output is directed to the file FILENAME, overwriting any existing file. If DIRECTION is :append, then output is appended to the file. For either output case, a new file is created if no file named FILENAME already exists. 
 
[[|]]function <code>OPEN-BINARY : (filename direction)</code> 
Attempts to open the file FILENAME. If successful, returns an 8-bit binary byte stream. If DIRECTION is :input, then input operations can be performed on the stream. If DIRECTION is output, then output is directed to the file FILENAME, overwriting any existing file. If DIRECTION is :append, then output is appended to the file. For either output case, a new file is created if no file named FILENAME already exists. 
 
[[|]]macro <code>WITH-TEXT-FILE : ((stream filestring direction) &body body)</code> 
In the scope of a WITH-TEXT-FILE expression, the file FILESTRING is opened for character i/o and a stream to this file is created and bound to the variable STREAM. If DIRECTION is :input, then input operations can be performed on STREAM. If DIRECTION is :output, then output operations can be performed, overwriting any existing file. If DIRECTION is :append, then output is appended to an existing file. 
 
[[|]]macro <code>WITH-BINARY-FILE : ((stream filestring direction) &body body)</code> 
In the scope of a WITH-BINARY-FILE expression, the file FILESTRING is opened for binary i/o and a stream to this file is created and bound to the variable STREAM. If DIRECTION is :input, then input operations can be performed on STREAM. If DIRECTION is :output, then output operations can be performed, overwriting any existing file. If DIRECTION is :append, then output is appended to an existing file. [[|]]

== 23.3 : Renaming, Deleting and Other File Operations ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node216.html CLtL2 Reference] 
 
[[|]]function <code>RENAME-FILE : (filename new-name)</code> 
 
[[|]]function <code>DELETE-FILE : (filename)</code> 
 
[[|]]function <code>PROBE-FILE : (filename)</code> 
 
[[|]]function <code>APPEND-FILES : (filename-1 filename-2 &optional (mode :text))</code> 
Append filename-1 to filename-2 
 
[[|]]function <code>FILE-WRITE-DATE : (filename)</code> 
 
[[|]]function <code>FILE-AUTHOR : (filename)</code> 
 
[[|]]function <code>GET-FILE-POSITION : (stream)</code> 
 
[[|]]function <code>SET-FILE-POSITION : (stream n)</code> 
 
[[|]]function <code>FILE-LENGTH : (stream)</code> [[|]]

== 23.4 : Loading Files ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node217.html CLtL2 Reference] 
 
[[|]]function <code>LOAD : (filename)</code> [[|]]

== 23.5 : Accessing Directories ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node218.html CLtL2 Reference] 
 
[[|]]function <code>DIRECTORY : (directory-name &optional include-directory)</code> [[|]]

-----

= 24 : Errors =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node219.html CLtL2 Reference] [[|]]

== 24.1 : General Error-Signalling Functions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node220.html CLtL2 Reference] 
 
[[|]]variable <code>*ERROR-ABORT-HANDLER*</code> 
If *error-abort-handler* is non-nil, then an ABORT option is available inside ERROR and CERROR. 
If chosen, then the handler is funcalled on no arguments. 
 
[[|]]variable <code>*ERROR-HANDLER*</code> 
If *ERROR-SIGNAL* is non-nil, then that function is called upon an error. Otherwise, the debugger is invoked. 
 
[[|]]variable <code>*ERROR-MESSAGE*</code> 
 
[[|]]function <code>ERROR : (format-string &rest arguments)</code> 
 
[[|]]variable <code>*CONTINUE-CERROR?*</code> 
 
[[|]]function <code>CERROR : (continue-string format-string &rest arguments)</code> 
 
[[|]]variable <code>*IGNORE-WARNS?*</code> 
If T, all warnings forms are ignored 
 
[[|]]function <code>WARN : (format-string &rest arguments)</code> 
 
[[|]]variable <code>*IGNORE-BREAKS?*</code> 
If non-NIL, all break forms are ignored 
 
[[|]]function <code>BREAK : (format-string &rest arguments)</code> [[|]]

== 24.2 : Specialized Error-Signalling Forms and Macros ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node221.html CLtL2 Reference] 
 
[[|]]variable <code>*IGNORE-MUSTS?*</code> 
If non-NIL, all must forms are ignored 
 
[[|]]macro <code>MUST : (form format-string &rest arguments)</code> 
 
[[|]]variable <code>*SUSPEND-TYPE-CHECKING?*</code> 
CHECK-TYPE tests are performed iff this is non-nil 
 
[[|]]macro <code>CHECK-TYPE : (object pred)</code> [[|]]

-----

= 25 : Miscellaneous Features =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node223.html CLtL2 Reference] [[|]]

== 25.1 : The Compiler ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node224.html CLtL2 Reference]

SubL currently does not provide any compilation support. [[|]]

== 25.3 : Debugging Tools ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node230.html CLtL2 Reference] 
 
[[|]]macro <code>CTIME : (var &body body)</code> 
 
[[|]]function <code>DEBUG : ()</code> 
Pauses execution and invokes the debugger. [[|]]

== 25.4.1 : Time Functions ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node232.html CLtL2 Reference] 
 
[[|]]variable <code>*EPOCH*</code> 
*epoch* is the current epoch in use, which is a universal time. 
The system needs to at least be able to handle epochs back to midnight Jan 1 1970. 
*epoch* is globally initialized to midnight Jan 1 1970. 
All universal times are relative to *epoch*. 
 
[[|]]function <code>GET-UNIVERSAL-TIME : ()</code> 
 
[[|]]function <code>DECODE-UNIVERSAL-TIME : (universal-time)</code> 
 
[[|]]function <code>ENCODE-UNIVERSAL-TIME : (second minute hour date month year)</code> 
 
[[|]]function <code>TIME-FROM-NOW : (delta)</code> 
 
[[|]]function <code>TIME-HAS-ARRIVED? : (time)</code> 
 
[[|]]function <code>ENCODE-TIMESTRING : (second minute hour date month year)</code> 
 
[[|]]function <code>TIMESTRING : (&optional (universal-time (get-universal-time)))</code> 
timestring returns a string in the format dd/mm/yy hh:mm:ss from the 
universal time given. If none is given, the current time is used. 
 
[[|]]variable <code>*CLOCK-GRANULARITY*</code> 
*clock-granularity* is the number of internal clock units per second. 
time evals form and returns the number of internal clock units it took 
to execute. 
 
[[|]]function <code>GET-INTERNAL-REAL-TIME : ()</code> 
 
[[|]]function <code>SLEEP : (seconds)</code> [[|]]

== 25.5 : Identity Function ==

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node234.html CLtL2 Reference] 
 
[[|]]function <code>IDENTITY : (object)</code> [[|]]

-----

= 28 : Common Lisp Object System =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/node260.html CLtL2 Reference] 
 
[[|]]macro <code>DEFPOLYMORPHIC : (name lambda-list &body body)</code> 
Defines a new polymorphic function that dispatches on the type of its first argument. <body> defines a default method. The function define-method can be used to define additional methods. For example:

(defpolymorphic test (a b) 
<code> </code>(list a b))

(define-method test ((a cons) b) 
<code> </code>(cons b a))

(define-method test ((a fixnum) b) 
<code> </code>(+ a b))

The defpolymorphic form defines the function TEST with a default method. 
<code> </code>The two define-method forms specialize the behavior of TEST for lists and fixnums.

(test 'foo 'bar) => (FOO BAR) 
<code> </code>(test '(foo) 'bar) => (BAR FOO) 
<code> </code>(test 2 3) => 5 
 
[[|]]macro <code>DEFINE-METHOD : (name lambda-list &body body)</code> 
Defines a method for the polymorphic function <name> that runs if 
<dispatch-arg> is of type <type>. The lambda list must have the same 
structure as in the DEFPOLYMORPHIC call. [[|]]

-----

= SubL-Specific Features =

[[|]] '''SubL.1 : Signals''' 
 
[[|]]variable <code>*SIGNAL-MAX*</code> 
There are *signal-max* total signals available. 
 
[[|]]function <code>DEFAULT-SIGNAL-HANDLER : (signal)</code> 
 
[[|]]function <code>INSTALL-SIGNAL-HANDLER : (signal function)</code> 

[[|]] '''SubL.2 : System Properties''' 
 
[[|]]function <code>GET-PROCESS-ID : (&optional default)</code> 
Return the current heavyweight process id of this current SubL 
program. Return DEFAULT if this cannot be determined. 
 
[[|]]function <code>GET-MACHINE-NAME : (&optional default)</code> 
 
[[|]]function <code>GET-NETWORK-NAME : (&optional default)</code> 
 
[[|]]function <code>GET-USER-NAME : (&optional default)</code> 

[[|]] '''SubL.3 : Progress Pacifiers''' 
 
[[|]]variable <code>*SILENT-PROGRESS?*</code> 
 
[[|]]macro <code>NOTING-ACTIVITY : (string &body body)</code> 
 
[[|]]function <code>NOTE-ACTIVITY : ()</code> 
 
[[|]]macro <code>NOTING-NUMERIC-PROGRESS : (string &body body)</code> 
 
[[|]]function <code>NOTE-NUMERIC-PROGRESS : (num)</code> 
 
[[|]]macro <code>NOTING-PERCENT-PROGRESS : (string &body body)</code> 
 
[[|]]function <code>NOTE-PERCENT-PROGRESS : (index max)</code> 

[[|]] '''SubL.4 : Process Manipulation''' 
 
[[|]]function <code>FORK-PROCESS : (function &optional callback output-file)</code> 
Spawn a heavyweight child process to call FUNCTION, which takes no arguments. 
FUNCTION must return an integer. 
CALLBACK, if provided, must be a function of one argument which is called 
on the returned value within the address space of the parent process. 
OUTPUT-FILE, if provided, is a file to which standard output and error are piped 
while executing FUNCTION. 
 
[[|]]function <code>RESTART-PROCESS : (&optional world-spec init-file-pathname init-form-spec)</code> 
Restart the current heavyweight process. 
WORLD-SPEC, if provided, is the filename of a world to use. 
INIT-FILE-PATHNAME, if provided, is a file of initializatio forms to eval. 
INIT-FORM-SPEC, if provided, is a form to execute. 
The values used for these when the current process was started are used if unprovided. 

[[|]] '''SubL.5 : Memory Interaction''' 
 
[[|]]function <code>GC : (&optional level)</code> 
 
[[|]]macro <code>WITH-STATIC-AREA : (&body body)</code> 
 
[[|]]function <code>WRITE-IMAGE : (filename &optional do-full-gc)</code> 
Save the current state of virtual memory in a file called FILENAME. 
If DO-FULL-GC is true, then a full garbage collection is 
performed before writing the image. Otherwise, a dynamic 
garbage collection is performed and remaining objects are 
promoted to being static ones.

During the initialization of a SubL system at startup, variables defined via [[#FN-DEF-DEFVAR|<code>DEFVAR</code>]] have their initial values set via their state in the world file used at startup, ignoring the initial value specified by the code. [[#FN-DEF-DEFPARAMETER|<code>DEFPARAMETER</code>]] variables and [[#FN-DEF-DEFCONSTANT|<code>DEFCONSTANT</code>]] global constants have their values initialized via the code on startup.

The net result of this distinction is as follows: if a world is saved out via WRITE-IMAGE, and then used to restart a SubL system, the values of [[#FN-DEF-DEFVAR|<code>DEFVAR</code>]] variables will persist, while any changes to [[#FN-DEF-DEFPARAMETER|<code>DEFPARAMETER</code>]] variables will be lost when they are reset to their original code-specified initial values on startup. [[|]]

-----

= Index =

[http://web.archive.org/web/20060325065433/http://www.supelec.fr/docs/cltl/clm/index.html CLtL2 Reference]

'''[[#Index-A|A]] | [[#Index-B|B]] | [[#Index-C|C]] | [[#Index-D|D]] | [[#Index-E|E]] | [[#Index-F|F]] | [[#Index-G|G]] | [[#Index-H|H]] | [[#Index-I|I]] | [[#Index-J|J]] | [[#Index-K|K]] | [[#Index-L|L]] | [[#Index-M|M]] | [[#Index-N|N]] | [[#Index-O|O]] | [[#Index-P|P]] | [[#Index-Q|Q]] | [[#Index-R|R]] | [[#Index-S|S]] | [[#Index-T|T]] | [[#Index-U|U]] | [[#Index-V|V]] | [[#Index-W|W]] | [[#Index-X|X]] | [[#Index-Y|Y]] | [[#Index-Z|Z]]'''

 
[[#FN-DEF-1280|<code>*</code>]] function 
[[#SYM-DEF-1280|<code>*</code>]] variable 
[[#SYM-DEF-165120|<code>**</code>]] variable 
[[#SYM-DEF-21136640|<code>***</code>]] variable 
[[#SYM-DEF-1161467279|<code>*CLOCK-GRANULARITY*</code>]] variable 
[[#SYM-DEF-1424597890|<code>*CONTINUE-CERROR?*</code>]] variable 
[[#SYM-DEF-609384130|<code>*DEFAULT-PATHNAME-DEFAULTS*</code>]] variable 
[[#SYM-DEF-2020021124|<code>*EPOCH*</code>]] variable 
[[#SYM-DEF-860597104|<code>*ERROR-ABORT-HANDLER*</code>]] variable 
[[#SYM-DEF-354311860|<code>*ERROR-HANDLER*</code>]] variable 
[[#SYM-DEF-1079241228|<code>*ERROR-MESSAGE*</code>]] variable 
[[#SYM-DEF-704643174|<code>*ERROR-OUTPUT*</code>]] variable 
[[#SYM-DEF-204607828|<code>*IGNORE-BREAKS?*</code>]] variable 
[[#SYM-DEF-2065003033|<code>*IGNORE-MUSTS?*</code>]] variable 
[[#SYM-DEF-1528898064|<code>*IGNORE-WARNS?*</code>]] variable 
[[#SYM-DEF-1188374285|<code>*MOST-NEGATIVE-FIXNUM*</code>]] variable 
[[#SYM-DEF-113980253|<code>*MOST-POSITIVE-FIXNUM*</code>]] variable 
[[#SYM-DEF-1624760991|<code>*MULTIPLE-VALUES-LIMIT*</code>]] variable 
[[#SYM-DEF-1405149315|<code>*NULL-OUTPUT*</code>]] variable 
[[#SYM-DEF-313735324|<code>*PRINT-ESCAPE*</code>]] variable 
[[#SYM-DEF-430643141|<code>*RAND-MAX*</code>]] variable 
[[#SYM-DEF-371148559|<code>*SIGNAL-MAX*</code>]] variable 
[[#SYM-DEF-694198800|<code>*SILENT-PROGRESS?*</code>]] variable 
[[#SYM-DEF-1112282190|<code>*STANDARD-INPUT*</code>]] variable 
[[#SYM-DEF-1982975489|<code>*STANDARD-OUTPUT*</code>]] variable 
[[#SYM-DEF-1570894042|<code>*SUSPEND-TYPE-CHECKING?*</code>]] variable 
[[#FN-DEF-+|<code>+</code>]] function 
[[#FN-DEF--|<code>-</code>]] function 
[[#FN-DEF-/|<code>/</code>]] function 
[[#FN-DEF-/=|<code>/=</code>]] function 
[[#FN-DEF-3584|<code><</code>]] function 
[[#FN-DEF-462464|<code><=</code>]] function 
[[#FN-DEF-=|<code>=</code>]] function 
[[#FN-DEF-3840|<code>></code>]] function 
[[#FN-DEF-495232|<code>>=</code>]] function [[|]]

==== A ====

 
[[#FN-DEF-ACONS|<code>ACONS</code>]] function 
[[#FN-DEF-ADJOIN|<code>ADJOIN</code>]] function 
[[#FN-DEF-ALERT-USER|<code>ALERT-USER</code>]] function 
[[#FN-DEF-ALPHA-CHAR-P|<code>ALPHA-CHAR-P</code>]] function 
[[#FN-DEF-ALPHANUMERICP|<code>ALPHANUMERICP</code>]] function 
[[#FN-DEF-APPEND|<code>APPEND</code>]] function 
[[#FN-DEF-APPEND-FILES|<code>APPEND-FILES</code>]] function 
[[#FN-DEF-APPLY|<code>APPLY</code>]] function 
[[#FN-DEF-AREF|<code>AREF</code>]] function 
[[#FN-DEF-ASSOC|<code>ASSOC</code>]] function 
[[#FN-DEF-ASSOC-IF|<code>ASSOC-IF</code>]] function 
[[#FN-DEF-ATOM|<code>ATOM</code>]] function [[|]]

==== B ====

 
[[#FN-DEF-BOTH-CASE-P|<code>BOTH-CASE-P</code>]] function 
[[#FN-DEF-BOUNDP|<code>BOUNDP</code>]] function 
[[#FN-DEF-BREAK|<code>BREAK</code>]] function 
[[#FN-DEF-BUTLAST|<code>BUTLAST</code>]] function 
[[#FN-DEF-BYTE|<code>BYTE</code>]] macro [[|]]

==== C ====

 
[[#FN-DEF-CAAR|<code>CAAR</code>]] function 
[[#FN-DEF-CADR|<code>CADR</code>]] function 
[[#FN-DEF-CAND|<code>CAND</code>]] macro 
[[#FN-DEF-CAR|<code>CAR</code>]] function 
[[#FN-DEF-CCATCH|<code>CCATCH</code>]] macro 
[[#FN-DEF-CCONCATENATE|<code>CCONCATENATE</code>]] function 
[[#FN-DEF-CDAR|<code>CDAR</code>]] function 
[[#FN-DEF-CDDR|<code>CDDR</code>]] function 
[[#FN-DEF-CDEC|<code>CDEC</code>]] macro 
[[#FN-DEF-CDESTRUCTURING-BIND|<code>CDESTRUCTURING-BIND</code>]] macro 
[[#FN-DEF-CDO|<code>CDO</code>]] macro 
[[#FN-DEF-CDOHASH|<code>CDOHASH</code>]] macro 
[[#FN-DEF-CDOLIST|<code>CDOLIST</code>]] macro 
[[#FN-DEF-CDOTIMES|<code>CDOTIMES</code>]] macro 
[[#FN-DEF-CDR|<code>CDR</code>]] function 
[[#FN-DEF-CEILING|<code>CEILING</code>]] function 
[[#FN-DEF-CERROR|<code>CERROR</code>]] function 
[[#FN-DEF-CHAR|<code>CHAR</code>]] function 
[[#FN-DEF-CHAR-CODE|<code>CHAR-CODE</code>]] function 
[[#FN-DEF-CHAR-DOWNCASE|<code>CHAR-DOWNCASE</code>]] function 
[[#FN-DEF-CHAR-EQUAL|<code>CHAR-EQUAL</code>]] function 
[[#FN-DEF-CHAR-GREATERP|<code>CHAR-GREATERP</code>]] function 
[[#FN-DEF-CHAR-LESSP|<code>CHAR-LESSP</code>]] function 
[[#FN-DEF-CHAR-NOT-EQUAL|<code>CHAR-NOT-EQUAL</code>]] function 
[[#FN-DEF-CHAR-NOT-GREATERP|<code>CHAR-NOT-GREATERP</code>]] function 
[[#FN-DEF-CHAR-NOT-LESSP|<code>CHAR-NOT-LESSP</code>]] function 
[[#FN-DEF-CHAR-UPCASE|<code>CHAR-UPCASE</code>]] function 
[[#FN-DEF-CHAR/=|<code>CHAR/=</code>]] function 
[[#FN-DEF-137661468|<code>CHAR<</code>]] function 
[[#FN-DEF-440795332|<code>CHAR<=</code>]] function 
[[#FN-DEF-CHAR=|<code>CHAR=</code>]] function 
[[#FN-DEF-137661724|<code>CHAR></code>]] function 
[[#FN-DEF-440828100|<code>CHAR>=</code>]] function 
[[#FN-DEF-CHARACTERP|<code>CHARACTERP</code>]] function 
[[#FN-DEF-CHECK-TYPE|<code>CHECK-TYPE</code>]] macro 
[[#FN-DEF-CINC|<code>CINC</code>]] macro 
[[#FN-DEF-CLET|<code>CLET</code>]] macro 
[[#FN-DEF-CLOSE|<code>CLOSE</code>]] function 
[[#FN-DEF-CLRHASH|<code>CLRHASH</code>]] function 
[[#FN-DEF-CMERGE|<code>CMERGE</code>]] function 
[[#FN-DEF-CMULTIPLE-VALUE-BIND|<code>CMULTIPLE-VALUE-BIND</code>]] macro 
[[#FN-DEF-CNOT|<code>CNOT</code>]] macro 
[[#FN-DEF-CODE-CHAR|<code>CODE-CHAR</code>]] function 
[[#FN-DEF-CONS|<code>CONS</code>]] function 
[[#FN-DEF-CONSP|<code>CONSP</code>]] function 
[[#FN-DEF-CONSTANTP|<code>CONSTANTP</code>]] function 
[[#FN-DEF-CONSTRUCT-FILENAME|<code>CONSTRUCT-FILENAME</code>]] function 
[[#FN-DEF-COPY-ALIST|<code>COPY-ALIST</code>]] function 
[[#FN-DEF-COPY-LIST|<code>COPY-LIST</code>]] function 
[[#FN-DEF-COPY-SEQ|<code>COPY-SEQ</code>]] function 
[[#FN-DEF-COPY-TREE|<code>COPY-TREE</code>]] function 
[[#FN-DEF-COR|<code>COR</code>]] macro 
[[#FN-DEF-COUNT|<code>COUNT</code>]] function 
[[#FN-DEF-COUNT-IF|<code>COUNT-IF</code>]] function 
[[#FN-DEF-CPOP|<code>CPOP</code>]] macro 
[[#FN-DEF-CPROGV|<code>CPROGV</code>]] macro 
[[#FN-DEF-CPUSH|<code>CPUSH</code>]] macro 
[[#FN-DEF-CPUSHNEW|<code>CPUSHNEW</code>]] macro 
[[#FN-DEF-CREDUCE|<code>CREDUCE</code>]] function 
[[#FN-DEF-CSETF|<code>CSETF</code>]] macro 
[[#FN-DEF-CSETQ|<code>CSETQ</code>]] macro 
[[#FN-DEF-CSOME|<code>CSOME</code>]] macro 
[[#FN-DEF-CTIME|<code>CTIME</code>]] macro 
[[#FN-DEF-CUNWIND-PROTECT|<code>CUNWIND-PROTECT</code>]] macro [[|]]

==== D ====

 
[[#FN-DEF-DEBUG|<code>DEBUG</code>]] function 
[[#FN-DEF-DECLAIM|<code>DECLAIM</code>]] macro 
[[#FN-DEF-DECLARE|<code>DECLARE</code>]] function 
[[#FN-DEF-DECODE-UNIVERSAL-TIME|<code>DECODE-UNIVERSAL-TIME</code>]] function 
[[#FN-DEF-DEFAULT-SIGNAL-HANDLER|<code>DEFAULT-SIGNAL-HANDLER</code>]] function 
[[#FN-DEF-DEFAULT-STRUCT-PRINT-FUNCTION|<code>DEFAULT-STRUCT-PRINT-FUNCTION</code>]] function 
[[#FN-DEF-DEFCONSTANT|<code>DEFCONSTANT</code>]] macro 
[[#FN-DEF-DEFINE|<code>DEFINE</code>]] macro 
[[#FN-DEF-DEFINE-METHOD|<code>DEFINE-METHOD</code>]] macro 
[[#FN-DEF-DEFMACRO|<code>DEFMACRO</code>]] macro 
[[#FN-DEF-DEFPARAMETER|<code>DEFPARAMETER</code>]] macro 
[[#FN-DEF-DEFPOLYMORPHIC|<code>DEFPOLYMORPHIC</code>]] macro 
[[#FN-DEF-DEFSTRUCT|<code>DEFSTRUCT</code>]] macro 
[[#FN-DEF-DEFVAR|<code>DEFVAR</code>]] macro 
[[#FN-DEF-DELETE|<code>DELETE</code>]] function 
[[#FN-DEF-DELETE-DUPLICATES|<code>DELETE-DUPLICATES</code>]] function 
[[#FN-DEF-DELETE-FILE|<code>DELETE-FILE</code>]] function 
[[#FN-DEF-DELETE-IF|<code>DELETE-IF</code>]] function 
[[#FN-DEF-DIGIT-CHAR-P|<code>DIGIT-CHAR-P</code>]] function 
[[#FN-DEF-DIRECTORY|<code>DIRECTORY</code>]] function 
[[#FN-DEF-DPB|<code>DPB</code>]] function [[|]]

==== E ====

 
[[#FN-DEF-EIGHTH|<code>EIGHTH</code>]] function 
[[#FN-DEF-ELT|<code>ELT</code>]] function 
[[#FN-DEF-ENCODE-TIMESTRING|<code>ENCODE-TIMESTRING</code>]] function 
[[#FN-DEF-ENCODE-UNIVERSAL-TIME|<code>ENCODE-UNIVERSAL-TIME</code>]] function 
[[#FN-DEF-ENDP|<code>ENDP</code>]] function 
[[#FN-DEF-EQ|<code>EQ</code>]] function 
[[#FN-DEF-EQL|<code>EQL</code>]] function 
[[#FN-DEF-EQUAL|<code>EQUAL</code>]] function 
[[#FN-DEF-EQUALP|<code>EQUALP</code>]] function 
[[#FN-DEF-ERROR|<code>ERROR</code>]] function 
[[#FN-DEF-EVAL|<code>EVAL</code>]] function 
[[#FN-DEF-EVENP|<code>EVENP</code>]] function [[|]]

==== F ====

 
[[#FN-DEF-FBOUNDP|<code>FBOUNDP</code>]] function 
[[#FN-DEF-FIF|<code>FIF</code>]] macro 
[[#FN-DEF-FIFTH|<code>FIFTH</code>]] function 
[[#FN-DEF-FILE-AUTHOR|<code>FILE-AUTHOR</code>]] function 
[[#FN-DEF-FILE-LENGTH|<code>FILE-LENGTH</code>]] function 
[[#FN-DEF-FILE-WRITE-DATE|<code>FILE-WRITE-DATE</code>]] function 
[[#FN-DEF-FILL|<code>FILL</code>]] function 
[[#FN-DEF-FIND|<code>FIND</code>]] function 
[[#FN-DEF-FIND-IF|<code>FIND-IF</code>]] function 
[[#FN-DEF-FIND-SYMBOL|<code>FIND-SYMBOL</code>]] function 
[[#FN-DEF-FIRST|<code>FIRST</code>]] function 
[[#FN-DEF-FIXNUMP|<code>FIXNUMP</code>]] function 
[[#FN-DEF-FLOAT|<code>FLOAT</code>]] function 
[[#FN-DEF-FLOATP|<code>FLOATP</code>]] function 
[[#FN-DEF-FLOOR|<code>FLOOR</code>]] function 
[[#FN-DEF-FMAKUNBOUND|<code>FMAKUNBOUND</code>]] function 
[[#FN-DEF-FORCE-OUTPUT|<code>FORCE-OUTPUT</code>]] function 
[[#FN-DEF-FORK-PROCESS|<code>FORK-PROCESS</code>]] function 
[[#FN-DEF-FORMAT|<code>FORMAT</code>]] function 
[[#FN-DEF-FOURTH|<code>FOURTH</code>]] function 
[[#FN-DEF-FUNCALL|<code>FUNCALL</code>]] function 
[[#FN-DEF-FUNCTION|<code>FUNCTION</code>]] macro 
[[#FN-DEF-FUNCTION-INFORMATION|<code>FUNCTION-INFORMATION</code>]] function 
[[#FN-DEF-FUNCTION-SPEC-P|<code>FUNCTION-SPEC-P</code>]] function 
[[#FN-DEF-FUNCTIONP|<code>FUNCTIONP</code>]] function 
[[#FN-DEF-FUNLESS|<code>FUNLESS</code>]] macro 
[[#FN-DEF-FWHEN|<code>FWHEN</code>]] macro [[|]]

==== G ====

 
[[#FN-DEF-GC|<code>GC</code>]] function 
[[#FN-DEF-GENSYM|<code>GENSYM</code>]] function 
[[#FN-DEF-GENTEMP|<code>GENTEMP</code>]] function 
[[#FN-DEF-GET|<code>GET</code>]] function 
[[#FN-DEF-GET-CONSING-STATE|<code>GET-CONSING-STATE</code>]] function 
[[#FN-DEF-GET-FILE-POSITION|<code>GET-FILE-POSITION</code>]] function 
[[#FN-DEF-GET-INTERNAL-REAL-TIME|<code>GET-INTERNAL-REAL-TIME</code>]] function 
[[#FN-DEF-GET-MACHINE-NAME|<code>GET-MACHINE-NAME</code>]] function 
[[#FN-DEF-GET-NETWORK-NAME|<code>GET-NETWORK-NAME</code>]] function 
[[#FN-DEF-GET-PROCESS-ID|<code>GET-PROCESS-ID</code>]] function 
[[#FN-DEF-GET-STRING-FROM-USER|<code>GET-STRING-FROM-USER</code>]] function 
[[#FN-DEF-GET-UNIVERSAL-TIME|<code>GET-UNIVERSAL-TIME</code>]] function 
[[#FN-DEF-GET-USER-NAME|<code>GET-USER-NAME</code>]] function 
[[#FN-DEF-GETHASH|<code>GETHASH</code>]] function [[|]]

==== H ====

 
[[#FN-DEF-HASH-TABLE-COUNT|<code>HASH-TABLE-COUNT</code>]] function 
[[#FN-DEF-HASH-TABLE-P|<code>HASH-TABLE-P</code>]] function [[|]]

==== I ====

 
[[#FN-DEF-IDENTITY|<code>IDENTITY</code>]] function 
[[#FN-DEF-IGNORE|<code>IGNORE</code>]] function 
[[#FN-DEF-IN-PACKAGE|<code>IN-PACKAGE</code>]] macro 
[[#FN-DEF-INPUT-STREAM-P|<code>INPUT-STREAM-P</code>]] function 
[[#FN-DEF-INSTALL-SIGNAL-HANDLER|<code>INSTALL-SIGNAL-HANDLER</code>]] function 
[[#FN-DEF-INT/|<code>INT/</code>]] function 
[[#FN-DEF-INTEGER-DECODE-FLOAT|<code>INTEGER-DECODE-FLOAT</code>]] function 
[[#FN-DEF-INTEGERP|<code>INTEGERP</code>]] function 
[[#FN-DEF-INTERN|<code>INTERN</code>]] function 
[[#FN-DEF-INTERSECTION|<code>INTERSECTION</code>]] function [[|]]

==== J ====

[[|]]

==== K ====

 
[[#FN-DEF-KEYWORDP|<code>KEYWORDP</code>]] function [[|]]

==== L ====

 
[[#FN-DEF-LAST|<code>LAST</code>]] function 
[[#FN-DEF-LDB|<code>LDB</code>]] function 
[[#FN-DEF-LDIFF|<code>LDIFF</code>]] function 
[[#FN-DEF-LENGTH|<code>LENGTH</code>]] function 
[[#FN-DEF-LIST|<code>LIST</code>]] function 
[[#FN-DEF-443877220|<code>LIST*</code>]] function 
[[#FN-DEF-LIST-LENGTH|]]<code>LIST-LENGTH</code> function function 
[[#FN-DEF-LISTP|]]<code>LISTP</code> function 
[[#FN-DEF-LOAD|]]<code>LOAD</code> function 
[[#FN-DEF-LOG-MESSAGE|]]<code>LOG-MESSAGE</code> function 
[[#FN-DEF-LOWER-CASE-P|]]<code>LOWER-CASE-P</code> function[[|]]

==== M ====

 
[[#FN-DEF-MAKE-HASH-TABLE|]]<code>MAKE-HASH-TABLE</code> function 
[[#FN-DEF-MAKE-LIST|]]<code>MAKE-LIST</code> function 
[[#FN-DEF-MAKE-STRING|]]<code>MAKE-STRING</code> function 
[[#FN-DEF-MAKE-SYMBOL|]]<code>MAKE-SYMBOL</code> function 
[[#FN-DEF-MAKE-VECTOR|]]<code>MAKE-VECTOR</code> function 
[[#FN-DEF-MAKUNBOUND|]]<code>MAKUNBOUND</code> function 
[[#FN-DEF-MAPC|]]<code>MAPC</code> function 
[[#FN-DEF-MAPCAN|]]<code>MAPCAN</code> function 
[[#FN-DEF-MAPCAR|]]<code>MAPCAR</code> function 
[[#FN-DEF-MAPCON|]]<code>MAPCON</code> function 
[[#FN-DEF-MAPHASH|]]<code>MAPHASH</code> function 
[[#FN-DEF-MAPL|]]<code>MAPL</code> function 
[[#FN-DEF-MAPLIST|]]<code>MAPLIST</code> function 
[[#FN-DEF-MAX|]]<code>MAX</code> function 
[[#FN-DEF-MEMBER|]]<code>MEMBER</code> function 
[[#FN-DEF-MEMBER-IF|]]<code>MEMBER-IF</code> function 
[[#FN-DEF-MIN|]]<code>MIN</code> function 
[[#FN-DEF-MINUSP|]]<code>MINUSP</code> function 
[[#FN-DEF-MISMATCH|]]<code>MISMATCH</code> function 
[[#FN-DEF-MOD|]]<code>MOD</code> macro 
[[#FN-DEF-MULTIPLE-VALUE-LIST|]]<code>MULTIPLE-VALUE-LIST</code> macro 
[[#FN-DEF-MUST|]]<code>MUST</code> function[[|]]

==== N ====

 
[[#FN-DEF-NBUTLAST|]]<code>NBUTLAST</code> function 
[[#FN-DEF-NCONC|]]<code>NCONC</code> function 
[[#FN-DEF-NINTERSECTION|]]<code>NINTERSECTION</code> function 
[[#FN-DEF-NINTH|]]<code>NINTH</code> function 
[[#FN-DEF-NOTE-ACTIVITY|]]<code>NOTE-ACTIVITY</code> function 
[[#FN-DEF-NOTE-NUMERIC-PROGRESS|]]<code>NOTE-NUMERIC-PROGRESS</code> function 
[[#FN-DEF-NOTE-PERCENT-PROGRESS|]]<code>NOTE-PERCENT-PROGRESS</code> function 
[[#FN-DEF-NOTIFY-USER|]]<code>NOTIFY-USER</code> macro 
[[#FN-DEF-NOTING-ACTIVITY|]]<code>NOTING-ACTIVITY</code> macro 
[[#FN-DEF-NOTING-NUMERIC-PROGRESS|]]<code>NOTING-NUMERIC-PROGRESS</code> macro 
[[#FN-DEF-NOTING-PERCENT-PROGRESS|]]<code>NOTING-PERCENT-PROGRESS</code> function 
[[#FN-DEF-NRECONC|]]<code>NRECONC</code> function 
[[#FN-DEF-NREVERSE|]]<code>NREVERSE</code> function 
[[#FN-DEF-NSET-DIFFERENCE|]]<code>NSET-DIFFERENCE</code> function 
[[#FN-DEF-NSET-EXCLUSIVE-OR|]]<code>NSET-EXCLUSIVE-OR</code> function 
[[#FN-DEF-NSTRING-CAPITALIZE|]]<code>NSTRING-CAPITALIZE</code> function 
[[#FN-DEF-NSTRING-DOWNCASE|]]<code>NSTRING-DOWNCASE</code> function 
[[#FN-DEF-NSTRING-UPCASE|]]<code>NSTRING-UPCASE</code> function 
[[#FN-DEF-NSUBLIS|]]<code>NSUBLIS</code> function 
[[#FN-DEF-NSUBST|]]<code>NSUBST</code> function 
[[#FN-DEF-NSUBST-IF|]]<code>NSUBST-IF</code> function 
[[#FN-DEF-NSUBSTITUTE|]]<code>NSUBSTITUTE</code> function 
[[#FN-DEF-NSUBSTITUTE-IF|]]<code>NSUBSTITUTE-IF</code> function 
[[#FN-DEF-NTH|]]<code>NTH</code> function 
[[#FN-DEF-NTHCDR|]]<code>NTHCDR</code> function 
[[#FN-DEF-NULL|]]<code>NULL</code> function 
[[#FN-DEF-NUMBERP|]]<code>NUMBERP</code> function 
[[#FN-DEF-NUNION|]]<code>NUNION</code> function[[|]]

==== O ====

 
[[#FN-DEF-ODDP|]]<code>ODDP</code> function 
[[#FN-DEF-OPEN-BINARY|]]<code>OPEN-BINARY</code> function 
[[#FN-DEF-OPEN-TCP-STREAM|]]<code>OPEN-TCP-STREAM</code> function 
[[#FN-DEF-OPEN-TEXT|]]<code>OPEN-TEXT</code> function 
[[#FN-DEF-OUTPUT-STREAM-P|]]<code>OUTPUT-STREAM-P</code> function[[|]]

==== P ====

 
[[#FN-DEF-PAIRLIS|]]<code>PAIRLIS</code> macro 
[[#FN-DEF-PCASE|]]<code>PCASE</code> macro 
[[#FN-DEF-PCOND|]]<code>PCOND</code> macro 
[[#FN-DEF-PIF|]]<code>PIF</code> function 
[[#FN-DEF-PLUSP|]]<code>PLUSP</code> function 
[[#FN-DEF-POSITION|]]<code>POSITION</code> function 
[[#FN-DEF-POSITION-IF|]]<code>POSITION-IF</code> function 
[[#FN-DEF-PRIN1|]]<code>PRIN1</code> function 
[[#FN-DEF-PRIN1-TO-STRING|]]<code>PRIN1-TO-STRING</code> function 
[[#FN-DEF-PRINC|]]<code>PRINC</code> function 
[[#FN-DEF-PRINC-TO-STRING|]]<code>PRINC-TO-STRING</code> function 
[[#FN-DEF-PRINT|]]<code>PRINT</code> macro 
[[#FN-DEF-PRINTING-OBJECT|]]<code>PRINTING-OBJECT</code> function 
[[#FN-DEF-PROBE-FILE|]]<code>PROBE-FILE</code> function 
[[#FN-DEF-PROCLAIM|]]<code>PROCLAIM</code> macro 
[[#FN-DEF-PROGN|]]<code>PROGN</code> macro 
[[#FN-DEF-PUNLESS|]]<code>PUNLESS</code> function 
[[#FN-DEF-PUT|]]<code>PUT</code> macro 
[[#FN-DEF-PWHEN|]]<code>PWHEN</code> function[[|]]

==== Q ====

 
[[#FN-DEF-QUOTE|]]<code>QUOTE</code> function[[|]]

==== R ====

 
[[#FN-DEF-RANDOM|]]<code>RANDOM</code> function 
[[#FN-DEF-RASSOC|]]<code>RASSOC</code> function 
[[#FN-DEF-RASSOC-IF|]]<code>RASSOC-IF</code> function 
[[#FN-DEF-READ|]]<code>READ</code> function 
[[#FN-DEF-READ-BYTE|]]<code>READ-BYTE</code> function 
[[#FN-DEF-READ-CHAR|]]<code>READ-CHAR</code> function 
[[#FN-DEF-READ-FROM-STRING|]]<code>READ-FROM-STRING</code> function 
[[#FN-DEF-READ-LINE|]]<code>READ-LINE</code> function 
[[#FN-DEF-REM|]]<code>REM</code> function 
[[#FN-DEF-REMHASH|]]<code>REMHASH</code> function 
[[#FN-DEF-REMOVE|]]<code>REMOVE</code> function 
[[#FN-DEF-REMOVE-DUPLICATES|]]<code>REMOVE-DUPLICATES</code> function 
[[#FN-DEF-REMOVE-IF|]]<code>REMOVE-IF</code> function 
[[#FN-DEF-REMPROP|]]<code>REMPROP</code> function 
[[#FN-DEF-RENAME-FILE|]]<code>RENAME-FILE</code> function 
[[#FN-DEF-REPLACE|]]<code>REPLACE</code> function 
[[#FN-DEF-REPORT-ERROR|]]<code>REPORT-ERROR</code> function 
[[#FN-DEF-REST|]]<code>REST</code> function 
[[#FN-DEF-RESTART-PROCESS|]]<code>RESTART-PROCESS</code> macro 
[[#FN-DEF-RET|]]<code>RET</code> function 
[[#FN-DEF-REVAPPEND|]]<code>REVAPPEND</code> function 
[[#FN-DEF-REVERSE|]]<code>REVERSE</code> function 
[[#FN-DEF-ROUND|]]<code>ROUND</code> function 
[[#FN-DEF-RPLACA|]]<code>RPLACA</code> function 
[[#FN-DEF-RPLACD|]]<code>RPLACD</code> function[[|]]

==== S ====

 
[[#FN-DEF-SCALE-FLOAT|]]<code>SCALE-FLOAT</code> function 
[[#FN-DEF-SEARCH|]]<code>SEARCH</code> function 
[[#FN-DEF-SECOND|]]<code>SECOND</code> function 
[[#FN-DEF-SEED-RANDOM|]]<code>SEED-RANDOM</code> function 
[[#FN-DEF-SEQUENCEP|]]<code>SEQUENCEP</code> function 
[[#FN-DEF-SET|]]<code>SET</code> function 
[[#FN-DEF-SET-AREF|]]<code>SET-AREF</code> function 
[[#FN-DEF-SET-CHAR|]]<code>SET-CHAR</code> function 
[[#FN-DEF-SET-CONSING-STATE|]]<code>SET-CONSING-STATE</code> function 
[[#FN-DEF-SET-DIFFERENCE|]]<code>SET-DIFFERENCE</code> function 
[[#FN-DEF-SET-EXCLUSIVE-OR|]]<code>SET-EXCLUSIVE-OR</code> function 
[[#FN-DEF-SET-FILE-POSITION|]]<code>SET-FILE-POSITION</code> function 
[[#FN-DEF-SET-NTH|]]<code>SET-NTH</code> function 
[[#FN-DEF-SETHASH|]]<code>SETHASH</code> function 
[[#FN-DEF-SEVENTH|]]<code>SEVENTH</code> function 
[[#FN-DEF-SIXTH|]]<code>SIXTH</code> function 
[[#FN-DEF-SLEEP|]]<code>SLEEP</code> function 
[[#FN-DEF-SORT|]]<code>SORT</code> function 
[[#FN-DEF-STABLE-SORT|]]<code>STABLE-SORT</code> function 
[[#FN-DEF-STREAMP|]]<code>STREAMP</code> function 
[[#FN-DEF-STRING|]]<code>STRING</code> function 
[[#FN-DEF-STRING-CAPITALIZE|]]<code>STRING-CAPITALIZE</code> function 
[[#FN-DEF-STRING-DOWNCASE|]]<code>STRING-DOWNCASE</code> function 
[[#FN-DEF-STRING-EQUAL|]]<code>STRING-EQUAL</code> function 
[[#FN-DEF-STRING-GREATERP|]]<code>STRING-GREATERP</code> function 
[[#FN-DEF-STRING-LEFT-TRIM|]]<code>STRING-LEFT-TRIM</code> function 
[[#FN-DEF-STRING-LESSP|]]<code>STRING-LESSP</code> function 
[[#FN-DEF-STRING-NOT-EQUAL|]]<code>STRING-NOT-EQUAL</code> function 
[[#FN-DEF-STRING-NOT-GREATERP|]]<code>STRING-NOT-GREATERP</code> function 
[[#FN-DEF-STRING-NOT-LESSP|]]<code>STRING-NOT-LESSP</code> function 
[[#FN-DEF-STRING-RIGHT-TRIM|]]<code>STRING-RIGHT-TRIM</code> function 
[[#FN-DEF-STRING-TRIM|]]<code>STRING-TRIM</code> function 
[[#FN-DEF-STRING-UPCASE|]]<code>STRING-UPCASE</code> function 
[[#FN-DEF-STRING/=|]]<code>STRING/=</code> function 
[[#FN-DEF-427203732|]]<code>STRING<</code> function 
[[#FN-DEF-994985164|]]<code>STRING<=</code> function 
[[#FN-DEF-STRING=|]]<code>STRING=</code> function 
[[#FN-DEF-427203988|]]<code>STRING></code> function 
[[#FN-DEF-995017932|]]<code>STRING>=</code> function 
[[#FN-DEF-STRINGP|]]<code>STRINGP</code> function 
[[#FN-DEF-SUBLIS|]]<code>SUBLIS</code> function 
[[#FN-DEF-SUBSEQ|]]<code>SUBSEQ</code> function 
[[#FN-DEF-SUBSETP|]]<code>SUBSETP</code> function 
[[#FN-DEF-SUBST|]]<code>SUBST</code> function 
[[#FN-DEF-SUBST-IF|]]<code>SUBST-IF</code> function 
[[#FN-DEF-SUBSTITUTE|]]<code>SUBSTITUTE</code> function 
[[#FN-DEF-SUBSTITUTE-IF|]]<code>SUBSTITUTE-IF</code> function 
[[#FN-DEF-SXHASH|]]<code>SXHASH</code> function 
[[#FN-DEF-SYMBOL-FUNCTION|]]<code>SYMBOL-FUNCTION</code> function 
[[#FN-DEF-SYMBOL-NAME|]]<code>SYMBOL-NAME</code> function 
[[#FN-DEF-SYMBOL-PLIST|]]<code>SYMBOL-PLIST</code> function 
[[#FN-DEF-SYMBOL-VALUE|]]<code>SYMBOL-VALUE</code> function 
[[#FN-DEF-SYMBOLP|]]<code>SYMBOLP</code> function[[|]]

==== T ====

 
[[#FN-DEF-TAILP|]]<code>TAILP</code> function 
[[#FN-DEF-TENTH|]]<code>TENTH</code> function 
[[#FN-DEF-TERPRI|]]<code>TERPRI</code> function 
[[#FN-DEF-THIRD|]]<code>THIRD</code> function 
[[#FN-DEF-THROW|]]<code>THROW</code> function 
[[#FN-DEF-TIME-FROM-NOW|]]<code>TIME-FROM-NOW</code> function 
[[#FN-DEF-TIME-HAS-ARRIVED?|]]<code>TIME-HAS-ARRIVED?</code> function 
[[#FN-DEF-TIMESTRING|]]<code>TIMESTRING</code> function 
[[#FN-DEF-TREE-EQUAL|]]<code>TREE-EQUAL</code> function 
[[#FN-DEF-TRUNCATE|]]<code>TRUNCATE</code> function[[|]]

==== U ====

 
[[#FN-DEF-UNION|]]<code>UNION</code> function 
[[#FN-DEF-UNREAD-CHAR|]]<code>UNREAD-CHAR</code> function 
[[#FN-DEF-UPPER-CASE-P|]]<code>UPPER-CASE-P</code> function 
[[#FN-DEF-USER-CONFIRM|]]<code>USER-CONFIRM</code> function[[|]]

==== V ====

 
[[#FN-DEF-VALUES|]]<code>VALUES</code> function 
[[#FN-DEF-VARIABLE-INFORMATION|]]<code>VARIABLE-INFORMATION</code> function 
[[#FN-DEF-VECTOR|]]<code>VECTOR</code> function 
[[#FN-DEF-VECTORP|]]<code>VECTORP</code> function[[|]]

==== W ====

 
[[#FN-DEF-WARN|]]<code>WARN</code> macro 
[[#FN-DEF-WITH-BINARY-FILE|]]<code>WITH-BINARY-FILE</code> macro 
[[#FN-DEF-WITH-STATIC-AREA|]]<code>WITH-STATIC-AREA</code> macro 
[[#FN-DEF-WITH-TEXT-FILE|]]<code>WITH-TEXT-FILE</code> function 
[[#FN-DEF-WRITE|]]<code>WRITE</code> function 
[[#FN-DEF-WRITE-BYTE|]]<code>WRITE-BYTE</code> function 
[[#FN-DEF-WRITE-CHAR|]]<code>WRITE-CHAR</code> function 
[[#FN-DEF-WRITE-IMAGE|]]<code>WRITE-IMAGE</code> function 
[[#FN-DEF-WRITE-LINE|]]<code>WRITE-LINE</code> function 
[[#FN-DEF-WRITE-STRING|]]<code>WRITE-STRING</code> function 
[[#FN-DEF-WRITE-TO-STRING|]]<code>WRITE-TO-STRING</code> function[[|]]

==== X ====

[[|]]

==== Y ====

[[|]]

==== Z ====

 
[[#FN-DEF-ZEROP|]]<code>ZEROP</code>

DouglasRMiles

2016-11-30T21:55:06Z

DouglasRMiles:

<gdoc id="1XCDnWMjNh4y2Um_1B-HE4x5Q34oxHRxBl-Oy9eNUzTI" />

----
[https://docs.google.com/document/d/1XCDnWMjNh4y2Um_1B-HE4x5Q34oxHRxBl-Oy9eNUzTI/edit#heading=h.uv71c9k7i3ck|Yak Shaving]
Commonsense Bibliography

Collected by Push Singh
Contributions from: Leiguang Gong, Stefan Marti and Erik Mueller

Last updated: 29 January 2002

Table of contents

1 Recent overviews of the common sense problem
2 Classics
3 Cyc
3.1 Cyc overview
3.2 Cyc criticisms and evaluations
4 Cognitive architectures
4.1 Emotions
4.2 Heterogenous architectures
4.3 Blackboard systems
4.4 Human-level AI
4.5 Soar
4.6 Case-based reasoning
4.7 Belief-desire-intention architectures
5 Acquiring common sense
5.1 Distributed human projects
5.2 Acquisition through sketching
5.3 Learning structural representations
5.4 Sensory-grounded learning
6 Common sense reasoning
6.1 Issues in common sense inference
6.2 Default reasoning
6.3 Reflection
6.4 Problem reformulation
6.5 Analogical reasoning
6.6 Embodiment and metaphor
7 Logical formalisms
7.1 Situation calculus
7.2 Event calculus
7.3 Causal theories
7.4 Features and fluents
8 Contexts and organizing commonsense knowledge
9 Representations for commonsense knowledge
9.1 Overviews
9.2 Commonsense ontologies
9.3 Representing causality
9.4 Representing time
9.5 Story representations
9.6 Connectionist representations
10 Applications of common sense knowledge
10.1 Context-aware agents
10.2 The Semantic Web
11 Robots and common sense
11.1 Cognitive robotics
11.2 Natural language interfaces to robots
12 Natural language
12.1 Frame semantics
12.2 Lexical semantics
13 Realms of thinking
13.1 Spatial reasoning
13.2 Physical reasoning
13.3 Social reasoning
13.4 Story understanding
13.5 Visual reasoning
14 Psychology
14.1 Cognitive psychology
14.2 Psychology of memory
14.3 Psychology of story understanding
14.4 Psychology of inference
15 Criticisms
16 Web resources
17 UNPLACED

1 Recent overviews of the common sense problem

Minsky, Marvin. (2000). Commonsense-Based Interfaces. Communications of the ACM 43(8):67-73.
http://commonsense.media.mit.edu/minsky.pdf
http://library.navo.navy.mil/Journals/jcs03Aug00.pdf

Minsky, Marvin. (Forthcoming). The Emotion Machine (draft chapter on commonsense)

Singh, Push. (2002). The Open Mind Common Sense Project.
http://openmind.media.mit.edu/Kurzweil.htm
http://www.kurzweilai.net/meme/frame.html?main=/articles/art0371.html

Davis, E. (1998). The Naive Physics Perplex. AI Magazine, Winter 1998, Vol. 19. No. 4. pp. 51-79.
2 Classics

McCarthy, John. (1959). Programs with Common Sense. In Mechanisation of Thought Processes, Proceedings of the Symposium of the National Physics Laboratory, London, U.K.: Her Majesty's Stationery Office, pp. 77-84.
http://www-formal.stanford.edu/jmc/mcc59/mcc59.html
http://www-formal.stanford.edu/jmc/mcc59.pdf

Minsky, Marvin. (1968). Introduction. In Marvin L. Minsky (Ed.), Semantic information processing (pp. 1-32). Cambridge, MA: MIT Press.

Minsky, Marvin. (1974). A framework for representing knowledge (AI Memo 306). Artificial Intelligence Laboratory, Massachusetts Institute of Technology.
http://www.media.mit.edu/~minsky/papers/Frames/frames.html

Minsky, Marvin (1986). The society of mind. New York: Simon and Schuster.

3 Cyc

3.1 Cyc overview

Lenat, Douglas, & Guha, Ramanathan. (1990). Building large knowledge-based systems. Reading, MA: Addison-Wesley.

Lenat, Douglas, & Guha, Ramanathan. (1990). Cyc: A Mid Term Report. AI Magazine, 11(3):32-59.

Lenat, Douglas. (1995). CYC: A large-scale investment in knowledge infrastructure. Communications of the ACM, 38(11).

Guha, Ramanathan, & Lenat, Douglas. (1994). Enabling agents to work together. Communications of the ACM, 37(7):127-142.
http://www.acm.org/pubs/citations/journals/cacm/1994-37-7/p126-guha/
http://www.acm.org/pubs/articles/journals/cacm/1994-37-7/p126-guha/p126-guha.pdf

3.2 Cyc criticisms and evaluations

Locke, Christopher. Common Knowledge or Superior Ignorance?
http://www.panix.com/~clocke/ieee.html

Pratt, Vaughan. Cyc report.
http://www.cs.umbc.edu/~narayan/proj/cyc-critic.html

Mahesh, Kavi, Nirenburg, Sergei, Cowie, Jim, & Farwell, David (1996). An assessment of Cyc for natural language processing (Technical Report MCCS 96-302). Computing Research Laboratory, New Mexico State University, Las Cruces, New Mexico.
http://crl.nmsu.edu/Research/Pubs/MCCS/Postscript/mccs-96-302.ps

Mark J. Stefik and Stephen W. Smoliar (1993). The Commonsense Reviews – Eight reviews of: Douglas Lenat and Ramanathan V. Guha (1990) Building Large Knowledge-Based Systems: Representations and Inference in the CYC Project, Addison-Wesley, and Ernest Davis, Representations of Commonsense Knowledge, Morgan Kaufmann 1990. Artificial Intelligence, 61:37-179.
http://www.cs.brandeis.edu/~brendy/CYC_report.txt
http://www1.elsevier.nl/inca/publications/store/5/0/5/6/0/1/

Guha, Ramanathan, & Lenat, Douglas. (1993). Re: CycLing paper reviews, Artificial Intelligence, 61(1):149-174.

4 Cognitive architectures

4.1 Emotions

Sloman, Aaron. (2001). Beyond shallow models of emotion. Cognitive Processing, 1(1).

Chapters from:
Minsky, Marvin. (Forthcoming). The Emotion Machine.

4.2 Heterogenous architectures

Minsky, Marvin. (1991). Logical versus analogical or symbolic versus connectionist or neat versus scruffy. AI Magazine, Summer 1991.

Mueller, Erik T. (1998). Natural language processing with ThoughtTreasure. New York: Signiform.
http://www.signiform.com/tt/book/

Mueller, Erik T. (1990). Daydreaming in humans and machines: A computer model of the stream of thought. Norwood, NJ: Ablex/Intellect.
ftp://ftp.cs.ucla.edu/tech-report/198_-reports/870017.pdf

Singh, Push. (1999). Big list of mental agents for common sense thinking.
http://www.media.mit.edu/people/push/agencies.html

4.3 Blackboard systems

Hayes-Roth, B. A blackboard architecture for control. Artificial Intelligence, 1985. 26: p. 251-321.

Nii, H. P. (1986). Blackboard Systems: The Blackboard Model of Problem Solving and the Evolution of Blackboard Architectures. AI Magazine, 7(2):38-53.

Engelmore, R. and Morgan, T. (1988). Blackboard systems. Addison-Wesley, Reading, Massachuset.

Carver, N., & Lesser, V. (1994). Evolution of blackboard control architectures. Expert Systems with Applications 7, 1-30.

4.4 Human-level AI

McCarthy, John. The well-designed child.
http://www-formal.stanford.edu/jmc/child1.html

McCarthy, John. (1996). From here to human-level AI.
http://www-formal.stanford.edu/jmc/human.html

4.5 Soar

Newell A., & Simon, H. A. (1963). GPS, a program that simulates human thought. In E. A. Feigenbaum and J. Feldman, editors, Computers and Thought, pages 279--293. McGraw-Hill, New York.

Lehman, J.F., Laird, J.E., & Rosenbloom, P.S. (1996) A gentle introduction to Soar, an architecture for human cognition. In S. Sternberg & D. Scarborough (eds.) Invitation to Cognitive Science, Volume 4.

Rosenbloom, P.S., Laird, J.E. & Newell, A. (1993) The Soar Papers: Readings on Integrated Intelligence. Cambridge, MA: MIT Press.

Laird, J.E., & Rosenbloom, P.S. (1996) The evolution of the Soar cognitive architecture. In T. Mitchell (ed.) Mind Matters.

Newell, A. (1990). Unified Theories of Cognition. Cambridge, MA: Harvard.

4.6 Case-based reasoning

Carbonell, J. (1986). Derivational analogy: a theory of reconstructive problem solving and expertise acquisition, in: R.S. Michalski et al. (eds.), Machine Intelligence; an AI approach, 2:371—392.

Hammond, C. (1989). Case-Based Planning: Viewing Planning as a Memory Task. Academic Press, San Diego.

K.J. Hammond. Explaining and Repairing Plans that Fail. Artificial Intelligence, 45(3):173--228, 1990.

Kolodner, J. (1992). An introduction to case-based reasoning. Artificial Intelligence Review, 6:3—34..

Kolodner, J. (1993). Case-Based Reasoning. Morgan Kaufman, San Mateo, CA.

Veloso, M. M., & Carbonell, J. G. (1993). Derivational analogy in Prodigy: Automating case acquisition, storage, and utilization. Machine Learning , 10 , 249--278.

4.7 Belief-desire-intention architectures

Fagin, Halpern, Moses, and Vardi. (1995). Reasoning About Knowledge. Cambridge, MA: MIT Press.

Cohen, Philip R., and Levesque, Hector J. (1990). Intention is choice with commitment. Artificial Intelligence, 42, 213-261.

M. E. Bratman, D. J. Isreal, and M. E. Pollack. Plans and resource-bounded practical reasoning. Computational Intelligence, 4(4), 1988.
http://citeseer.nj.nec.com/bratman88plans.html

A.S. Rao and M.P. Georgeff. Modeling rational agents within a BDI-architecture. In J. Allen, R. Fikes, and E. Sandewall, editors, Proceedings of the Second International Conference on Principles of Knowledge Representation and Reasoning (KR'91), pages 473-484. Morgan Kaufmann, 1991.
http://citeseer.nj.nec.com/rao91modeling.html

Halpern, J. and Moses, Y. 1984. Knowledge and common knowledge in a distributed environment, Proc. 3rd ACM Symposium on Principles of Distributed Computing, New York: ACM, pp. 50-61.
http://citeseer.nj.nec.com/halpern84knowledge.html

Lakemeyer, G. and Levesque, H. J., AOL: a logic of acting, sensing, knowing, and only knowing, Proc. of the 6th International Conference on Principles of Knowledge Representation and Reasoning (KR'98), Morgan Kaufmann, 1998.
5 Acquiring common sense

5.1 Distributed human projects

Stork, David. (1999). The OpenMind Initiative. IEEE Intelligent Systems & their applications, 14(3):19-20.

Singh, Push, et al. (In submission). Open Mind Common Sense: knowledge acquisition from the general public.

5.2 Acquisition through sketching

Forbus, K. D., Ferguson, R. W., & Usher, J. M. (2000). Towards a computational model of sketching, Proceedings of the International Conference on Intelligent User Interfaces . Sante Fe, New Mexico.

5.3 Learning structural representations

Pazzani, M., & Kibler, D. (1992). The Utility of Knowledge in Inductive Learning, Machine Learning, 9:57—94.

Quinlan, J. R., & Cameron-Jones, R. M. (1993). FOIL: A midterm report. In Pavel B. Brazdil, editor, Machine Learning: ECML-93, Vienna, Austria.

Quinlan, J. R., & Cameron-Jones, R. M. (1995). Induction of logic programs: FOIL and related systems. New Generation Computing, 13:287-312.

5.4 Sensory-grounded learning

Deb Roy. (In press). Learning Visually Grounded Words and Syntax of Natural Spoken Language. Evolution of Communication.

Sarah Finney, Natalia Gardiol Hernandez, Tim Oates, and Leslie Pack Kaelbling, "Learning in Worlds with Objects," Working Notes of the AAAI Stanford Spring Symposium on Learning Grounded Representations, 2001.

Cohen, Paul R; Atkin, Marc S.; Oates, Tim; and Beal, Carole R. Neo: Learning Conceptual Knowledge by Sensorimotor Interaction with an Environment. In Proceedings of the First International Conference on Autonomous Agents, pages 170 - 177, 1997.

Schmill, Matthew D.; Oates, Tim; and Cohen, Paul R. Learning Planning Operators in Real-World, Partially Observable Environments. In Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling, pages 246-253, 2000.
6 Common sense reasoning

6.1 Issues in common sense inference

Minsky, Marvin. (1981). Jokes and their relation to the cognitive unconscious. In Vaina and Hintikka (eds.), Cognitive Constraints on Communication. Reidel.

Minsky, Marvin. (1994). Negative expertise, International Journal of Expert Systems, 7(1):13-19.

6.2 Default reasoning

McDermott, D., & Doyle. J. (1980). Non-Monotonic Logic I. Artificial Intelligence 13:41--72.

de Kleer, J. (1986). An Assumption Based Truth Maintenance System. Artificial Intelligence, 28:127-162.

Doyle, J. (1979). A truth maintenance system. Artificial Intelligence, 12:231—272.

Reiter, R. (1980). A logic for default reasoning. Artificial Intelligence 13:81--132.

6.3 Reflection

Smith, B. (1982). Reflection and semantics in a procedural language (Technical Report 272). Cambridge, MA: MIT, Laboratory for Computer Science.

Doyle, J. (1980). A model for deliberation, action, and introspection (Technical Report 581). Cambridge, MA: MIT, AI Laboratory.

McCarthy, John. (1995), Making robots conscious of their mental states, in AAAI Spring Symposium on Representing Mental States and Mechanisms.

E. Stroulia and A. Goel. Functional Representation and Reasoning in Reflective Systems. To appear in Journal of Applied Intelligence, Special Issue on Functional Reasoning, 9(1), January 1995.

6.4 Problem reformulation

Amarel, Saul. (1968). On representations of problems of reasoning about actions. In Michie, editor, Machine Intelligence 3, pages 131--171. Edinburgh University Press, 1968.

McCarthy, John. Elaboration tolerance.
http://www-formal.stanford.edu/jmc/elaboration.html

6.5 Analogical reasoning

Falkenhainer, B., Forbus, K.D. and Gentner, D. (1990). The structure-mapping engine: algorithm and examples, Artificial Intelligence, 41:1-63.
http://citeseer.nj.nec.com/falkenhainer89structuremapping.html

Davis, E. (1991). Lucid representations. NYU Computer Science Dept. Tech Report 565.
http://citeseer.nj.nec.com/davis94lucid.html

Gentner, D. (2001). Spatial metaphors in temporal reasoning. In M. Gattis (Ed.), Spatial schemas in abstract thought (pp. 203-222). Cambridge, MA: MIT Press.
http://www.psych.nwu.edu/psych/people/faculty/gentner/pdfs%20papers/spatial%20schemas.2001.pdf

Gentner, D., Bowdle, B., Wolff, P., & Boronat, C. (2001). Metaphor is like analogy. In D. Gentner, K. J. Holyoak, & B. N. Kokinov (Eds.), (2001). The analogical mind: Perspectives from cognitive science (pp. 199-253). Cambridge, MA: MIT Press.
http://www.psych.nwu.edu/psych/people/faculty/gentner/pdfs%20papers/gentner-a2k-01.pdf

Forbus, K. D., Gentner, D., Markman, A. B., & Ferguson, R. W. (1998). Analogy just looks like high-level perception: Why a domain-general approach to analogical mapping is right. Journal of Experimental and Theoretical Artificial Intelligence, 10(2), 231-257.
http://www.psych.nwu.edu/psych/people/faculty/gentner/pdfs%20papers/forbus-gentner-98.pdf

6.6 Embodiment and metaphor

Lakoff G. & Johnson M. (1990) Metaphors we live by. The University of Chicago Press.

Narayanan, S. (1997). Talking the Talk is Like Walking the Walk . (Also in Proceedings of CogSci97, Stanford, August 1997).

Siskind, Jeffrey M. (1994). Grounding language in perception. Artificial Intelligence Review, 8:371—391.

Siskind, Jeffrey M. (2001). Grounding the Lexical Semantics of Verbs in Visual Perception Using Force Dynamics and Event Logic. Journal of Artificial Intelligence Research, volume 15, pp. 31-90, August 2001.
7 Logical formalisms

7.1 Situation calculus

McCarthy, John, & Hayes, Patrick J. (1969). Some philosophical problems from the standpoint of artificial intelligence. In D. Michie & B. Meltzer (Eds.), Machine intelligence 4. Edinburgh, Scotland: Edinburgh University Press.

McCarthy, John (1990). Formalizing common sense. Norwood, NJ: Ablex.

McCarthy, John. (1980). Circumscription -- a form of non-monotonic reasoning. Journal of Artificial Intelligence, 13:27—39.

McCarthy, John. (1968). Programs with common sense. In: M. Minsky, (Ed.), Semantic Information Processing, MIT Press, Cambridge, MA, pages 403—418.

Reiter, Raymond (2001), Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems. MIT Press.

7.2 Event calculus

R. Kowalski, & M. J. Sergot. (1986). A Logic-Based Calculus of Events. New Generation Computing, Vol. 4, Springer Verlag, pp. 67--95.

Shanahan, Murray (1997). Solving the frame problem. Cambridge, MA: MIT Press.

7.3 Causal theories

N. McCain and H. Turner. (1997). Causal theories of action and change. In Proceedings AAAI-97.

N. McCain and H. Turner. (1995). A causal theory of ramifications and qualifications. In Proceedings IJCAI-95.

Lifschitz, Vladimir. (2000). Missionaries and cannibals in the causal calculator. In Principles of Knowledge Representation and Reasoning: Proceedings of Seventh International Conference. To appear.

Lee, Joohyung, Lifschitz, Vladimir, & Turner, Hudson. (2001). A representation of the zoo world in the language of the causal calculator. Unpublished draft.

7.4 Features and fluents

Sandewall, Erik. (1994). Features and Fluents. The Representation of Knowledge about Dynamical Systems. Volume I. Oxford University Press.

8 Contexts and organizing commonsense knowledge

Lenat, D. (1998) The dimensions of context-space, Cycorp technical report, www.cyc.com.

McCarthy, John. (1993). Notes on formalizing context. In Proceedings of the thirteenth international joint conference on artificial intelligence.
http://citeseer.nj.nec.com/318177.html

9 Representations for commonsense knowledge

9.1 Overviews

R. Davis, H. Shrobe, and P. Szolovits. What is a Knowledge Representation? AI Magazine, pages 17--33, Spring 1993.

Selected chapters from Ernest Davis (1990). Representations of Commonsense Knowledge. San Mateo, CA: Morgan Kaufmann Publishers, Inc. (book, 544 pages)
“A central goal of artificial intelligence is to give a computer program commonsense understanding of basic domains such as time, space, simple laws of nature, and simple facts about human minds. Many different systems of representation and inference have been developed for expressing such knowledge and reasoning with it. Representations of Commonsense Knowledge is the first thorough study of these techniques.”
http://www.mkp.com/books_catalog/catalog.asp?ISBN=1-55860-033-7

9.2 Commonsense ontologies

Lenat, Douglas. Cyc Upper Ontology, See http://www.cyc.com/cyc-2-1/index.html

Lenat, Douglas, & Guha, Ramanathan. (1991). The Evolution of CycL, The Cyc Representation Language. SIGART Bulletin, 2(3): 84-87, June 1991.

Hayes, P. J. (1985). The Second Naive Physics Manifesto. In Formal Theories of the Commonsense World, 1-36, eds. J.R. Hobbs & R.C. Moore. Norwood, NJ: Ablex Publishing Corp. Also reprinted in Brachman & Levesque 1985, 468-485.

Hayes, P. J. (1985). Naive Physics I: Ontology for liquids. In Formal theories of the common sense world, ed. J.

Allen, J. F. and Hayes, P. J. (1985). A common-sense theory of time, Proceedings of the 9th International Joint Conference on Artificial Intelligence, pp. 528--531.

Hayes, P. J. (1979). Naive physics manifesto. Expert Systems in the Microelectronic Age. Edinburgh: Edinburgh University Press.

9.3 Representing causality

Pearl, J. (2000). Causality: Models, Reasoning and Inference. Cambridge University Press.

9.4 Representing time

Allen, J. F. (1991). Time and time again: The many ways to represent time. International Journal of Intelligent Systems 6(4):341-356, July 1991.

Allen, J. F. Planning as temporal reasoning. (1991). In Proceedings of 2nd Principles of Knowledge Representation and Reasoning, Morgan Kaufmann.

Allen, J. F. (1983). Maintaining knowledge about temporal intervals. Communications of the ACM, 26(11):832-843, November 1983.

Allen, J. F. (1984). Towards a general theory of action and time, Artificial Intelligence 23:123—154.

9.5 Story representations

Schank, Roger. (1972). Conceptual dependency: a theory of natural language understanding. Cognitive Psychology 3, 552--631.

Schank, R.C., & Rieger, C.J. (1974). Inference and the Computer Understanding of Natural Language. Artificial Intelligence, 5:373—412.

Mueller, Erik T. (1999). A database and lexicon of scripts for ThoughtTreasure.
http://www.signiform.com/tt/htm/script.htm

Mueller, Erik T. (1999): Prospects for in-depth story understanding by computer (unpublished paper, 23 pages)
http://www.media.mit.edu/~mueller/papers/storyund.html

Mueller, Erik T. (2002). Story understanding. In Encyclopedia of Cognitive Science. London: Nature Publishing Group.

9.6 Connectionist representations

Marvin Minsky, and Seymour Papert. Perceptrons (expanded edition), MIT Press,1988.

Dyer …

10 Applications of common sense knowledge

10.1 Context-aware agents

Mueller, Erik T. (2000). A calendar with common sense. Proceedings of the 2000 International Conference on Intelligent User Interfaces (pp. 198-201). New York: Association for Computing Machinery.

Singh, Push. (2002). The public acquisition of commonsense knowledge. In Proceedings of AAAI Spring Symposium: Acquiring (and Using) Linguistic (and World) Knowledge for Information Access. Palo Alto, CA, AAAI.

McCarthy, John., "Some Expert Systems Need Commonsense, " in Lifschitz, V. (ed.), Formalizing Common Sense: Papers by John McCarthy, pp. 189-197, Norwood, NJ: Ablex, 1990.

Lenat, Douglas, & Guha, Ramanathan. (1994). Ideas for Applying CYC. Cyc technical report, www.cyc.com.
Available at http://www.cyc.com/tech-reports/act-cyc-407-91/act-cyc-407-91.html

Lieberman, Henry, & Selker, Ted. (2000). Out of context: Computer systems that adapt to, and learn from, context. IBM Systems Journal, 39(3,4):617-632.
http://www.research.ibm.com/journal/sj/393/part1/lieberman.pdf

10.2 The Semantic Web

Berners-Lee, Tim., Hendler, James, & Lassila, Ora. (2001). The Semantic Web. Scientific American Volume 284, Number 5, May 2001, pp. 34-43.
http://www.scientificamerican.com/2001/0501issue/0501berners-lee.html

Berners-Lee, Tim. (1998). Semantic Web Road map.
http://www.w3.org/DesignIssues/Semantic.html

Berners-Lee, Tim. (1998). What the Semantic Web can represent.
http://www.w3.org/DesignIssues/RDFnot.html

11 Robots and common sense

Shapiro, Stuart C., Amir, Eyal, Grosskreutz, Henrik, Randell, David, & Soutchanski, Mikhail. (2001). Commonsense and Embodied Agents: A Panel Discussion. Common Sense 2001: 5th Symposium on Logical Formalizations of Commonsense Reasoning, May 20-22, 2001.
http://www.cs.nyu.edu/faculty/davise/commonsense01/final/panel.pdf

11.1 Cognitive robotics

Amir, Eyal, & Maynard-Reid Pedrito II. (2001). LiSA: A Robot Driven by Logical Subsumption. Common Sense 2001: 5th Symposium on Logical Formalizations of Commonsense Reasoning, May 20-22, 2001.
http://www.cs.nyu.edu/faculty/davise/commonsense01/papers.html#Amir
http://www.cs.nyu.edu/faculty/davise/commonsense01/final/amir.pdf

11.2 Natural language interfaces to robots

Eva Stopp, Klaus-Peter Gapp, Gerd Herzog, Thomas Längle, and Tim C. Lüth (1994). Utilizing Spatial Relations for Natural Language Access to an Autonomous Mobile Robot. Unpublished paper (paper, 16 pages)
http://wwwipr.ira.uka.de/internal/detailed_publication.php?id=974907079

Thomas Längle, Tim C. Lüth, Eva Stopp, Gerd Herzog, and Gjertrud Kamstrup (1995). KANTRA – A Natural Language Interface for Intelligent Robots. International Conference on Intelligent Autonomous Systems, Karlsruhe, Germany, March. In Rembold et al. (eds.), Intelligent Autonomous Systems, IOS Press, pp. 357-364 (paper, 8 pages)
http://wwwipr.ira.uka.de/internal/detailed_publication.php?id=975423485
http://wwwipr.ira.uka.de/internal/download.php?id=975423485&filetype=pdf

12 Natural language

12.1 Frame semantics

Fillmore, C. (1968). The case for Case. Universals in Linguistic Theory. E. Bach and R. Harms. New York, Holt, Reinhart and Winston.

12.2 Lexical semantics

Jackendoff, R. (1983). Semantics and cognition. Cambridge, MA, MIT Press.

Pustejovsky, J. (1991). The generative lexicon. Computational linguistics 17: 409-441.

13 Realms of thinking

13.1 Spatial reasoning

Amitabha Mukerjee, Neat vs Scruffy: A survey of Computational Models for Spatial Expressions
http://citeseer.nj.nec.com/250615.html
This is from a book called Representation and Processing of Spatial Expressions, Erlbaum.

Davis, E. Representing and Acquiring Geographic Knowledge. Morgan Kauffman, California.

Kuipers, B. J. (1978). Modeling spatial knowledge. Cognitive Science, 2:129—153.

Kuipers, B. J. (2000). The spatial semantic hierarchy. Artificial Intelligence, 119:191—233.

13.2 Physical reasoning

Rieger, C., & Grinberg, M. (1977). The Causal Representation and Simulation of Physical Mechanisms. Technical Report TR-495, Dept. of Computer Science, University of Maryland.

13.3 Social reasoning

Lehnert, W. G. (1981). Plot Units and Narrative Summarization. Cognitive Science, 4:293—331.

Carbonell, J. (1980). Towards a process model of human personality traits. Artificial Intelligence, 15, 49-74.

Hendler, J. (1988). Integrating Marker-Passing and Problem-Solving.

13.4 Story understanding

Ram, Ashwin. (1987). AQUA: asking questions and understanding answers. In Proceedings of the Sixth Annual National Conference on Artificial Intelligence, pp. 312--316 Seattle, WA.

13.5 Visual reasoning

L. Stark and K. Bowyer. ``Functional context in vision''. In Workshop on Context-based Vision. IEEE Press, 1995.

T.M. Strat and M.A. Fischler. ``The role of context in computer vision''. In Workshop on Context-based Vision. IEEE Press, 1995.

R.K. Srihari. ``Linguistic context in vision''. In Workshop on Context-based Vision. IEEE Press, 1995.

H. Buxton and S. Gong. ``Visual surveillance in a dynamic and uncertain world''. Artificial Intelligence, 78:371--405, 1995.

Smith, Barry, "Formal Ontology, Common Sense, and Cognitive Science", International Journal of Human- Computer Studies, 43 (1995).

Gong, L., Kulikowski, C., Composition of Image Analysis Processes through Object-Centered Hierarchical Planning, IEEE TRANS on Pattern Recognition and Machine Intelligence (PAMI), 1995; 17(10):997-1009.

T.M. Strat and M.A. Fischler. ``Context-based vision: Recognising objects using both 2D and 3D imagery''. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13:1050--1065, 1991.

D. Rosenthal and R. Bajscy, ``Visual and conceptual hierarchy: a paradigm for studies of automated generation of recognition strategies'', IEEE Trans. PAMI-6, 3: pp. 319-324, 1984.

P. Selfridge, ``Reasoning about success and failure in aerial image understanding'', PhD Thesis, University of Rochester, 1981.

D. Garvey, "Perceptual strategies for purposive vision'', Technical note 117, AI Center, SRI International, 1976.

M. Minsky, ``A Framework for representing knowledge'', in The Psychology of Computer Vision. P.Winston (ed.), New York, McGraw-Hill 1975.

Roberto Casati and Achille C. Varzi. Holes and Other Superficialities, Cambridge, MA, and London: MIT Press [Bradford Books], 1994.

J.L. Crowley and H. Christensen. Vision as Process. Springer-Verlag, Berlin, 1993.

J. Aloimonos, Integration of Visual Modules. San Diego, Academic Press, Inc., 1989.

Steven Pinker. Editor. Visual Cognition, The MIT Press, 1988.

Waltz, David L., & Boggess, Lois (1979). Visual analog representations for natural language understanding. Proceedings of the 1979 International Joint Conference on Artificial Intelligence.

D. Marr. Vision, San Francisco, W.H. Freeman, 1982.

Rudolf Arnheim. Visual Thinking, University of California Press, Ltd.,
1969.

Gong, L., Image Analysis as Context-Based Reasoning, In Proc. of ISCA 10th International conference on Intelligent Systems. Virginia, p130-34, 2001. Ahmed E. Ibrahim An Intelligent Framework for Image Understanding
http://www.engr.uconn.edu/%7Eibrahim/publications/image.html

Roger C. Schank, Andrew E. Fano: Memory and Expectations in Learning, Language, and Visual Understanding. 261-271.

R. Collins, A. Lipton, T. Kanade, H. Fujiyoshi, D. Duggins, Y. Tsin, D. Tolliver, N. Enomoto, and O. Hasegawa tech. report CMU-RI-TR-00-12, Robotics Institute, Carnegie Mellon University, May, 2000.

Nuria Oliver. "Towards Perceptual Intelligence: Statistical Modeling of Human Individual and Interactive Behaviors", PhD thesis, MIT Media Lab, 2000.

Milan Sonka, Vaclav Hlavac, and Roger Boyle. Image Processing, Analysis, and Machine Vision, Pacific Grove, CA : PWS Pub. c1999.

Joachim M. Buhmann, Jitendra Malik and Pietro Perona. Image Recognition: Visual Grouping, Recognition and Learning. in: Proceedings of the National Academy of Science, Vol. 96, No 25, pp. 14203-14204, Dec. 7, 1999.

By Christopher O. Jaynes. Seeing is Believing: Computer Vision and Artificial Intelligence. ACM Crossroads (the student magazine of the Association for Computing Machinery), 1996.

H. Buxton and R. Howarth. ``Watching behaviour: The role of context and learning''. In International Conference on Image Processing, Lausanne, Switzerland, 1996.

G. Socher, G. Sagerer, F. Kummert and T. Fuhr. ``Talking about 3D scenes: Integration of image and speech understanding in a hybrid distributed system''. In International Conference on Image Processing, Lausanne, Switzerland, 1996.

Bobick, Aaron, and Pinhanez, Claudio. "Using Approximate Models as Source of Contextual Information for Vision Processing." Proceedings of the Workshop on Context-Based Vision, ICCV'95, Cambridge, Massachusetts, pp.13-21. June 1995.

Bobick, Aaron, and S. Intille. "Exploiting Contextual Information for Tracking by Using Closed-Worlds." Proceedings
of the Workshop on Context-Based Vision, Cambridge, Massachusetts, pp.87-98. June 1995.

Cassell, Justine. "Speech, Action and Gestures as Context for Ongoing Task-Oriented Talk." Proceedings of AAAI Fall Symposium on Embodied Language and Action, pp. 20-25. November 1995.
14 Psychology

14.1 Cognitive psychology

Clark, Herbert H. (1977). Bridging. In Thinking: Readings in Cognitive Science.

Graesser, Arthur C., Singer, Murray, and Trabasso, Tom (1994). Constructing inferences during narrative text comprehension. Psychological Review. 101(3):371-395.

McKoon, Gail, & Ratcliff, Roger (1992). Inference during reading. Psychological Review. 99(3):440-466.

McKoon, Gail, & Ratcliff, Roger (1986). Inferences about predictable events. Journal of Experimental Psychology: Learning, Memory, and Cognition. 12(1):82-91.

Beeman, Mark. (1998). Coarse semantic coding and discourse comprehension. In Right hemisphere language comprehension. Mahwah, NJ: Erlbaum.

Heider, Fritz (1958). The psychology of interpersonal relations. Hillsdale, NJ: Erlbaum.

Smedslund, Jan (1997). The structure of psychological common sense. Mahwah, NJ: Erlbaum.

14.2 Psychology of memory

Landauer, Thomas K. (1986). How much do people remember? Some estimates of the quantity of learned information in long-term memory. Cognitive Science, 10:477-493.

14.3 Psychology of story understanding

Goldman, Susan R., Graesser, Arthur C., & van den Broek, Paul (1999). Narrative comprehension, causality, and conherence. Mahwah, NJ: Erlbaum.

14.4 Psychology of inference

St. George, Marie, Mannes, Suzanne, and Hoffman, James E. (1997). Individual differences in inference generation: An ERP analysis. Journal of Cognitive Neuroscience, 9(6):776-787.

Van Petten, Cyma, & Kutas, Marta (1990). Interactions between sentence context and word frequency in event-related brain potentials. Memory & Cognition, 18(4):380-393.

Tanenhaus, Michael K., Spivey-Knowlton, Michael J., Eberhard, Kathleen M., & Sedivy, Julie C. (1995). Integration of visual and linguistic information in spoken language comprehension. Science, 268, 1632-1634.

Burgess, Curt, & Simpson, Greg B. (1988). Cerebral hemispheric mechanisms in the retrieval of ambiguous word meanings. Brain and Language, 33:86-103.
http://locutus.ucr.edu/abstracts/88-bs-cere.html

Caramazza, Alfonso (1998). The interpretation of semantic category-specific deficits: What do they reveal about the organization of conceptual knowledge in the brain? Neurocase, 4:265-272.

15 Criticisms

McDermott, D. (1987). A critique of pure reason. Computational Intelligence, 3:151—160.

16 Web resources

Commonsense problem page
http://www-formal.stanford.edu/leora/cs/

Open Mind Common Sense
http://www.openmind.org/commonsense

ThoughtTreasure
http://www.signiform.com/tt/htm/tt.htm

OpenCyc
http://www.opencyc.org

17 UNPLACED

Wilensky, R., 1983. Planning and Understanding: A Computational Approach to Human Reasoning. Reading, MA:Addison--Wesley.

Various papers by Doug Lenat
(e.g. Common Sense and the Mind of HAL by Doug Lenat)

Minsky, M. More Turing Option chapters (on common sense bugs)

Paper on the IEEE Standard Upper Level ?

Selected papers from the Common Sense 2001: 5th Symposium on Logical Formalizations of Commonsense Reasoning. May 20-22, 2001
http://www.cs.nyu.edu/faculty/davise/commonsense01/

Jon Barwise and John Perry: Situations and Attitudes
Lucy Suchman: Situated Systems

More on conceptual primitives?

Should anything from
http://www.eecs.umich.edu/~rthomaso/bibs/context.bib.txt
be incorporated?

Modeling personality:

Don't forget Dyer's In-Depth Understanding and Lehnert's book on question answering and work on plot units.

Logical approaches to reasoning about action and change (I think you've tracked most of these down already):
Situation calculus
McCarthy and Hayes, Some Philosophical Problems ...
Reiter, Knowledge in Action
Event calculus
Kowalski and Sergot
Shanahan, Solving the Frame Problem
Features and fluents
Sandewall
Temporal Action Logics: Patrick Doherty (this is an important derivative of Features and Fluents with an implementation as the program VITAL)
Causal theories
McCain and Turner (papers attached)
(See attached file: ActionLanguages.ps)(See attached file: CCalcManual.ps)
(See attached file: McCainPhD.ps)

Big List of Mental Agents for Common Sense Thinking
Push Singh | MIT Media Lab
Started 4-1-98
Last updated 12-7-99

Contents | Vocabulary | Questions | Agents | Representations

1. Contents
The following is a list of many of the elements one needs to build a system capable of commonsense thinking. No AI system contains all of them, though many contain more than a few of them. I am trying to put these elements together into a system in order to control a simulated robot.
I have implemented many of them using standard AI building blocks (recognize, compare, retrieve, etc.) I am working on a multiagent cognitive architecture to build them in, based on ideas from Marvin Minsky's Society of Mind theory, which is efficient, cooperative, and robust at responding to failures, but I will leave that discussion for another time. Nevertheless, I see many of the following elements as easily programmed in any architecture. This list of elements taken together implies a larger, more powerful architecture than the architecture that underlies it, so it is not clear how much it matters what the underlying architecture is.
One could probably go through the literature and find several hundred more elements. This list came from working on the problem of building a robot capable of movement and manipulation, and learning what techniques could be applied to solving the many problems that came up, and figuring out how to organize them into a single system.
Despite the large size of this list, I think building this architecture is only one percent of the big problem of building a system capable of commonsense thinking. There's a lot more you need to know, both in terms of how to think and what to think. And in the end, everyone has their own "thinking style", which no single, simple architecture will be able to encompass.

2. Basic Vocabulary of Objects for Artificial Intelligence
This system is "object oriented" in the sense that there are a standard set of objects which the agents use and manipulate. Here are some of the objects needed:

plan
manager
priority
options
sensor
difference
transition
goal
subgoal
situation
state
script

method
failure
impasse/handler
frame
transframe
k-line
paranome
polyneme
operator
constraint
object
event

property
relation
expectation
deviation
precondition
proposer
censor
advocate
critic
optimist
pessimist
predict

3. Mental Questions that Direct Common Sense Thinking
One way to control the direction of mental activity is by focusing on some set of questions. Of course, these questions do not need to be expressed in english, and may be expressed as queries in various internal representations. These questions initiate and prioritize inference processes that help answer them. Here are some of the questions a robot should always be asking itself:
What is going to happen next?
What would explain this?
What is the best thing for me to do now?
What objects are around me?
What is happening around me?
Have I seen that object before?
What can I learn from this event?
What can I learn from this failure?
How long will it take to perform this action?
What sorts of things might go wrong while performing this action?
What sorts of problems might occur, and how can I prepare for them?
Am I spending too much time on this problem?

4. Mental Agents for Common Sense Thinking
Some of these agents are simple IF-THEN-DO rules.
Some are more complex IF-THEN-DECIDE/SEARCH rules.
Some are really complex IF-THEN-FIGURE-OUT rules!
Tracking, Recognizing and Describing
given a partial state, try to find a frame that describes it (if you see a fridge and stove, think "kitchen")
given a situation, find a more abstract representation of it
given a description, find something additional to say about it
given an object for which a set of categories match, look for a feature that discriminates between them
binding problem: if an object might be the same as one seen before, impose temporal-behavioral constraints to verify
Goal Scheduling and Monitoring
given a goal that cannot seem to be achieved, give up on the goal
given a goal that cannot seem to be achieved, censor the goal
given a pair of goals, look for a causal chain that results in a conflict between them
given a pair of goals, prioritize them with respect to higher priority supergoals
given a goal, propose a set of subgoals to achieve it
given a goal, find the difference between it and the situation in order to characterize the problem
monitor for mania: believing you can achieve any goal
monitor for scattered feeling: too many goals are active at once
monitor for impatience: wanting too many things right away
monitor for depression: excessively critical of your actions and goals
checkpoint our mental state whenever something important happens
Plan Construction
given a problem, reset your mind state to an earlier state in which a similar problem was solved (k-lines)
given a problem, retrieve from memory an abstract plan to solve it
given a problem, try to chain a few methods to solve it
given a problem, look for different ways to solve that problem
given a plan, adapt it to the present situation
given a plan, adapt it to the present goal context
given a plan, check if you have tried it recently and it failed, and if so suppress it
given a primary goal and secondary goals, retrieve a plan that achieves primary but does not undo secondary
given a situation, look for methods you can execute
given a goal, look for methods that have been known to achieve it
given a method, look for ways to adapt it
given a plan, criticize the plan by finding another reason why it will fail
given a plan, justify the plan by finding another reason why it will work
given a script, generate a version of that script that monitors important conditions
given a plan to execute, assign monitors to its preconditions
given a method under consideration, check if the method is undoable
given a plan, estimate how long it will take
given a plan, predict what resources it will take and what goals it will undo
given a pair of plans that achieve the same goal, find some way to combine them into a better plan
given a plan that is strongly criticized, censor it
given a plan being constructed, add constraints one at a time
given a plan being constructed, prefer plans that are undoable
given that a plan cannot be adapted, raise an impasse
given that no plan can be retrieved, raise an impasse
given a set of subplans, combine them into a larger plan in which their mutual interactions are resolved
given a problem, try to find a simple problem that resembles it and try to solve the simple problem
Plan Selection
given two plans, compare them to see which is better
Plan Optimization
given a plan, look for a plan that is better than it in some regard, and try to improve it in that regard
given a plan, improve its reliability and speed and minimize its use of resources
given a plan, look for simple useful variations
Plan Parallelizing
given a set of plans, run them at the same time and monitor for interactions
Plan Verification
given a plan, try the plan in simulation
given a plan, consider the cost of failure of the plan
given a plan, check if its preconditions are satisfied
Plan Learning
given an applied method, note any deviations from expected effects
given a successful plan, try that plan in other situations and on other methods, to learn more about it
given a successful plan, save the plan to memory
given a successful plan, index the plan
Plan Execution and Monitoring
given a plan, execute it
given an executing plan, monitor if the actions do as expected
given an executing plan, check if its actions are taking too long
given an executing plan, suppress it if it is predicted it will achieve a dangerous state
Dealing with Planning Impasses
given a failed plan, try the plan in simulation at finer temporal grain
given a failed plan, try the plan in simulation while simulated more objects
given a failed plan, try the plan in simulation while simulating causes
given a failed plan, figure out which subaction didn't achieve its subgoal
given a failed plan, find or generate an alternate plan
given a failed plan, try another plan
given a failed plan, mutate the plan slightly in a way that worked before, and try again
given a failed plan that has been recently modified, regress to an earlier version of that plan
given a failed method, check if its preconditions are still satisfied
given a failed method, change a parameter of a method, like doing it harder or more smoothly
given a failed method, do some experiments to test the method
Prediction and Envisioning
given a situation, predict the next state by memory (using a transframe)
given a situation, predict the next state by dynamic simulation (like QSIM)
given a simulation, control its level of detail (which and how many objects and properties are simulated)
Expectation Failure
given an expectation failure, raise an impasse
given an object that behaves unexpectedly, try to explain it by seeing it in terms of other frame
Perceiving
given an object and a frame, look for a way to see an object in terms of the frame
given an object, look for unusual features
given a transframe, look for ways to see the current situation in terms of it
given an observed event, try to break it down into achievable subevents
given an object in the world, check if you saw it before
given a situation, recognize the general context (inside, outside, etc.)
Understanding and Explaining the Dynamic Situation
given an event, look for its cause
given a sequence of events, judge whether things are getting better or worse
given an unusual conclusion, verify it by trying to prove it another way
given a pair of situations, before and after, find a chain of events that links them
given a failure, look for another frame in terms of which to describe the situation
given an event, verify that it meets our expectations
Reasoning
given an assertion, assert its opposite and monitor for a contradiction
given a theory (a set of constraints), find an example from memory or in the environment
given a theory, find a counterexample from memory or in the environment
given a pair of theories, find analogies between them
given a pair of theories and a goal, find analogies between them with respect to the goal
given a property P, and P implies Q, then assume Q
given a property Q, and P implies Q, then check if P is true
given a pair of properties P and Q, if there is a constraint between those properties, verify the constraint
if there is a constraint failure between properties, verify the properties involved
given a failure of reasoning, describe the reasoning using your language machinery
given a failure of reasoning, reformulate by modifying your theory
Dealing with Reasoning Impasses
given a failure, look for a failed assumption
given a failure, look for a missing assumption
given an explanation, look for a weakness
given an X, criticize it
Learning and Abstracting
given a successful plan, save the trace of how it was derived
given a set of objects, look for a way to uniframe them
given a set of events, build a theory that explains the behavior
given an object, find a new frame that matches it
given a new object, construct a frame for it
given a new X, construct a frame for it
given a set of descriptions, find a way to unify them as variations of a single description
given an observed method, figure out how to copy it
given a failure, construct a critic that complains when it sees the potential to fail that way again
given a pair of correlated events, look for a causal dependency between them, and if found build transframe
given a plan of action or reasoning, generalize it by variablizing its elements
given a successful plan, take a snapshot of the mental state in which it was discovered (make a k-line)
Resource Management
given no more resource, replenish that resource (if out of fuel, go get more)
given no more resource, find another source of that resource (if fuel tank is empty, find another tank)
given a resource, see how much of that resource is left (check gauge in fuel tank)
given a function, find another way to achieve that function (you can also walk on your hands!)
Thinking for the Future (Daydreaming, Worrying)
given an anti-goal, build pessimists by thinking of ways we might get to that anti-goal
given a goal, build optimists by thinking of ways we might get to that goal
given a plan, look for subplans that can be extracted and usable in their own right, and index them
given a goal, make a list of the top 10 ways we might fail at that goal
Knowledge Management and Maintenance (Theories, Plans, etc.)
given a method, index it according to its effects
given a set of operators, find a reformulation of those operators that "orthogonalizes" them
given a pair of representations, look for an analogy
given a transframe, look for scripts that match it
given a pair of frames, find the differences between them
given a set of plans that achieve the same goal, index them so we can quickly jump between them
given a method, look for plans that can undo its effects
Multi-Agent Coordination
given a method, check if it interferes with the goals of the other agents
given a method, check if it might help other agents
if an agent notices another agent doing something that might help it, help that other agent do it
given a manager, look for ways in which its worker agents might interfere with one another
given a pair of interacting agents, debug the interaction one at a time
if a manager notices a set of agents working well together, consider them a team
Social Reasoning
given a person, guess at their goals from their actions
given a person model, simulate what they would do in some situation S
given a person model, simulate what they would think in some situation S
Language
given a sentence, generate some possible syntactic parses of it
given a sentence, generate some possible interpretations of it in other representations
given a word, check if you know what it means
given a sentence, record how the words in that sentence are used
given a sentence, determine its type (examples: question, asserting a truth, rhetorical statement)
given a desired mental state of a listener, generate a sentence that achieves that mental state (reduplication)
Vision
given a visual scene, track the objects in it
given one view of an object, retrieve other views of that object
given a view of an object, compute its contour
Comparing and Decision Making
given a set of options, consider the consequences of choosing them
Searching and Constraint Satisfaction
given lack of progress or cycling, declare an impasse
given a set of constraints between variables, look for a set of variable assignments that satisfy it
given a causal dependency, monitor that if the independent variable changes, then the dependent one changes
given bidirectional constraint between variables, monitor that if one changes so does the other one

5. Mental Representations for Common Sense Thinking
These agents operate on data structures that represent aspects of the world and of the mind of the robot itself. Here are some examples of the kinds of concepts robots will need. Each of these should be represented in multiple ways!
time : before, after, duration, sensed-at-time
temporal : repeating-event, sudden-event
methods : expensive, cheap, one-time, undoable
events : periodic, unspecified duration, momentary
shape : round, square, changing, has-holes
bodily : hand position, head position, orientation
spatial : boundaries, paths, holes
physical : solid, flexible, surfaces, connections
perceptual : occlusion, clarity, depth
geometric : above, near, inside, outside
goals : closer-to-goal, interacting-goals
resources : limbs-as-resource, time-as-resource
balance : center-of-mass, leaning-to-the-left
movement : moving-quickly, moving-sporadically
energy : expensive, cheap
difficulty : hard, easy

DouglasRMiles

2016-09-23T15:24:31Z

DouglasRMiles:

DouglasRMiles

2016-09-23T15:23:15Z

DouglasRMiles:

<gdoc id="1XCDnWMjNh4y2Um_1B-HE4x5Q34oxHRxBl-Oy9eNUzTI" />

----
[https://docs.google.com/document/d/1XCDnWMjNh4y2Um_1B-HE4x5Q34oxHRxBl-Oy9eNUzTI/edit#heading=h.uv71c9k7i3ck|Yak Shaving]

DouglasRMiles

2016-09-23T15:19:53Z

DouglasRMiles: Created page with "<gdoc id="1XCDnWMjNh4y2Um_1B-HE4x5Q34oxHRxBl-Oy9eNUzTI" /> ---- [https://docs.google.com/document/d/1XCDnWMjNh4y2Um_1B-HE4x5Q34oxHRxBl-Oy9eNUzTI/edit#heading=h.uv71c9k7i3ck]Y..."

<gdoc id="1XCDnWMjNh4y2Um_1B-HE4x5Q34oxHRxBl-Oy9eNUzTI" />

----
[https://docs.google.com/document/d/1XCDnWMjNh4y2Um_1B-HE4x5Q34oxHRxBl-Oy9eNUzTI/edit#heading=h.uv71c9k7i3ck]Yak Shaving