The screamer Reference Manual

Next: , Previous: , Up: (dir)   [Contents][Index]

The screamer Reference Manual

This is the screamer Reference Manual, version 4.0.0, generated automatically by Declt version 4.0 beta 2 "William Riker" on Thu Sep 15 06:06:47 2022 GMT+0.

Table of Contents


1 Introduction

-*- mode: text; mode: auto-fill; fill-column: 78 -*-

Screamer is an extension of Common Lisp that adds support for nondeterministic
programming. Screamer consists of two levels. The basic nondeterministic level
adds support for backtracking and undoable side effects. On top of this
nondeterministic substrate, Screamer provides a comprehensive constraint
programming language in which one can formulate and solve mixed systems of
numeric and symbolic constraints. Together, these two levels augment Common
Lisp with practically all of the functionality of both Prolog and constraint
logic programming languages such as CHiP and CLP(R). Furthermore, Screamer is
fully integrated with Common Lisp. Screamer programs can coexist and
interoperate with other extensions to as CLIM and Iterate.

In several ways Screamer is more efficient than other implementations of
backtracking languages. First, Screamer code is transformed into Common Lisp
which can be compiled by the underlying Common Lisp system. Many competing
implementations of nondeterministic Lisp are interpreters and thus are far
less efficient than Screamer. Second, the backtracking primitives require
fairly low overhead in Screamer. Finally, this overhead to support
backtracking is only paid for by those portions of the program which use the
backtracking primitives. Deterministic portions of user programs pass through
the Screamer-to-Common-Lisp transformation unchanged. Since in practise, only
small portions of typical programs utilize the backtracking primitives,
Screamer can produce more efficient code than compilers for languages in which
backtracking is more pervasive.

Screamer was written by Jeffrey Mark Siskind and David Allen McAllester, see
file LICENSE for licensing information.

This version of Screamer is based on released version 3.20, and is
being dragged kicking -- and screaming -- into the 21st century:

* Support for Symbolics, AKCL, etc. has been stripped.

* It has been modified to run in ANSI Common Lisp, as opposed to CLtL1/CLtL2.

* Ongoing maintenance work: original screamer.lisp has been split into
  package.lisp and screamer.lisp, ChangeLog.old, and some information
  has been moved over to TODO.

* Ongoing development and documentation work: a new manual is in the making,
  and add support for missing Common Lisp special forms in nondeterministic
  context is planned. ...the progress is rather glacial, however. Don't hold
  your breath.

See TODO for the current task list.

Source files part of the distribution not currently referenced in the
screamer.asd:

screams.lisp - A file containing all of the examples from the Screamer manual
and the two papers ircs-93-03 and aaai93. To use, first compile and load
Screamer and Iterate, compile and load this file, and then type
(IN-PACKAGE :SCREAMS).

equations.lisp - A file containing some equations for testing Screamer's
numeric constraint satisfaction procedures. To use, first compile and load
Screamer, compile and load this file, and then type (IN-PACKAGE :SCREAMS).

iscream.el - If you run Lisp on Unix under GNUEmacs using ILisp you can load
this Emacs Lisp file (preferably byte compiled first). You must also then
set the variable SCREAMER:*ISCREAM?* to T. This will enable the Screamer
macro LOCAL-OUTPUT and improve the behavior of Y-OR-N-P and PRINT-VALUES
under ILisp.

Subdirectory papers/ contains the original Screamer manual and papers:

screamer.pdf
screamer.dvi
screamer.ps - PDF, DVI, and Postscript versions of an outdated manual for
Screamer. The code in this manual has some bugs but corrected versions are
included in screams.lisp.

ircs-93-03.pdf
ircs-93-03.dvi
ircs-93-03.ps - PDF, DVI, and Postscript versions of a paper describing the
fundamentals of nondeterministic CommonLisp. This paper is available at
Technical Report 93-03 of the University of Pennsylvania Institute for
Research in Cognitive Science. The appropriate BibTeX entry is:
\newcommand{\Screamer}{{\mbox{\sc Screamer}}}
\newcommand{\CommonLisp}{{\mbox{\sc Common Lisp}}}
@string{IRCS = {University of Pennsylvania Institute for Research in Cognitive
	Science}}
@techreport{SiskindM93,
	author = {Jeffrey Mark Siskind and David Allen McAllester},
	title = {{\Screamer:} A Portable Efficient Implementation of
		Nondeterministic {\CommonLisp}},
	institution = IRCS,
	year = 1993,
        number = {IRCS--93--03}}
The code in this paper is included in screams.lisp.

aaai93.pdf
aaai93.dvi
aaai93.ps - PDF, DVI, and Postscript versions of a paper describing the
constraint package included with Screamer. This paper will appear in the
Proceedings of AAAI-93. The appropriate BibTeX entry is:
The code in this paper is also included in screams.lisp.
\newcommand{\Lisp}{{\mbox{\sc Lisp}}}
@string{AAAI93 = {Proceedings of the Eleventh National Conference on
	Artifical Intelligence}}
@inproceedings{SiskindM93a,
	author = {Jeffrey Mark Siskind and David Allen McAllester},
	title = {Nondeterministic {\Lisp} as a Substrate for Constraint Logic
		Programming},
	booktitle = AAAI93,
	year = 1993,
	month = jul}

Following are old notes regarding incompatibilities between Screamer 3.20 and
Screamer 2.4 (as eg. described in papers/screamer.ps):

Screamer 3.20 contains numerous bug fixes, performance enhancements and novel
features over Screamer 2.4, the prior widely released version. I do not have
the time to describe all such improvements. Until the completion of a new
Screamer manual you must resort to looking at the source code. At the beginning
of the file there is a fairly extensive change log.

A small number of incompatibilities have been introduced in the transition
from Screamer 2.4 to Screamer 3.20. These are summarized below. Those already
familiar with Screamer should have no difficulty modifying their code modulo
these changes.

1. All Screamer code must be recompiled. The Screamer 3.20 runtime is
incompatibile with the Screamer 2.4 compiler.

2. The function MAP-VALUES has been removed. An expression such as:
(MAP-VALUES function expression)
can be rewritten using the new FOR-EFFECTS macro as follows:
(FOR-EFFECTS (FUNCALL function expression))
The new syntax is every bit as powerful as the old syntax. In fact it is more
powerfull. MAP-VALUES used to require that the function argument be a
deterministic expression while the new syntax makes no such requirement. (Note
that FUNCALL still requires that its first argument evaluate to a deterministic
function.)

3. You no longer need to reload Screamer after doing an UNWEDGE-SCREAMER since
Screamer keeps track of which functions are intrinsic and UNWEDGE-SCREAMER
does not purge those functions.

4. The following functions have been renamed:
NUMBERV  -> NUMBERPV
REALV    -> REALPV
INTEGERV -> INTEGERPV
BOOLEANV -> BOOLEANPV
The original names were inconsistent with the naming convention that every
function ending in V names a lifted version of the function name without the V.
I.e. NUMBERV would have been a lifted version of a function NUMBER but there
is no ground function. NUMBERV was really a lifted version of NUMBERP and thus
should have been named NUMBERPV.

5. A new naming convention has been introduced. All nondeterministic
`generators' now begin with the prefix A- or AN-. This results in the
following name changes:
INTEGER-BETWEEN -> AN-INTEGER-BETWEEN
MEMBER-OF       -> A-MEMBER-OF
FLIP            -> A-BOOLEAN
Furthermore, `lifted generators' both begin with A- or AN- and end with V.
This results in the following name changes:
REAL-ABOVEV      -> A-REAL-ABOVEV
REAL-BELOWV      -> A-REAL-BELOWV
REAL-BETWEENV    -> A-REAL-BETWEENV
INTEGER-ABOVEV   -> AN-INTEGER-ABOVEV
INTEGER-BELOWV   -> AN-INTEGER-BELOWV
INTEGER-BETWEENV -> AN-INTEGER-BETWEENV

6. The variable *FUZZ* has been eliminated. The functionality of this variable
has been replaced by additional arguments to the REORDER function.

7. REORDER now takes four arguments:
(COST-FUNCTION TERMINATE? ORDER FORCE-FUNCTION)
instead of one. The FORCE-FUNCTION is the same as the prior lone argument.
The COST-FUNCTION is a function to be applied to each VARIABLE at each
reordering step to return its cost. Typical values for COST-FUNCTION are
#'DOMAIN-SIZE or #'RANGE-SIZE. The COST-FUNCTION can return NIL which causes
REORDER to not consider that variable for further forcing. ORDER is a two
argument predicate applied to the non-NIL cost functions computed for the
variables at each reordering step. Typical values are #'<, to choose the least
cost, and #'>, to choose the greatest cost variable to force next. TERMINATE?
is a one argument predicate applied to the (non-NIL) cost function computed
for the variable chosen to force next. If TERMINATE? returns T then the
variable reordering and forcing terminates. The following is a typical call
to REORDER used to solve numerical constraints:

(REORDER #'RANGE-SIZE
         #'(LAMBDA (X) (< X 1E-6))
         #'>
         #'DIVIDE-AND-CONQUER-FORCE)

The following is a typical call to REORDER used to solve symbolic constraints:

(REORDER #'DOMAIN-SIZE
         #'(LAMBDA (X) (DECLARE (IGNORE X)) NIL)
         #'<
         #'LINEAR-FORCE)

8. Instead of the standard Screamer file preamble which used to be:

(IN-PACKAGE :)
(USE-PACKAGE '(:LISP :SCREAMER))
(SHADOWING-IMPORT '(SCREAMER::DEFUN))

there is now a different standard preamble. Loading Screamer creates a
predefined package SCREAMER-USER which is useful for small student and
demonstration programs. If you wish your file to be in the SCREAMER-USER
package the single line:

(IN-PACKAGE :SCREAMER-USER)

should be placed at the top of the file. In addition:

(IN-PACKAGE :SCREAMER-USER)

should be typed to the Listener after loading Screamer. More complex programs
typically reside in their own package. You can place a program in its own
package by using the following preamble to your file:

(IN-PACKAGE :CL-USER)
(SCREAMER:DEFINE-SCREAMER-PACKAGE :
 )
(IN-PACKAGE :MY-PACKAGE)



2 Systems

The main system appears first, followed by any subsystem dependency.


Previous: , Up: Systems   [Contents][Index]

2.1 screamer

Nondeterministic programming and constraint propagation.

Maintainer

Nikodemus Siivola <nikodemus@random-state.net>

Author

Jeffrey Mark Siskind & David Allen McAllester

License

MIT

Version

4.0.0

Source

screamer.asd.

Child Components

3 Files

Files are sorted by type and then listed depth-first from the systems components trees.


Previous: , Up: Files   [Contents][Index]

3.1 Lisp


Next: , Previous: , Up: Lisp   [Contents][Index]

3.1.1 screamer/screamer.asd

Source

screamer.asd.

Parent Component

screamer (system).

ASDF Systems

screamer.


3.1.2 screamer/package.lisp

Source

screamer.asd.

Parent Component

screamer (system).

Packages

screamer.


Previous: , Up: Lisp   [Contents][Index]

3.1.3 screamer/screamer.lisp

Dependency

package.lisp (file).

Source

screamer.asd.

Parent Component

screamer (system).

Packages

screamer-user.

Public Interface
Internals

4 Packages

Packages are listed by definition order.


Next: , Previous: , Up: Packages   [Contents][Index]

4.1 screamer-user

Source

screamer.lisp.

Use List

Previous: , Up: Packages   [Contents][Index]

4.2 screamer

Source

package.lisp.

Use List

common-lisp.

Used By List

screamer-user.

Public Interface
Internals

5 Definitions

Definitions are sorted by export status, category, package, and then by lexicographic order.


Next: , Previous: , Up: Definitions   [Contents][Index]

5.1 Public Interface


Next: , Previous: , Up: Public Interface   [Contents][Index]

5.1.1 Special variables

Special Variable: *dynamic-extent?*

Set to T to enable the dynamic extent optimization, NIL to disable it. Default is platform dependent.

Package

screamer.

Source

screamer.lisp.

Special Variable: *iscream?*

T if Screamer is running under ILisp/GNUEmacs with iscream.el loaded.

Package

screamer.

Source

screamer.lisp.

Special Variable: *maximum-discretization-range*

Discretize integer variables whose range is not greater than this number. Discretize all integer variables if NIL. Must be an integer or NIL.

Package

screamer.

Source

screamer.lisp.

Special Variable: *minimum-shrink-ratio*

Ignore propagations which reduce the range of a variable by less than this ratio.

Package

screamer.

Source

screamer.lisp.

Special Variable: *screamer-version*

The version of Screamer which is loaded.

Package

screamer.

Source

screamer.lisp.

Special Variable: *strategy*

Strategy to use for FUNCALLV and APPLYV. Either :GFC for Generalized Forward Checking, or :AC for Arc Consistency. Default is :GFC.

Package

screamer.

Source

screamer.lisp.


5.1.2 Macros

Macro: all-values (&body body)

Evaluates BODY as an implicit PROGN and returns a list of all of the nondeterministic values yielded by the it.

These values are produced by repeatedly evaluating the body and backtracking to produce the next value, until the body fails and yields no further values.

Accordingly, local side effects performed by the body while producing each value are undone before attempting to produce subsequent values, and all local side effects performed by the body are undone upon exit from ALL-VALUES.

Returns a list containing NIL if BODY is empty.

An ALL-VALUES expression can appear in both deterministic and nondeterministic contexts. Irrespective of what context the ALL-VALUES appears in, the BODY is always in a nondeterministic context. An ALL-VALUES expression itself is always deterministic.

ALL-VALUES is analogous to the ‘bagof’ primitive in Prolog.

Package

screamer.

Source

screamer.lisp.

Macro: assert! (x)

Restricts X to T. No meaningful result is returned. The argument X can be either a variable or a non-variable.

This assertion may cause other assertions to be made due to noticers attached to X.

A call to ASSERT! fails if X is known not to equal T prior to the assertion or if any of the assertions performed by the noticers result in failure.

Except for the fact that one cannot write #’ASSERT!, ASSERT! behaves like a function, even though it is implemented as a macro.

The reason it is implemented as a macro is to allow a number of compile time optimizations. Expressions like (ASSERT! (NOTV X)), (ASSERT! (NUMBERPV X)) and (ASSERT! (NOTV (NUMBERV X))) are transformed into calls to functions internal to Screamer which eliminate the need to create the boolean variable(s) normally returned by functions like NOTV and NUMBERPV. Calls to the functions NUMBERPV, REALPV, INTEGERPV, MEMBERV, BOOLEANPV, =V, <V, <=V, >V, >=V, /=V, NOTV, FUNCALLV, APPLYV and EQUALV which appear directly nested in a call to ASSERT!, or directly nested in a call to NOTV which is in turn directly nested in a call to ASSERT!, are similarly transformed.

Package

screamer.

Source

screamer.lisp.

Macro: best-value (form1 objective-form &optional form2)

First evaluates OBJECTIVE-FORM, which should evaluate to constraint variable V.

Then repeatedly evaluates FORM1 in non-deterministic context till it fails. If previous round of evaluation produced an upper bound B for V, the during the next round any change to V must provide an upper bound higher than B, or that that change fails.

If the last successful evaluation of FORM produced an upper bound for V, returns a list of two elements: the the primary value of FORM1 from that round, and the upper bound of V.

Otherwise if FORM2 is provided, returns the result of evaluating it, or else calls fails.

Note: this documentation string is entirely reverse-engineered. Lacking information on just how BEST-VALUE was intended to work, it is hard to tell what is a bug, an accident of implementation, and what is a feature. If you have any insight into BEST-VALUE, please send email to nikodemus@random-state.net.

Package

screamer.

Source

screamer.lisp.

Macro: count-failures (&body body)

Executes BODY keeping track of the number of times FAIL has been called without unwinding from BODY. After BODY completes, reports the number of failures to *STANDARD-OUTPUT* before returning values from BODY.

Package

screamer.

Source

screamer.lisp.

Macro: decide (x)

Restricts X to a be boolean. After X is restricted a nondeterministic choice is made. For one branch, X is restricted to equal T and (DECIDE X) returns T as a result. For the other branch, X is restricted to equal NIL and (DECIDE X) returns NIL as a result. The argument X can be either a variable or a non-variable.

The initial restriction to boolean may cause other assertions to be made due to noticers attached to X. A call to DECIDE immediately fails if X is known not to be boolean prior to the assertion or if any of the assertions performed by the noticers result in failure.

Restricting X to be boolean attaches a noticer on X so that any subsequent assertion which restricts X to be non-boolean will fail.

Except for implementation optimizations (DECIDE X) is equivalent to:

(EITHER (PROGN (ASSERT! X) T) (PROGN (ASSERT! (NOTV X)) NIL))

Except for the fact that one cannot write #’DECIDE, DECIDE behaves like a function, even though it is implemented as a macro.

The reason it is implemented as a macro is to allow a number of compile time optimizations. Expressions like (DECIDE (NOTV X)), (DECIDE (NUMBERPV X)) and (DECIDE (NOTV (NUMBERPV X))) are transformed into calls to functions internal to Screamer which eliminate the need to create the boolean variable(s) normally returned by functions like notv and numberv. Calls to the functions NUMBERPV, REALPV, INTEGERPV, MEMBERPV, BOOLEANPV, =V, <V, <=V, >V, >=V, /=V, NOTV, FUNCALLV, APPLYV and EQUALV which appear directly nested in a call to decide, or directly nested in a call to NOTV which is in turn directly nested in a call to decide, are similarly transformed.

Package

screamer.

Source

screamer.lisp.

Macro: define-screamer-package (defined-package-name &body options)

Convenience wrapper around DEFPACKAGE. Passes its argument directly
to DEFPACKAGE, and automatically injects two additional options:

(:shadowing-import-from :screamer :defun :multiple-value-bind :y-or-n-p) (:use :cl :screamer)

Package

screamer.

Source

screamer.lisp.

Macro: either (&body alternatives)

Nondeterministically evaluates and returns the value of one of its ALTERNATIVES.

EITHER takes any number of arguments. With no arguments, (EITHER) is equivalent to (FAIL) and is thus deterministic. With one argument, (EITHER X) is equivalent to X itself and is thus deterministic only when X is deterministic. With two or more argument it is nondeterministic and can only appear in a nondeterministic context.

It sets up a choice-point and evaluates the first ALTERNATIVE returning its values. When backtracking follows to this choice-point, the next ALTERNATIVE is evaluated and its values are returned. When no more ALTERNATIVES remain, the current choice-point is removed and backtracking continues to the next most recent choice-point.

Package

screamer.

Source

screamer.lisp.

Macro: for-effects (&body body)

Evaluates BODY as an implicit PROGN in a nondeterministic context and returns NIL.

The body is repeatedly backtracked to its first choice-point until the body fails.

Local side effects performed by BODY are undone when FOR-EFFECTS returns.

A FOR-EFFECTS expression can appear in both deterministic and nondeterministic contexts. Irrespective of what context the FOR-EFFECTS appears in, BODY are always in a nondeterministic context. A FOR-EFFECTS expression is is always deterministic.

Package

screamer.

Source

screamer.lisp.

Macro: global (&body body)

Evaluates BODY in the same fashion as PROGN except that all SETF and SETQ forms lexically nested in its body result in global side effects which are not undone upon backtracking.

Note that this affects only side effects introduced explicitly via SETF and SETQ. Side effects introduced by Common Lisp builtin functions such as RPLACA are always global anyway.

LOCAL and GLOBAL may be nested inside one another. The nearest lexically surrounding one determines whether or not a given SETF or SETQ results in a local or global side effect.

Side effects default to be global when there is no surrounding LOCAL or GLOBAL expression. Global side effects can appear both in deterministic as well as nondeterministic contexts. In nondeterministic contexts, GLOBAL as well as SETF are treated as special forms rather than macros. This should be completely transparent to the user.

Package

screamer.

Source

screamer.lisp.

Macro: ith-value (i form &optional default)

Returns the Ith nondeterministic value yielded by FORM.

I must be an integer. The first nondeterministic value yielded by FORM is numbered zero, the second one, etc. The Ith value is produced by repeatedly evaluating FORM, backtracking through and discarding the first I values and deterministically returning the next value produced.

No further execution of FORM is attempted after it successfully yields the desired value.

If FORM fails before yielding both the I values to be discarded, as well as the desired Ith value, then DEFAULT is evaluated and its value returned instead. DEFAULT defaults to (FAIL) if not present.

Local side effects performed by FORM are undone when ITH-VALUE returns, but local side effects performed by DEFAULT and by I are not undone when ITH-VALUE returns.

An ITH-VALUE expression can appear in both deterministic and nondeterministic contexts. Irrespective of what context the ITH-VALUE appears in, FORM is always in a nondeterministic context, while DEFAULT and I are in whatever context the ITH-VALUE appears in.

An ITH-VALUE expression is nondeterministic if DEFAULT is present and is nondeterministic, or if I is nondeterministic. Otherwise it is deterministic.

If DEFAULT is present and nondeterministic, and if FORM fails, then it is possible to backtrack into the DEFAULT and for the ITH-VALUE expression to nondeterministically return multiple times.

If I is nondeterministic then the ITH-VALUE expression operates nondeterministically on each value of I. In this case, backtracking for each value of FORM and DEFAULT is nested in, and restarted for, each backtrack of I.

Package

screamer.

Source

screamer.lisp.

Macro: known? (x)

Restricts X to be a boolean. If X is equal to T after being restricted to be boolean, returns T. If X is equal to NIL or if the value of X is unknown returns NIL. The argument X can be either a variable or a non-variable.

The initial restriction to boolean may cause other assertions to be made due to noticers attached to X. A call to KNOWN? fails if X is known not to be boolean prior to the assertion or if any of the assertions performed by the noticers result in failure.

Restricting X to be boolean attaches a noticer on X so that any subsequent assertion which restricts X to be non-boolean will fail.

Except for the fact that one cannot write #’KNOWN?, KNOWN? behaves like a function, even though it is implemented as a macro.

The reason it is implemented as a macro is to allow a number of compile time optimizations. Expressions like (KNOWN? (NOTV X)), (KNOWN? (NUMBERPV X)) and (KNOWN? (NOTV (NUMBERPV X))) are transformed into calls to functions internal to Screamer which eliminate the need to create the boolean variable(s) normally returned by functions like NOTV and NUMBERV. Calls to the functions NUMBERPV, REALPV, INTEGERPV, MEMBERV, BOOLEANPV, =V, <V, <=V, V, >=v, /=v, NOTV, FUNCALLV, APPLYV and EQUALV which appear directly nested in a call to KNOWN?, or directly nested in a call to NOTV which is in turn directly nested in a call to KNOWN?, are similarly transformed.

Package

screamer.

Source

screamer.lisp.

Macro: local (&body body)

Evaluates BODY in the same fashion as PROGN except that all SETF and SETQ forms lexically nested in its body result in local side effects which are undone upon backtracking.

This affects only side effects introduced explicitly via SETF and SETQ. Side effects introduced by either user defined functions or builtin Common Lisp functions such as RPLACA are always global.

Behaviour of side effects introduced by macro-expansions such as INCF depends on the exact macro-expansion. If (INCF (FOO)) expands using eg. SET-FOO, LOCAL is unable to undo the side-effect.

LOCAL cannot distinguish between initially uninitialized and intialized places, such as unbound variables or hash-table keys with no prior values. As a result, an attempt to assign an unbound variable inside LOCAL will signal an error due to the system’s attempt to first read the variable. Similarly, undoing a (SETF GETHASH) when the key did not previously exist in the table will insert a NIL into the table instead of doing a REMHASH. Easiest way to work around this is by using TRAIL.

LOCAL and GLOBAL may be nested inside one another. The nearest lexically surrounding one determines whether or not a given SETF or SETQ results in a local or global side effect.

Side effects default to be global when there is no surrounding LOCAL or GLOBAL expression. Local side effects can appear both in deterministic as well as nondeterministic contexts though different techniques are used to implement the trailing of prior values for restoration upon backtracking. In nondeterministic contexts, LOCAL as well as SETF are treated as special forms rather than macros. This should be completely transparent to the user.

Package

screamer.

Source

screamer.lisp.

Macro: local-output (&body forms)

Currently unsupported.

When running under ILisp with iscream.el loaded, does non-determinism aware output to Emacs, which will be deleted when the current choice is unwound.

Package

screamer.

Source

screamer.lisp.

Macro: necessarily? (&body body)

Evaluates BODY as an implicit PROGN in nondeterministic context,
returning true if the body never yields false.

The body is repeatedly backtracked as long as it yields true. Returns the last true value yielded by the body if it fails before yielding NIL, otherwise returns NIL.

Local side effects performed by the body are undone when NECESSARILY? returns.

A NECESSARILY? expression can appear in both deterministic and nondeterministic contexts. Irrespective of what context the NECESSARILY? appears in, its body is always in a nondeterministic context. A NECESSARILY? expression is always deterministic.

Package

screamer.

Source

screamer.lisp.

Macro: one-value (form &optional default)

Returns the first nondeterministic value yielded by FORM.

No further execution of FORM is attempted after it successfully returns one value.

If FORM does not yield any nondeterministic values (i.e. it fails) then DEFAULT is evaluated and its value returned instead. DEFAULT defaults to (FAIL) if not present.

Local side effects performed by FORM are undone when ONE-VALUE returns, but local side effects performed by DEFAULT are not undone when ONE-VALUE returns.

A ONE-VALUE expression can appear in both deterministic and nondeterministic contexts. Irrespective of what context the ONE-VALUE appears in, FORM is always in a nondeterministic context, while DEFAULT is in whatever context the ONE-VALUE form appears.

A ONE-VALUE expression is nondeterministic if DEFAULT is present and is nondeterministic, otherwise it is deterministic.

If DEFAULT is present and nondeterministic, and if FORM fails, then it is possible to backtrack into the DEFAULT and for the ONE-VALUE form to nondeterministically return multiple times. ONE-VALUE is analogous to the cut primitive (‘!’) in Prolog.

Package

screamer.

Source

screamer.lisp.

Macro: possibly? (&body body)

Evaluates BODY as an implicit PROGN in nondeterministic context, returning true if the body ever yields true.

The body is repeatedly backtracked as long as it yields NIL. Returns
the first true value yielded by the body, or NIL if body fails before yielding true.

Local side effects performed by the body are undone when POSSIBLY? returns.

A POSSIBLY? expression can appear in both deterministic and nondeterministic contexts. Irrespective of what context the POSSIBLY? appears in, its body is always in a nondeterministic context. A POSSIBLY? expression is always deterministic.

Package

screamer.

Source

screamer.lisp.

Macro: print-values (&body body)

Evaluates BODY as an implicit PROGN and prints each of the nondeterministic values yielded by it using PRINT.

After each value is printed, the user is queried as to whether or not further values are desired. These values are produced by repeatedly evaluating the body and backtracking to produce the next value, until either the user indicates that no further values are desired or until the body fails and yields no further values.

Returns the last value printed.

Accordingly, local side effects performed by the body while producing each value are undone after printing each value, before attempting to produce subsequent values, and all local side effects performed by the body are undone upon exit from PRINT-VALUES, either because there are no further values or because the user declines to produce further values.

A PRINT-VALUES expression can appear in both deterministic and nondeterministic contexts. Irrespective of what context the PRINT-VALUES appears in, the BODY are always in a nondeterministic context. A PRINT-VALUES expression itself is always deterministic.

PRINT-VALUES is analogous to the standard top-level user interface in Prolog.

Package

screamer.

Source

screamer.lisp.

Macro: when-failing ((&body failing-forms) &body body)

Whenever FAIL is called during execution of BODY, executes FAILING-FORMS before unwinding.

Package

screamer.

Source

screamer.lisp.


5.1.3 Ordinary functions

Function: *v (&rest xs)

Constrains its arguments to be numbers. If called with no arugments, returns 1. If called with a single argument, returns its value. If called with more than two arguments, behaves as nested sequence of two-argument calls:

(*V X1 X2 ... Xn) = (*V X1 (*V X2 (*V ...)))

When called with two arguments, if both arguments are bound, returns the product of their values. If either argument is known to equal zero, returns zero. If either argument is known to equal one, returns the value of the other. Otherwise returns number variable V.

* Product of X1 and X2 is constrained to equal V. This includes constraining their bounds appropriately. If it becomes known that cannot be true, FAIL is called.

* If both arguments are known to be reals, V is constrained to be real.

* If both arguments are known to be integers, V is constained to be integer.

* If V is known to be an integer, and either X1 or X2 is known to be real, both X1 and X2 are constrained to be integers.

* If V is known to be an reals, and either X1 or X2 is known to be real, both X1 and X2 are constrained to be reals.

Note: Numeric contagion rules of Common Lisp are not applied if either argument equals zero or one.

Package

screamer.

Source

screamer.lisp.

Function: +v (&rest xs)

Constrains its arguments to be numbers. Returns 0 if called with no arguments. If called with a single argument, returns its value. If called with more than two arguments, behaves as nested sequence of two-argument calls:

(+V X1 X2 ... Xn) = (+V X1 (+V X2 (+V ...)))

When called with two arguments, if both arguments are bound, returns the sum of their values. If either argument is known to be zero, returns the value of the remaining argument. Otherwise returns number variable V.

* Sum of X1 and X2 is constrained to equal V. This includes constraining their bounds appropriately. If it becomes known that cannot be true, FAIL is called.

* If both arguments are known to be reals, V is constrained to be real.

* If both arguments are known to be integers, V is constained to be integer.

* If one argument is known to be a non-integer, and the other is known to be a real, V is constrained to be a non-integer.

* If one argument is known to be a non-real, and the other is known
to be a real, V is constrained to be non-real.

Note: Numeric contagion rules of Common Lisp are not applied if either argument equals zero.

Package

screamer.

Source

screamer.lisp.

Function: -v (x &rest xs)

Constrains its arguments to be numbers. If called with a single argument, behaves as if the two argument call:

(-V 0 X)

If called with more than two arguments, behaves as nested sequence of two-argument calls:

(-V X1 X2 ... Xn) = (-V X1 (-V X2 (-V ...)))

When called with two arguments, if both arguments are bound, returns the difference of their values. If X2 is known to be zero, returns the value of X1. Otherwise returns number variable V.

* Difference of X1 and X2 is constrained to equal V. This includes constraining their bounds appropriately. If it becomes known that cannot be true, FAIL is called.

* If both arguments are known to be reals, V is constrained to be real.

* If both arguments are known to be integers, V is constained to be integer.

* If one argument is known to be a non-integer, and the other is known to be a real, V is constrained to be a non-integer.

* If one argument is known to be a non-real, and the other is known
to be a real, V is constrained to be non-real.

Note: Numeric contagion rules of Common Lisp are not applied if X2 equals zero.

Package

screamer.

Source

screamer.lisp.

Function: /=v (x &rest xs)

Returns a boolean value which is constrained to be T if no two arguments are numerically equal, and constrained to be NIL if any two or more arguments are numerically equal.

This function takes one or more arguments. All of the arguments are restricted to be numeric.

Returns T when called with one argument. A call such as (/=V X1 X2 ... Xn) with more than two arguments behaves like a conjunction of two argument calls:

(ANDV (/=V X1 X2) ... (/=V X1 Xn)
(/=V X2 X3) ... (/=V X2 Xn)
...
(/=V Xi Xi+1 ... (/=V Xi Xn)
...
(/=V Xn-1 xn))

When called with two arguments, returns T if X1 is known not to be equal to X2 at the time of call, NIL if X1 is known to be equal to X2 at the time of call, and otherwise a new boolean variable V.

Two numeric values are known not to be equal when their domains are disjoint.

Two real values are known not to be equal when their ranges are disjoint, i.e. the upper bound of one is greater than the lower bound of the other.

Two numeric values are known to be equal only when they are both bound and equal according to the Common Lisp function =.

When a new variable is created, the values of X1, X2 and V are mutually constrained via noticers so that V is equal to T if and only if X1 is known not to be equal to X2 and V is equal to NIL if and only if X1 is known to be equal to X2.

* If it later becomes known that X1 is not equal to X2, noticers attached to X1 and X2 restrict V to equal T. Likewise, if it later becomes known that X1 is equal to X2, noticers attached to X1 and X2 restrict V to equal NIL.

* If V ever becomes known to equal T then a noticer attached to V restricts X1 to not be equal to X2. Likewise, if V ever becomes known to equal NIL then a noticer attached to V restricts X1 to be equal to X2.

Restricting two values X1 and X2 to be equal is performed by attaching noticers to X1 and X2. These noticers continually restrict the domains of X1 and X2 to be equivalent sets (using the Common Lisp function = as a test function) as their domains are restricted. Furthermore, if X1 is known to be real then the noticer attached to X2 continually restrict the upper bound of X1 to be no higher than the upper bound of X2 and the lower bound of X1 to be no lower than the lower bound of X2. The noticer of X2 performs a symmetric restriction on the bounds of X1 if it is known to be real.

Restricting two values X1 and X2 to not be equal is also performed by attaching noticers to X1 and X2. These noticers however, do not restrict the domains or ranges of X1 or X2. They simply monitor their continually restrictions and fail when any assertion causes X1 to be known to be equal to X2.

Package

screamer.

Source

screamer.lisp.

Function: /v (x &rest xs)

Constrains its arguments to be numbers. If called with a single argument, behaves as the two argument call:

(/V 1 X)

If called with more than two arguments, behaves as nested sequence of two-argument calls:

(/V X1 X2 ... Xn) = (/V ... (/V (/V X1 X2) X3) ... Xn)

When called with two arguments, if both arguments are bound, returns the division of their values. If X1 is known to equal zero, returns 0. If X2 is known to equal zero, FAIL is called. If X2 is known to equal one, returns the value of X1. Otherwise returns number variable V.

* Division of X1 and X2 is constrained to equal V. This includes constraining their bounds appropriately. If it becomes known that cannot be true, FAIL is called.

* If both arguments are known to be reals, V is constrained to be real.

* If both arguments are known to be integers, V is constained to be integer.

* If V is known to be an integer, and either X1 or X2 is known to be real, both X1 and X2 are constrained to be integers.

* If V is known to be an reals, and either X1 or X2 is known to be real, both X1 and X2 are constrained to be reals.

Note: Numeric contagion rules of Common Lisp are not applied if X1 equals zero or X2 equals one.

Package

screamer.

Source

screamer.lisp.

Function: <=v (x &rest xs)

All arguments are constrained to be real. Returns T when called with one
argument. A call such as (<=V X1 X2 ... Xn) with more than two arguments
behaves like a conjunction of two argument calls:

(ANDV (<=V X1 X2) ... (<=V Xi Xi+1) ... (<=V Xn-1 Xn))

When called with two arguments, returns T if X1 is know to be less than or equal to X2 at the time of the call, NIL if X1 is known to be greater than X2, and otherwise a new boolean variable V.

Values of V, X1, and X2 are mutually constrained:

* V is equal to T iff X1 is known to be less than or equal to X2.

* V is equal to NIL iff X2 is known to be greater than X2.

* If V is known to be T, X1 is constrained to be less than or equal to X2.

* If V is known to be NIL, X1 is constrained to be greater than X2.

Package

screamer.

Source

screamer.lisp.

Function: <v (x &rest xs)

Returns a boolean value which is constrained to be T if each argument Xi is less than the following argument Xi+1 and constrained to be NIL if some argument Xi is greater than or equal to the following argument Xi+1.

This function takes one or more arguments. All of the arguments are restricted to be real.

Returns T when called with one argument. A call such as (<V X1 X2 ... Xn) with more than two arguments behaves like a conjunction of two argument calls:

(ANDV (<V X1 X2) ... (<V Xi Xi+1 ) ... (<V Xn-1 Xn))

When called with two arguments, returns T if X1 is known to be less than X2 at the time of call, NIL if X1 is known to be greater than or equal to X2 at the time of call, and otherwise a new boolean variable V.

A real value X1 is known to be less than a real value X2 if X1 has an upper bound, X2 has a lower bound and the upper bound of X1 is less than the lower bound of X2.

A real value X1 is known to be greater than or equal to a real value X2 if X1 has a lower bound, X2 has an upper bound and the lower bound of X1 is greater than or equal to the upper bound of X2.

When a new variable is created, the values of X1, X2 and v are mutually constrained via noticers so that V is equal to T if and only if X1 is known to be less than X2 and V is equal to NIL if and only if X1 is known to be greater than or equal to X2.

* If it later becomes known that X1 is less than X2, noticers attached to X1 and X2 restrict V to equal T. Likewise, if it later becomes known that X1 is greater than or equal to X2, noticers attached to X1 and X2 restrict V to equal NIL.

* If V ever becomes known to equal T then a noticer attached to V restricts X1 to be less than X2. Likewise, if V ever becomes known to equal NIL then a noticer attached to V restricts X1 to be greater than or equal to X2.

Restricting a real value X1 to be less than a real value X2 is performed by attaching noticers to X1 and X2. The noticer attached to X1 continually restricts the lower bound of X2 to be no lower than the upper bound of X1 if X1 has an upper bound. The noticer attached to X2 continually restricts the upper bound of X1 to be no higher than the lower bound of X2 if X2 has a lower bound. Since these restrictions only guarantee that X1 be less than or equal to X2, the constraint that X1 be strictly less than X2 is enforced by having the noticers fail when both X1 and X2 become known to be equal.

Restricting a real value X1 to be greater than or equal to a real value X2 is performed by an analogous set of noticers without this last equality check.

Package

screamer.

Source

screamer.lisp.

Function: =v (x &rest xs)

Returns a boolean value which is constrained to be T if all of the arguments are numerically equal, and constrained to be NIL if two or more of the arguments numerically differ.

This function takes one or more arguments. All of the arguments are restricted to be numeric.

Returns T when called with one argument. A call such as (=V X1 X2 ... Xn) with more than two arguments behaves like a conjunction of two argument calls:

(ANDV (=V X1 X2) ... (=V Xi Xi+1) ... (=V Xn-1 Xn))

When called with two arguments, returns T if X1 is known to be equal to X2 at the time of call, NIL if X1 is known not to be equal to X2 at the time of call, and a new boolean variable V if is not known if the two values are equal.

Two numeric values are known to be equal only when they are both bound and equal according to the Common Lisp function =.

Two numeric values are known not to be equal when their domains are disjoint. Furthermore, two real values are known not to be equal when their ranges are disjoint, i.e. the upper bound of one is greater than the lower bound of the other.

When a new variable is created, the values of X1, X2, and V are mutually constrained via noticers so that V is equal to T if and only if X1 is known to be equal to X2, and V is equal to NIL if and only if X1 is known not to be equal to X2.

* If it later becomes known that X1 is equal to X2 noticers attached to X1 and X2 restrict V to equal T. Likewise if it later becomes known that X1 is not equal to X2 noticers attached to X1 and X2 restrict V to equal NIL.

* If V ever becomes known to equal T then a noticer attached to V restricts X1 to be equal to X2. Likewise if V ever becomes known to equal NIL then a noticer attached to V restricts X1 not to be equal to X2.

* If X1 is known to be real then the noticer attached to X2 continually restrict the upper bound of X1 to be no higher than the upper bound of X2 and the lower bound of X1 to be no lower than the lower bound of X2. Likewise for bounds of X1 if X2 is known to be real.

Restricting two values x1 and x2 to be equal is performed by attaching noticers to x1 and x2. These noticers continually restrict the domains of x1 and x2 to be equivalent sets (using the Common Lisp function = as a test function) as their domains are restricted.

Restricting two values X1 and X2 to not be equal is also performed by attaching noticers to X1 and X2. These noticers however do not restrict the domains or ranges of X1 or X2. They simply monitor their continually restrictions and fail when any assertion causes X1 to be known to be equal to X2.

Package

screamer.

Source

screamer.lisp.

Function: >=v (x &rest xs)

All arguments are constrained to be real. Returns T when called
with one argument. A call such as (>=V X1 X2 ... Xn) with more than two arguments behaves like a conjunction of two argument calls:

(ANDV (>=V X1 X2) ... (>=V Xi Xi+1) ... (>=V Xn-1 Xn))

When called with two arguments, returns T if X1 is know to be greater than or equal to X2 at the time of the call, NIL if X1 is known to be less than X2, and otherwise a new boolean variable V.

Values of V, X1, and X2 are mutually constrained:

* V is equal to T iff X1 is known to be greater than or equal to X2.

* V is equal to NIL iff X2 is know to be less than X2.

* If V is known to be T, X1 is constrained to be greater than or equal to X2.

* If V is known to be NIL, X1 is constrained to be less than X2.

Package

screamer.

Source

screamer.lisp.

Function: >v (x &rest xs)

All arguments are constrained to be real. Returns T when called with one argument. A call such as (>V X1 X2 ... Xn) with more than two arguments behaves like a conjunction of two argument calls:

(ANDV (> X1 X2) ... (> Xi Xi+1) ... (> Xn-1 Xn))

When called with two arguments, returns T if X1 is know to be greater than X2 at the time of the call, NIL if X1 is known to be less than or equal to X2, and otherwise a new boolean variable V.

Values of V, X1, and X2 are mutually constrained:

* V is equal to T iff X1 is known to be greater than X2.

* V is equal to NIL iff X2 is known to be less than or equal to X2.

* If V is known to be T, X1 is constrained to be greater than X2.

* If V is known to be NIL, X1 is constrained to be less than or equal to X2.

Package

screamer.

Source

screamer.lisp.

Function: a-boolean ()

Equivalent to (EITHER T NIL).

Package

screamer.

Source

screamer.lisp.

Function: a-booleanv (&optional name)

Returns a boolean variable.

Package

screamer.

Source

screamer.lisp.

Function: a-member-of (sequence)

Nondeterministically returns an element of SEQUENCE. The elements are returned in the order that they appear in SEQUENCE. The SEQUENCE must be either a list or a vector.

Package

screamer.

Source

screamer.lisp.

Function: a-member-ofv (values &optional name)

Returns a variable whose value is constrained to be one of VALUES. VALUES can be either a vector or a list designator.

Package

screamer.

Source

screamer.lisp.

Function: a-numberv (&optional name)

Returns a variable whose value is constained to be a number.

Package

screamer.

Source

screamer.lisp.

Function: a-real-abovev (low &optional name)

Returns a real variable whose value is constrained to be greater than or equal to LOW.

Package

screamer.

Source

screamer.lisp.

Function: a-real-belowv (high &optional name)

Returns a real variable whose value is constrained to be less than or equal to HIGH.

Package

screamer.

Source

screamer.lisp.

Function: a-real-betweenv (low high &optional name)

Returns a real variable whose value is constrained to be greater than or equal to low and less than or equal to high. If the resulting real variable is bound, its value is returned instead. Fails if it is known that low is greater than high at the time of call.

The expression (A-REAL-BETWEENV LOW HIGH) is an abbreviation for:

(LET ((V (MAKE-VARIABLE)))
(ASSERT! (REALPV V))
(ASSERT! (>=V V LOW))
(ASSERT! (<=V V HIGH))
(VALUE-OF V))

Package

screamer.

Source

screamer.lisp.

Function: a-realv (&optional name)

Returns a real variable.

Package

screamer.

Source

screamer.lisp.

Function: an-integer ()

Generator yielding integers in sequence 0, 1, -1, 2, -2, ...

Package

screamer.

Source

screamer.lisp.

Function: an-integer-above (low)

Generator yielding integers starting from LOW and continuing sequentially in increasing direction.

Package

screamer.

Source

screamer.lisp.

Function: an-integer-abovev (low &optional name)

Returns an integer variable whose value is constrained to be greater than or equal to LOW.

Package

screamer.

Source

screamer.lisp.

Function: an-integer-below (high)

Generator yielding integers starting from HIGH and continuing sequentially in decreasing direction.

Package

screamer.

Source

screamer.lisp.

Function: an-integer-belowv (high &optional name)

Returns an integer variable whose value is constrained to be less than or equal to HIGH.

Package

screamer.

Source

screamer.lisp.

Function: an-integer-between (low high)

Nondeterministically returns an integer in the closed interval [LOW, HIGH]. The results are returned in ascending order. Both LOW and HIGH must be integers. Fails if the interval does not contain any integers.

Package

screamer.

Source

screamer.lisp.

Function: an-integer-betweenv (low high &optional name)

Returns an integer variable whose value is constrained to be greater than or equal to LOW and less than or equal to HIGH. If the resulting integer variable is bound, its value is returned instead. Fails if it is known that there is no integer between LOW and HIGH at the time of call.

The expression (AN-INTEGER-BETWEENV LOW HIGH) is an abbreviation for:

(LET ((V (MAKE-VARIABLE)))
(ASSERT! (INTEGERPV V))
(ASSERT! (>=V V LOW))
(ASSERT! (<=V V HIGH))
(VALUE-OF v))

Package

screamer.

Source

screamer.lisp.

Function: an-integerv (&optional name)

Returns an integer variable.

Package

screamer.

Source

screamer.lisp.

Function: andv (&rest xs)

Restricts each argument to be boolean.

Returns T if called with no arguments, or if all arguments are known to equal T after being restricted to be boolean, and returns NIL if any argument is known to equal NIL after this restriction.

Otherwise returns a boolean variable V. The values of the arguments and V are mutually constrained:

* If any argument is later known to equal NIL value of V becomes NIL.

* If all arguments are later known to equal T, value of V becomes T.

* If value of V is later known to equal T, all arguments become T.

* If value of V is later known to equal NIL, and all but one argument is known to be T, the remaining argument becomes NIL.

Note that unlike CL:AND, ANDV is a function and always evaluates all its arguments. Secondly, any non-boolean argument causes it to fail.

Package

screamer.

Source

screamer.lisp.

Function: apply-nondeterministic (function &rest arguments)

Analogous to the CL:APPLY, except FUNCTION can be either a nondeterministic function, or an ordinary deterministic function.

You must use APPLY-NONDETERMINISTIC to apply a nondeterministic function. An error is signalled if a nondeterministic function object is used with CL:APPLY.

You can use APPLY-NONDETERMINISTIC to apply either a deterministic or nondeterministic function, though even if all of the ARGUMENTS are deterministic and FUNCTION is a deterministic function object, the call expression will still be nondeterministic (with presumably a single value), since it is impossible to determine at compile time that a given call to APPLY-NONDETERMINISTIC will be passed only deterministic function objects for function.

Package

screamer.

Source

screamer.lisp.

Function: apply-substitution (x)

If X is a CONS, or a variable whose value is a CONS, returns
a freshly consed copy of the tree with all variables dereferenced. Otherwise returns the value of X.

Package

screamer.

Source

screamer.lisp.

Function: applyv (f x &rest xs)

F must be a deterministic function. If all arguments X are bound, returns the result of calling F on the dereferenced values of spread arguments.

Otherwise returns a fresh variable V, constrained to be equal to the result of calling F on the dereferenced values of arguments.

Additionally, if all but one of V and the argument variables become known, and the remaining variable has a finite domain, then that domain is further restricted to be consistent with other arguments.

Package

screamer.

Source

screamer.lisp.

Function: booleanp (x)

Returns true iff X is T or NIL.

Package

screamer.

Source

screamer.lisp.

Function: booleanpv (x)

The expression (BOOLEANPV X) is an abbreviation for (MEMBERV X ’(T NIL)).

Package

screamer.

Source

screamer.lisp.

Function: bound? (x)

Returns T if X is not a variable or if X is a bound variable. Otherwise returns NIL. BOUND? is analogous to the extra-logical predicates ‘var’ and ‘nonvar’ typically available in Prolog.

Package

screamer.

Source

screamer.lisp.

Function: count-trues (&rest xs)

Returns the number of time a non-NIL value occurs in its arguments.

Package

screamer.

Source

screamer.lisp.

Function: count-truesv (&rest xs)

Constrains all its arguments to be boolean. If each argument is known, returns
the number of T arguments. Otherwise returns a fresh constraint variable V.

V and arguments are mutually constrained:

* Lower bound of V is the number arguments known to be T.

* Upper bound of V is the number arguments minus the number of arguments known to be NIL.

* If lower bound of V is constrained to be equal to number of arguments known
to be NIL, all arguments not known to be NIL are constrained to be T.

* If Upper bound of V is constrained to be equal to number of arguments known
to be T, all arguments not known to be T are constrained to be NIL.

Package

screamer.

Source

screamer.lisp.

Function: divide-and-conquer-force (variable)

Returns X if X is not a variable. If X is a bound variable then returns its value. Otherwise implements a single binary-branching step of a divide-and-conquer search algorithm. There are always two alternatives, the second of which is tried upon backtracking.

If it is known to have a finite domain D then this domain is split into two halves and the value of X is nondeterministically restricted to be a member one of the halves. If X becomes bound by this restriction then its value is returned. Otherwise, X itself is returned.

If X is not known to have a finite domain but is known to be real and to have both lower and upper bounds then nondeterministically either the lower or upper bound is restricted to the midpoint between the lower and upper bound. If X becomes bound by this restriction then its dereferenced value is returned. Otherwise, X itself is returned.

An error is signalled if X is not known to be restricted to a finite domain and either is not known to be real or is not known to have both a lower and upper bound.

When the set of potential values may be infinite, users of DIVIDE-AND-CONQUER-FORCE may need to take care to fail when the range size of the variable becomes too small, unless other constraints on it are sufficient to guarentee failure.

The method of splitting the domain into two halves is left unspecified to give future implementations leeway in incorporating heuristics in the process of determining a good search order. All that is specified is that if the domain size is even prior to splitting, the halves are of equal size, while if the domain size is odd, the halves differ in size by at most one.

Package

screamer.

Source

screamer.lisp.

Function: domain-size (x)

Returns the domain size of X.

If X is an integer variable with an upper and lower bound, its domain size is the one greater than the difference of its bounds. Eg. [integer 1:2] has domain size 2.

If X is a variable with an enumerated domain, its domain size is the size of that domain.

If X is a CONS, or a variable whose value is a CONS, its domain size is the product of the domain sizes of its CAR and CDR.

Other types of unbound variables have domain size NIL, whereas non-variables have domain size of 1.

Package

screamer.

Source

screamer.lisp.

Function: equalv (x y)

Returns T if the aggregate object X is known to equal the aggregate object Y, NIL if the aggregate object X is known not to equal the aggregate object Y, and a new boolean variable V if it is not known whether or not X equals Y when EQUALV is called.

The values of X, Y and V are mutually constraints via noticers so that V equals T if and only if X is known to equal Y and V equals NIL if and only if X is known not to equal Y.

Noticers are attached to V as well as to all variables nested in both in X and Y. When the noticers attached to variables nested in X and Y detect that X is known to equal Y they restrict V to equal T. Likewise, when the noticers attached to variables nested in X and Y detect that X is known not to equal Y they restrict V to equal NIL.

Furthermore, if V later becomes known to equal T then X and Y are unified. Likewise, if V later becomes known to equal NIL then X and Y are restricted to not be equal. This is accomplished by attaching noticers to the variables nested in X and Y which detect when X becomes equal to Y and fail.

The expression (KNOWN? (EQUALV X Y)) is analogous to the extra-logical predicate ‘==’ typically available in Prolog.

The expression (KNOWN? (NOTV (EQUALV X Y))) is analogous to the extra-logical predicate ‘\=’ typically available in Prolog.

The expression (ASSERT! (EQUALV X Y)) is analogous to Prolog unification.

The expression (ASSERT! (NOTV (EQUALV X Y))) is analogous to the disunification operator available in Prolog-II.

Package

screamer.

Source

screamer.lisp.

Function: fail ()

Backtracks to the most recent choice-point.

FAIL is deterministic function and thus it is permissible to reference #’FAIL, and write (FUNCALL #’FAIL) or (APPLY #’FAIL).

Calling FAIL when there is no choice-point to backtrack to signals an error.

Package

screamer.

Source

screamer.lisp.

Function: funcall-nondeterministic (function &rest arguments)

Analogous to CL:FUNCALL, except FUNCTION can be either a nondeterministic function, or an ordinary determinisitic function.

You must use FUNCALL-NONDETERMINISTIC to funcall a nondeterministic function. An error is signalled if you attempt to funcall a nondeterministic function object with CL:FUNCALL.

You can use FUNCALL-NONDETERMINISTIC to funcall either a deterministic or nondeterministic function, though even if all of the ARGUMENTS are deterministic and FUNCTION is a deterministic function object, the call expression will still be nondeterministic (with presumably a single value), since it is impossible to determine at compile time that a given call to FUNCALL-NONDETERMINISTIC will be passed only deterministic function objects for function.

Package

screamer.

Source

screamer.lisp.

Function: funcallv (f &rest x)

F must be a deterministic function. If all arguments X are bound, returns the result of calling F on the dereferenced values of arguments.

Otherwise returns a fresh variable V, constrained to be equal to the result of calling F on the dereferenced values of arguments.

Additionally, if all but one of V and the argument variables become known, and the remaining variable has a finite domain, then that domain is further restricted to be consistent with other arguments.

Package

screamer.

Source

screamer.lisp.

Function: ground? (x)

The primitive GROUND? is an extension of the primitive BOUND? which can recursively determine whether an entire aggregate object is bound. Returns T if X is bound and either the value of X is atomic or a CONS tree where all atoms are bound.

Otherwise returns nil.

Package

screamer.

Source

screamer.lisp.

Function: integerpv (x)

Returns T if X is known to be integer valued, and NIL if X is known be non-integer value.

If it is not known whether or not X is integer valued when INTEGERPV is called then INTEGERPV creates and returns a new boolean variable V.

The values of X and V are mutually constrained via noticers so that V is equal to T if and only if X is known to be integer valued, and V is equal to NIL if and only if X is known to be non-integer valued.

If X later becomes known to be integer valued, a noticer attached to X restricts V to equal T. Likewise, if X later becomes known to be non-integer valued, a noticer attached to X restricts V to equal NIL.

Furthermore, if V ever becomes known to equal T then a noticer attached to V restricts X to be integer valued. Likewise, if V ever becomes known to equal NIL then a noticer attached to V restricts X to be non-integer valued.

Package

screamer.

Source

screamer.lisp.

Function: linear-force (x)

Returns X if it is not a variable. If X is a bound variable then returns its value.

If X is an unbound variable then it must be known to have a countable set of potential values. In this case X is nondeterministically restricted to be equal to one of the values in this countable set, thus forcing X to be bound. The dereferenced value of X is then returned.

An unbound variable is known to have a countable set of potential values either if it is known to have a finite domain or if it is known to be integer valued.

An error is signalled if X is not known to have a finite domain and is not known to be integer valued.

Upon backtracking X will be bound to each potential value in turn, failing when there remain no untried alternatives.

Since the set of potential values is required only to be countable, not finite, the set of untried alternatives may never be exhausted and backtracking need not terminate. This can happen, for instance, when X is known to be an integer but lacks either an upper of lower bound.

The order in which the nondeterministic alternatives are tried is left unspecified to give future implementations leeway in incorporating heuristics in the process of determining a good search order.

Package

screamer.

Source

screamer.lisp.

Function: make-variable (&optional name)

Creates and returns a new variable. Variables are assigned a name which is only used to identify the variable when it is printed. If the parameter NAME is given then it is assigned as the name of the variable. Otherwise, a unique name is assigned. The parameter NAME can be any Lisp object.

Package

screamer.

Source

screamer.lisp.

Function: maxv (x &rest xs)

Constrains its arguments to be real. If called with a single argument, returns its value. If called with multiple arguments, behaves as if a combination of two argument calls:

(MAXV X1 X2 ... Xn) == (MAXV (MAXV X1 X2) ... Xn)

If called with two arguments, and either is known to be greater than or equal to the other, returns the value of that argument. Otherwise returns a real variable V, mutually constrained with the arguments:

* Maximum of the values of X1 and X2 is constrained to equal V. This includes constraining their bounds appropriately. If it becomes know that cannot be true. FAIL is called.

* If both arguments are integers, V is constrained to be an integer.

Package

screamer.

Source

screamer.lisp.

Function: memberv (x sequence)

Returns T if X is known to be a member of SEQUENCE (using the Common Lisp function EQL as a test function), NIL if X is known not to be a member of SEQUENCE, and otherwise returns a new boolean variable V.

When a new variable is created, the values of X and V are mutually constrained via noticers so that V is equal to T if and only if X is known to be a member of SEQUENCE and V is equal to NIL if and only if X is known not to be a member of SEQUENCE.

* If X later becomes known to be a member of SEQUENCE, a noticer attached to X restricts v to equal T. Likewise, if X later becomes known not to be a member of SEQUENCE, a noticer attached to X restricts V to equal NIL.

* If V ever becomes known to equal T then a noticer attached to V restricts X to be a member of SEQUENCE. Likewise, if V ever becomes known to equal NIL then a noticer attached to V restricts X not to be a member of SEQUENCE.

The current implementation imposes two constraints on the parameter SEQUENCE. First, SEQUENCE must be bound when MEMBERV is called. Second, SEQUENCE must not contain any unbound variables when MEMBERV is called.

The value of parameter SEQUENCE must be a sequence, i.e. either a list or a vector.

Package

screamer.

Source

screamer.lisp.

Function: minv (x &rest xs)

Constrains its arguments to be real. If called with a single argument, returns its value. If called with multiple arguments, behaves as if a combination of two argument calls:

(MINV X1 X2 ... Xn) == (MINV (MINV X1 X2) ... Xn)

If called with two arguments, and either is known to be less than or equal to the other, returns the value of that argument. Otherwise returns a real variable V, mutually constrained with the arguments:

* Minimum of the values of X1 and X2 is constrained to equal V. This includes constraining their bounds appropriately. If it becomes know that cannot be true. FAIL is called.

* If both arguments are integers, V is constrained to be an integer.

Package

screamer.

Source

screamer.lisp.

Function: multiple-value-call-nondeterministic (function-form &rest values-forms)

Analogous to the CL:MULTIPLE-VALUE-CALL, except FUNCTION-FORM can evaluate to either a nondeterministic function, or an ordinary deterministic function.

You must use MULTIPLE-VALUE-CALL-NONDETERMINISTIC to multiple-value-call a nondeterministic function. An error is signalled if a nondeterministic function object is used with CL:MULTIPLE-VALUE-CALL.

You can use MULTIPLE-VALUE-CALL-NONDETERMINISTIC to call either a deterministic or nondeterministic function, though even if all of the VALUES-FORMS are deterministic and FUNCTION-FORM evaluates to a deterministic function object, the call expression will still be nondeterministic (with presumably a single value), since it is impossible to determine at compile time that a given call to MULTIPLE-VALUE-CALL-NONDETERMINISTIC will be passed only deterministic function objects for function.

While MULTIPLE-VALUE-CALL-NONDETERMINISTIC appears to be a function, it
is really a special-operator implemented by the code-walkers processing nondeterministic source contexts.

Package

screamer.

Source

screamer.lisp.

Function: nondeterministic-function? (x)

Returns T if X is a nondeterministic function and NIL otherwise.

#’FOO returns a nondeterministic function object iff it is used in nondeterminisitc context and FOO is either a nondeterministic LAMBDA form, or the name of a nondeterministic function defined using SCREAMER::DEFUN.

Currently, if FOO is a nondeterministic function defined using
SCREAMER::DEFUN, #’FOO and (SYMBOL-FUNCTION ’FOO) in deterministic context
will return an ordinary deterministic Common Lisp function, which will signal an error at runtime.

Package

screamer.

Source

screamer.lisp.

Function: notv (x)

Restricts X to be a boolean.

Returns T if this restricts X to NIL, and T if this restricts X to NIL.

Otherwise returns a new boolean variable V. V and X are mutually constrained via noticers, so that if either is later known to equal T, the other is restricted to equal NIL and vice versa.

Note that unlike CL:NOT NOTV does not accept arbitrary values as arguments: it fails if its argument is not T, NIL, or variable that can be restricted to a boolean.

Package

screamer.

Source

screamer.lisp.

Function: numberpv (x)

Returns T if X is known to be numeric, NIL if X is known to be
non-numeric, and otherwise returns a new boolean variable V.

The values of X and V are mutually constrained via noticers so that V is equal to T if and only if X is known to be numeric and V is equal to NIL if and only if X is known to be non-numeric.

* If X later becomes known to be numeric, a noticer attached to X restricts V to equal T. Likewise, if X later becomes known to be non-numeric, a noticer attached to X restricts V to equal NIL.

* If V ever becomes known
to equal T then a noticer attached to V restricts X to be numeric. Likewise, if V ever becomes known to equal NIL then a noticer attached to V restricts X to be non-numeric.

Package

screamer.

Source

screamer.lisp.

Function: orv (&rest xs)

Restricts each argument to be boolean.

Returns NIL if called with no arguments, or if all arguments are known to equal NIL after being restructed to be boolean, and returns T if any argument is known to equal T after this restriction.

Otherwise returns a boolean variable V. The values of arguments and V are mutually constrained:

* If any argument is later known to equal T, value of V becomes T.

* If all arguments are later known to equal NIL, value of V becomes NIL.

* If value of V is later known to equal NIL, all arguments become NIL.

* If value of V is later known to equal T, and all but one argument is known to be NIL, the remaining argument becomes T.

Note that unlike CL:OR, ORV is a function and always evaluates all its arguments. Secondly, any non-boolean argument causes it to fail.

Package

screamer.

Source

screamer.lisp.

Function: purge (function-name)

Removes any information about FUNCTION-NAME from Screamer’s who-calls database.

Package

screamer.

Source

screamer.lisp.

Function: range-size (x)

Returns the range size of X. Range size is the size of the range values
of X may take.

If X is an integer or a bound variable whose value is an integer, it has the range size 0. Reals and bound variables whose values are reals have range size 0.0.

Unbound variables known to be reals with an upper and lower bound have a range size the difference of their upper and lower bounds.

Other types of objects and variables have range size NIL.

Package

screamer.

Source

screamer.lisp.

Function: realpv (x)

Returns T if X is known to be real, NIL if X is known to be non-real,
and otherwise returns a new boolean variable V.

The values of X and V are mutually constrained via noticers so that V is equal to T if and only if X is known to be real and V is equal to NIL if and only if X is known to be non-real.

* If X later becomes known to be real, a noticer attached to X restricts V to equal T. Likewise, if X later becomes known to be non-real, a noticer attached to X restricts V to equal NIL.

* If V ever becomes known to equal T then a noticer attached to V restricts X to be real. Likewise, if V ever becomes known to equal NIL then a noticer attached to V restricts X to be non-real.

Package

screamer.

Source

screamer.lisp.

Function: reorder (cost-function terminate? order force-function)

Returns an ordering force function based on arguments.

The FORCE-FUNCTION is any (potentially nondeterministic) function
which can be applied to a variable as its single argument with the stipulation that a finite number of repeated applications will force
the variable to be bound. The FORCE-FUNCTION need not return any useful value.

The ordering force function which is returned is a nondeterministic function which takes a single argument X. This argument X can be a list of values where each value may be either a variable or a non-variable.

The ordering force function repeatedly selects a "best" variable using using COST-FUNCTION and ORDER. Eg. using #’DOMAIN-SIZE and #’< as the COST-FUNCTION and ORDER, then the variable with the smallest domain will be forced first.

Function TERMINATE? is then called with the determined cost of that variable, and unless it returns true, FORCE-FUNCTION is applied to that variable to force constrain it.

Process then iterates until all variables become bound or TERMINATE? returns true.

The ordering force function does not return any meaningful result.

Screamer currently provides two convenient force-functions, namely #’linear-force and #’divide-and-conquer-force though future implementations may provide additional ones. (The defined Screamer protocol does not provide sufficient hooks for the user to define her own force functions.)

Package

screamer.

Source

screamer.lisp.

Function: solution (arguments ordering-force-function)

ARGUMENTS is a list of values. Typically it is a list of
variables but it may also contain nonvariables.

The specified ORDERING-FORCE-FUNCTION is used to force each of the variables in list to be bound.

Returns a list of the values of the elements of list in the same order that they appear in list, irrespective of the forcing order imposed by the ORDERING-FORCE-FUNCTION.

The ORDERING-FORCE-FUNCTION can be any function which takes a list of values as its single argument that is guaranteed to force all variables in that list to be bound upon its return. The returned value of the ORDERING-FORCE-FUNCTION is ignored.

The user can construct her own ORDERING-FORCE-FUNCTION or use one of the following alternatives provided with Screamer:

(STATIC-ORDERING #’LINEAR-FORCE),
(STATIC-ORDERING #’DIVIDE-AND-CONQUER-FORCE),
(REORDER COST-FUN TERMINATE-TEST ORDER #’LINEAR-FORCE) and
(REORDER COST-FUN TERMINATE-TEST ORDER #’DIVIDE-AND-CONQUER-FORCE).

Future implementation of Screamer may provide additional forcing and ordering functions.

Package

screamer.

Source

screamer.lisp.

Function: static-ordering (force-function)

Returns an ordering force function based on FORCE-FUNCTION.

The ordering force function which is returned is a nondeterministic function which takes a single argument X. This argument X can be a list of values where each value may be either a variable or a non-variable. The ordering force function applies the FORCE-FUNCTION in turn to each of the variables in X, in the order that they appear, repeatedly applying the FORCE-FUNCTION to a given variable until it becomes bound before proceeding to the next variable. The ordering force function does not return any meaningful result.

FORCE-FUNCTION is any (potentially nondeterministic) function which can be applied to a variable as its single argument with the stipulation that a finite number of repeated applications will force the variable to be bound. The FORCE-FUNCTION need not return any useful value.

Screamer currently provides two convenient force-functions, namely #’LINEAR-FORCE and #’DIVIDE-AND-CONQUER-FORCE though future implementations may provide additional ones. (The defined Screamer protocol does not provide sufficient hooks for the user to define her own force functions.)

Package

screamer.

Source

screamer.lisp.

Function: template (template)

Copies an aggregate object, replacing any symbol beginning with a question mark with a newly created variable.

If the same symbol appears more than once in X, only one variable is created for that symbol, the same variable replacing any occurrences of that symbol. Thus (TEMPLATE ’(A B (?C D ?E) ?E)) has the same effect as:

(LET ((?C (MAKE-VARIABLE))
(?E (MAKE-VARIABLE)))
(LIST ’A ’B (LIST C ’D E) E)).

This is useful for creating patterns to be unified with other structures.

Package

screamer.

Source

screamer.lisp.

Function: trail (function)

When called in non-deterministic context, adds FUNCTION to the trail. Outside non-deterministic context does nothing.

Functions on the trail are called when unwinding from a nondeterministic selection (due to either a normal return, or calling FAIL.)

Package

screamer.

Source

screamer.lisp.

Function: unwedge-screamer ()

Removes any information about all user defined functions from Screamer’s who-calls database.

Package

screamer.

Source

screamer.lisp.

Function: unwind-trail ()

DEPRECATED.

Calls all functions installed using TRAIL, and removes them from the trail.

Using UNWIND-TRAIL is dangerous, as TRAIL is used by Screamer internally to eg. undo effects of local assignments – hence users should never call it. It is provided at the moment only for backwards compatibility with classic Screamer.

Package

screamer.

Source

screamer.lisp.

Function: value-of (x)

Returns X if X is not a variable. If X is a variable then VALUE-OF dereferences X and returns the dereferenced value. If X is bound then the value returned will not be a variable. If X is unbound then the value returned will be a variable which may be X itself or another variable which is shared with X.

Package

screamer.

Source

screamer.lisp.


5.1.4 Standalone methods

Method: print-object ((object nondeterministic-function) stream)
Source

screamer.lisp.

Method: print-object ((object variable) stream)
Source

screamer.lisp.


5.2 Internals


Next: , Previous: , Up: Internals   [Contents][Index]

5.2.1 Special variables

Special Variable: *block-tags*

This must be globally NIL.

Package

screamer.

Source

screamer.lisp.

Special Variable: *fail*
Package

screamer.

Source

screamer.lisp.

Special Variable: *function-record-table*

The function record table.

Package

screamer.

Source

screamer.lisp.

Special Variable: *local?*

This must be globally NIL.

Package

screamer.

Source

screamer.lisp.

Special Variable: *name*

The counter for anonymous names.

Package

screamer.

Source

screamer.lisp.

Special Variable: *nondeterministic-context?*

This must be globally NIL.

Package

screamer.

Source

screamer.lisp.

Special Variable: *nondeterministic?*

This must be globally NIL.

Package

screamer.

Source

screamer.lisp.

Special Variable: *ordered-lambda-list-keywords*

The allowed lambda list keywords in order.

Package

screamer.

Source

screamer.lisp.

Special Variable: *screamer?*

This must be NIL except when defining internal Screamer functions.

Package

screamer.

Source

screamer.lisp.

Special Variable: *tagbody-tags*

This must be globally NIL.

Package

screamer.

Source

screamer.lisp.

Special Variable: *trail*

The trail.

Package

screamer.

Source

screamer.lisp.


5.2.2 Macros

Macro: choice-point (form)
Package

screamer.

Source

screamer.lisp.

Macro: choice-point-external (&rest forms)
Package

screamer.

Source

screamer.lisp.

Macro: choice-point-internal (form)
Package

screamer.

Source

screamer.lisp.

Macro: defmacro-compile-time (function-name lambda-list &body body)
Package

screamer.

Source

screamer.lisp.

Macro: defstruct-compile-time (options &body items)
Package

screamer.

Source

screamer.lisp.

Macro: defun (function-name lambda-list &body body)
Package

screamer.

Source

screamer.lisp.

Macro: defun-compile-time (function-name lambda-list &body body)
Package

screamer.

Source

screamer.lisp.

Macro: defvar-compile-time (name &optional initial-value documentation)
Package

screamer.

Source

screamer.lisp.

Macro: multiple-value-bind (variables form &body body)
Package

screamer.

Source

screamer.lisp.


Next: , Previous: , Up: Internals   [Contents][Index]

5.2.3 Ordinary functions

Function: *-rule-down (z x y)
Package

screamer.

Source

screamer.lisp.

Function: *-rule-up (z x y)
Package

screamer.

Source

screamer.lisp.

Function: *v-internal (xs)
Package

screamer.

Source

screamer.lisp.

Function: *v2 (x y)
Package

screamer.

Source

screamer.lisp.

Function: +-rule-down (z x y)
Package

screamer.

Source

screamer.lisp.

Function: +-rule-up (z x y)
Package

screamer.

Source

screamer.lisp.

Function: +v-internal (xs)
Package

screamer.

Source

screamer.lisp.

Function: +v2 (x y)
Package

screamer.

Source

screamer.lisp.

Function: -v-internal (x xs)
Package

screamer.

Source

screamer.lisp.

Function: -v2 (x y)
Package

screamer.

Source

screamer.lisp.

Function: /-rule (z x y)
Package

screamer.

Source

screamer.lisp.

Function: /=-rule (x y)
Package

screamer.

Source

screamer.lisp.

Function: /=v-internal (x xs)
Package

screamer.

Source

screamer.lisp.

Function: /=v2 (x y)
Package

screamer.

Source

screamer.lisp.

Function: /v-internal (x xs)
Package

screamer.

Source

screamer.lisp.

Function: /v2 (x y)
Package

screamer.

Source

screamer.lisp.

Function: <-rule (x y)
Package

screamer.

Source

screamer.lisp.

Function: <=-rule (x y)
Package

screamer.

Source

screamer.lisp.

Function: <=v-internal (x xs)
Package

screamer.

Source

screamer.lisp.

Function: <=v2 (x y)
Package

screamer.

Source

screamer.lisp.

Function: <v-internal (x xs)
Package

screamer.

Source

screamer.lisp.

Function: <v2 (x y)
Package

screamer.

Source

screamer.lisp.

Function: =-rule (x y)
Package

screamer.

Source

screamer.lisp.

Function: =v-internal (x xs)
Package

screamer.

Source

screamer.lisp.

Function: =v2 (x y)
Package

screamer.

Source

screamer.lisp.

Function: >=v-internal (x xs)
Package

screamer.

Source

screamer.lisp.

Function: >v-internal (x xs)
Package

screamer.

Source

screamer.lisp.

Function: a-boolean-nondeterministic (continuation)
Package

screamer.

Source

screamer.lisp.

Function: a-member-of-nondeterministic (continuation sequence)
Package

screamer.

Source

screamer.lisp.

Function: a-tuple (variables variable value)
Package

screamer.

Source

screamer.lisp.

Function: a-tuple-nondeterministic (continuation-0 variables variable value)
Package

screamer.

Source

screamer.lisp.

Function: an-integer-above-nondeterministic (continuation low)
Package

screamer.

Source

screamer.lisp.

Function: an-integer-below-nondeterministic (continuation high)
Package

screamer.

Source

screamer.lisp.

Function: an-integer-between-nondeterministic (continuation low high)
Package

screamer.

Source

screamer.lisp.

Function: an-integer-nondeterministic (continuation)
Package

screamer.

Source

screamer.lisp.

Function: andv-internal (xs)
Package

screamer.

Source

screamer.lisp.

Function: apply-nondeterministic-nondeterministic (continuation function argument &rest arguments)
Package

screamer.

Source

screamer.lisp.

Function: arguments-for-applyv (x xs)
Package

screamer.

Source

screamer.lisp.

Function: assert!-/=v (x &rest xs)
Package

screamer.

Source

screamer.lisp.

Function: assert!-/=v-internal (x xs)
Package

screamer.

Source

screamer.lisp.

Function: assert!-/=v2 (x y)
Package

screamer.

Source

screamer.lisp.

Function: assert!-<=v (x &rest xs)
Package

screamer.

Source

screamer.lisp.

Function: assert!-<=v-internal (x xs)
Package

screamer.

Source

screamer.lisp.

Function: assert!-<=v2 (x y)
Package

screamer.

Source

screamer.lisp.

Function: assert!-<v (x &rest xs)
Package

screamer.

Source

screamer.lisp.

Function: assert!-<v-internal (x xs)
Package

screamer.

Source

screamer.lisp.

Function: assert!-<v2 (x y)
Package

screamer.

Source

screamer.lisp.

Function: assert!-=v (x &rest xs)
Package

screamer.

Source

screamer.lisp.

Function: assert!-=v-internal (x xs)
Package

screamer.

Source

screamer.lisp.

Function: assert!-=v2 (x y)
Package

screamer.

Source

screamer.lisp.

Function: assert!->=v (x &rest xs)
Package

screamer.

Source

screamer.lisp.

Function: assert!->=v-internal (x xs)
Package

screamer.

Source

screamer.lisp.

Function: assert!->v (x &rest xs)
Package

screamer.

Source

screamer.lisp.

Function: assert!->v-internal (x xs)
Package

screamer.

Source

screamer.lisp.

Function: assert!-applyv (f x &rest xs)
Package

screamer.

Source

screamer.lisp.

Function: assert!-booleanpv (x)
Package

screamer.

Source

screamer.lisp.

Function: assert!-clause (xs ps)
Package

screamer.

Source

screamer.lisp.

Function: assert!-constraint (predicate polarity? variables)
Package

screamer.

Source

screamer.lisp.

Function: assert!-constraint-ac (predicate polarity? variables)
Package

screamer.

Source

screamer.lisp.

Function: assert!-constraint-gfc (predicate polarity? variables)
Package

screamer.

Source

screamer.lisp.

Function: assert!-equalv (x y)
Package

screamer.

Source

screamer.lisp.

Function: assert!-false (x)
Package

screamer.

Source

screamer.lisp.

Function: assert!-funcallv (f &rest x)
Package

screamer.

Source

screamer.lisp.

Function: assert!-integerpv (x)
Package

screamer.

Source

screamer.lisp.

Function: assert!-memberv (x y)
Package

screamer.

Source

screamer.lisp.

Function: assert!-memberv-internal (x y)
Package

screamer.

Source

screamer.lisp.

Function: assert!-notv-andv (&rest xs)
Package

screamer.

Source

screamer.lisp.

Function: assert!-notv-andv-internal (xs)
Package

screamer.

Source

screamer.lisp.

Function: assert!-notv-applyv (f x &rest xs)
Package

screamer.

Source

screamer.lisp.

Function: assert!-notv-booleanpv (x)
Package

screamer.

Source

screamer.lisp.

Function: assert!-notv-equalv (x y)
Package

screamer.

Source

screamer.lisp.

Function: assert!-notv-funcallv (f &rest x)
Package

screamer.

Source

screamer.lisp.

Function: assert!-notv-integerpv (x)
Package

screamer.

Source

screamer.lisp.

Function: assert!-notv-memberv (x y)
Package

screamer.

Source

screamer.lisp.

Function: assert!-notv-memberv-internal (x y)
Package

screamer.

Source

screamer.lisp.

Function: assert!-notv-numberpv (x)
Package

screamer.

Source

screamer.lisp.

Function: assert!-notv-realpv (x)
Package

screamer.

Source

screamer.lisp.

Function: assert!-numberpv (x)
Package

screamer.

Source

screamer.lisp.

Function: assert!-orv (&rest xs)
Package

screamer.

Source

screamer.lisp.

Function: assert!-orv-internal (xs)
Package

screamer.

Source

screamer.lisp.

Function: assert!-realpv (x)
Package

screamer.

Source

screamer.lisp.

Function: assert!-true (x)
Package

screamer.

Source

screamer.lisp.

Function: attach-noticer! (noticer x)
Package

screamer.

Source

screamer.lisp.

Function: attach-noticer!-internal (noticer x)
Package

screamer.

Source

screamer.lisp.

Function: cache-definition (function-name lambda-list body callees)
Package

screamer.

Source

screamer.lisp.

Function: callees (function-name)
Package

screamer.

Source

screamer.lisp.

Function: callers (function-name)
Package

screamer.

Source

screamer.lisp.

Function: check-function-name (function-name)
Package

screamer.

Source

screamer.lisp.

Function: check-lambda-list (lambda-list)
Package

screamer.

Source

screamer.lisp.

Function: check-lambda-list-internal (lambda-list &optional mode)
Package

screamer.

Source

screamer.lisp.

Function: compute-callees (body environment)
Package

screamer.

Source

screamer.lisp.

Function: contains-local-setf/setq? (form environment)
Package

screamer.

Source

screamer.lisp.

Function: contains-variables? (x)
Package

screamer.

Source

screamer.lisp.

Function: copy-function-record (instance)
Package

screamer.

Source

screamer.lisp.

Function: copy-nondeterministic-function (instance)
Package

screamer.

Source

screamer.lisp.

Function: copy-variable (instance)
Package

screamer.

Source

screamer.lisp.

Function: corrupted? (variable)
Package

screamer.

Source

screamer.lisp.

Function: count-trues-internal (xs)
Package

screamer.

Source

screamer.lisp.

Function: count-truesv-internal (xs)
Package

screamer.

Source

screamer.lisp.

Function: cps-convert (form continuation types value? environment)
Package

screamer.

Source

screamer.lisp.

Function: cps-convert-block (name body continuation types value? environment)
Package

screamer.

Source

screamer.lisp.

Function: cps-convert-call (function-name arguments continuation types value? environment &optional dummy-arguments)
Package

screamer.

Source

screamer.lisp.

Function: cps-convert-function-name (function-name)
Package

screamer.

Source

screamer.lisp.

Function: cps-convert-if (antecedent consequent alternate continuation types value? environment)
Package

screamer.

Source

screamer.lisp.

Function: cps-convert-let (bindings body declarations continuation types value? environment &optional new-bindings)
Package

screamer.

Source

screamer.lisp.

Function: cps-convert-let* (bindings body declarations continuation types value? environment)
Package

screamer.

Source

screamer.lisp.

Function: cps-convert-local-setf/setq (arguments continuation types value? environment)
Package

screamer.

Source

screamer.lisp.

Function: cps-convert-multiple-value-call (nondeterministic? function forms continuation types value? environment)
Package

screamer.

Source

screamer.lisp.

Function: cps-convert-multiple-value-call-internal (nondeterministic? function forms continuation types value? environment &optional arguments)
Package

screamer.

Source

screamer.lisp.

Function: cps-convert-multiple-value-prog1 (form forms continuation types value? environment)
Package

screamer.

Source

screamer.lisp.

Function: cps-convert-progn (body continuation types value? environment)
Package

screamer.

Source

screamer.lisp.

Function: cps-convert-return-from (name result environment)
Package

screamer.

Source

screamer.lisp.

Function: cps-convert-setq (arguments continuation types value? environment)
Package

screamer.

Source

screamer.lisp.

Function: cps-convert-tagbody (body continuation types value? environment)
Package

screamer.

Source

screamer.lisp.

Function: cps-non-convert-call (function-name arguments continuation types value? environment &optional dummy-arguments)
Package

screamer.

Source

screamer.lisp.

Function: declare-deterministic (function-name)
Package

screamer.

Source

screamer.lisp.

Function: declare-nondeterministic (function-name)
Package

screamer.

Source

screamer.lisp.

Function: determine-whether-callers-are-deterministic (function-name function-names environment)
Package

screamer.

Source

screamer.lisp.

Function: determine-whether-deterministic (function-name environment)
Package

screamer.

Source

screamer.lisp.

Function: deterministic-lambda-list? (lambda-list environment)
Package

screamer.

Source

screamer.lisp.

Function: deterministic? (form environment)
Package

screamer.

Source

screamer.lisp.

Function: divide-and-conquer-force-nondeterministic (continuation-0 variable)

Returns X if X is not a variable. If X is a bound variable then returns its value. Otherwise implements a single binary-branching step of a divide-and-conquer search algorithm. There are always two alternatives, the second of which is tried upon backtracking.

If it is known to have a finite domain D then this domain is split into two halves and the value of X is nondeterministically restricted to be a member one of the halves. If X becomes bound by this restriction then its value is returned. Otherwise, X itself is returned.

If X is not known to have a finite domain but is known to be real and to have both lower and upper bounds then nondeterministically either the lower or upper bound is restricted to the midpoint between the lower and upper bound. If X becomes bound by this restriction then its dereferenced value is returned. Otherwise, X itself is returned.

An error is signalled if X is not known to be restricted to a finite domain and either is not known to be real or is not known to have both a lower and upper bound.

When the set of potential values may be infinite, users of DIVIDE-AND-CONQUER-FORCE may need to take care to fail when the range size of the variable becomes too small, unless other constraints on it are sufficient to guarentee failure.

The method of splitting the domain into two halves is left unspecified to give future implementations leeway in incorporating heuristics in the process of determining a good search order. All that is specified is that if the domain size is even prior to splitting, the halves are of equal size, while if the domain size is odd, the halves differ in size by at most one.

Package

screamer.

Source

screamer.lisp.

Function: eliminate-variables (x)
Package

screamer.

Source

screamer.lisp.

Function: emacs-eval (expression)
Package

screamer.

Source

screamer.lisp.

Function: every-other (list)
Package

screamer.

Source

screamer.lisp.

Function: expand-local-setf (pairs environment)
Package

screamer.

Source

screamer.lisp.

Function: expand-local-setq (pairs environment)
Package

screamer.

Source

screamer.lisp.

Function: find-best (cost order list)
Package

screamer.

Source

screamer.lisp.

Function: finite-domain? (variable)
Package

screamer.

Source

screamer.lisp.

Function: form-callees (form environment)
Package

screamer.

Source

screamer.lisp.

Function: funcall-nondeterministic-nondeterministic (continuation function &rest arguments)
Package

screamer.

Source

screamer.lisp.

Function: function-definition (function-name environment)
Package

screamer.

Source

screamer.lisp.

Reader: function-record-body (instance)
Writer: (setf function-record-body) (instance)
Package

screamer.

Source

screamer.lisp.

Target Slot

body.

Reader: function-record-callees (instance)
Writer: (setf function-record-callees) (instance)
Package

screamer.

Source

screamer.lisp.

Target Slot

callees.

Reader: function-record-deterministic? (instance)
Writer: (setf function-record-deterministic?) (instance)
Package

screamer.

Source

screamer.lisp.

Target Slot

deterministic?.

Reader: function-record-function-name (instance)
Writer: (setf function-record-function-name) (instance)
Package

screamer.

Source

screamer.lisp.

Target Slot

function-name.

Reader: function-record-lambda-list (instance)
Writer: (setf function-record-lambda-list) (instance)
Package

screamer.

Source

screamer.lisp.

Target Slot

lambda-list.

Reader: function-record-old-deterministic? (instance)
Writer: (setf function-record-old-deterministic?) (instance)
Package

screamer.

Source

screamer.lisp.

Target Slot

old-deterministic?.

Function: function-record-p (object)
Package

screamer.

Source

screamer.lisp.

Reader: function-record-screamer? (instance)
Writer: (setf function-record-screamer?) (instance)
Package

screamer.

Source

screamer.lisp.

Target Slot

screamer?.

Function: get-function-record (function-name)
Package

screamer.

Source

screamer.lisp.

Function: indirect-callees (function-name)
Package

screamer.

Source

screamer.lisp.

Function: indirect-callees-internal (function-names callees)
Package

screamer.

Source

screamer.lisp.

Function: indirect-callers (function-name)
Package

screamer.

Source

screamer.lisp.

Function: indirect-callers-internal (function-names callers)
Package

screamer.

Source

screamer.lisp.

Function: infinity-* (x y)
Package

screamer.

Source

screamer.lisp.

Function: infinity-+ (x y)
Package

screamer.

Source

screamer.lisp.

Function: infinity-- (x y)
Package

screamer.

Source

screamer.lisp.

Function: infinity-max (x y)
Package

screamer.

Source

screamer.lisp.

Function: infinity-min (x y)
Package

screamer.

Source

screamer.lisp.

Function: integers-between (low high)
Package

screamer.

Source

screamer.lisp.

Function: is-magic-continuation? (continuation)
Package

screamer.

Source

screamer.lisp.

Function: is-magic-declaration? (form)
Package

screamer.

Source

screamer.lisp.

Function: known?-/=v (x &rest xs)
Package

screamer.

Source

screamer.lisp.

Function: known?-/=v-internal (x xs)
Package

screamer.

Source

screamer.lisp.

Function: known?-/=v2 (x y)
Package

screamer.

Source

screamer.lisp.

Function: known?-/=v2-internal (x y)
Package

screamer.

Source

screamer.lisp.

Function: known?-/=v2-variable (x y)
Package

screamer.

Source

screamer.lisp.

Function: known?-<=v (x &rest xs)
Package

screamer.

Source

screamer.lisp.

Function: known?-<=v-internal (x xs)
Package

screamer.

Source

screamer.lisp.

Function: known?-<=v2 (x y)
Package

screamer.

Source

screamer.lisp.

Function: known?-<=v2-internal (x y)
Package

screamer.

Source

screamer.lisp.

Function: known?-<=v2-variable (x y)
Package

screamer.

Source

screamer.lisp.

Function: known?-<v (x &rest xs)
Package

screamer.

Source

screamer.lisp.

Function: known?-<v-internal (x xs)
Package

screamer.

Source

screamer.lisp.

Function: known?-<v2 (x y)
Package

screamer.

Source

screamer.lisp.

Function: known?-<v2-internal (x y)
Package

screamer.

Source

screamer.lisp.

Function: known?-<v2-variable (x y)
Package

screamer.

Source

screamer.lisp.

Function: known?-=v (x &rest xs)
Package

screamer.

Source

screamer.lisp.

Function: known?-=v-internal (x xs)
Package

screamer.

Source

screamer.lisp.

Function: known?-=v2 (x y)
Package

screamer.

Source

screamer.lisp.

Function: known?-=v2-internal (x y)
Package

screamer.

Source

screamer.lisp.

Function: known?-=v2-variable (x y)
Package

screamer.

Source

screamer.lisp.

Function: known?->=v (x &rest xs)
Package

screamer.

Source

screamer.lisp.

Function: known?->=v-internal (x xs)
Package

screamer.

Source

screamer.lisp.

Function: known?->v (x &rest xs)
Package

screamer.

Source

screamer.lisp.

Function: known?->v-internal (x xs)
Package

screamer.

Source

screamer.lisp.

Function: known?-applyv (f x &rest xs)
Package

screamer.

Source

screamer.lisp.

Function: known?-booleanpv (x)
Package

screamer.

Source

screamer.lisp.

Function: known?-constraint (f polarity? x)
Package

screamer.

Source

screamer.lisp.

Function: known?-equalv (x y)
Package

screamer.

Source

screamer.lisp.

Function: known?-false (x)
Package

screamer.

Source

screamer.lisp.

Function: known?-funcallv (f &rest x)
Package

screamer.

Source

screamer.lisp.

Function: known?-integerpv (x)
Package

screamer.

Source

screamer.lisp.

Function: known?-memberv (x y)
Package

screamer.

Source

screamer.lisp.

Function: known?-memberv-internal (x y)
Package

screamer.

Source

screamer.lisp.

Function: known?-memberv-list (x y)
Package

screamer.

Source

screamer.lisp.

Function: known?-memberv-list-internal (x y)
Package

screamer.

Source

screamer.lisp.

Function: known?-notv-applyv (f x &rest xs)
Package

screamer.

Source

screamer.lisp.

Function: known?-notv-booleanpv (x)
Package

screamer.

Source

screamer.lisp.

Function: known?-notv-equalv (x y)
Package

screamer.

Source

screamer.lisp.

Function: known?-notv-funcallv (f &rest x)
Package

screamer.

Source

screamer.lisp.

Function: known?-notv-integerpv (x)
Package

screamer.

Source

screamer.lisp.

Function: known?-notv-memberv (x y)
Package

screamer.

Source

screamer.lisp.

Function: known?-notv-memberv-internal (x y)
Package

screamer.

Source

screamer.lisp.

Function: known?-notv-memberv-list (x y)
Package

screamer.

Source

screamer.lisp.

Function: known?-notv-memberv-list-internal (x y)
Package

screamer.

Source

screamer.lisp.

Function: known?-notv-numberpv (x)
Package

screamer.

Source

screamer.lisp.

Function: known?-notv-realpv (x)
Package

screamer.

Source

screamer.lisp.

Function: known?-numberpv (x)
Package

screamer.

Source

screamer.lisp.

Function: known?-realpv (x)
Package

screamer.

Source

screamer.lisp.

Function: known?-true (x)
Package

screamer.

Source

screamer.lisp.

Function: lambda-expression? (form)
Package

screamer.

Source

screamer.lisp.

Function: linear-force-nondeterministic (continuation-0 x)

Returns X if it is not a variable. If X is a bound variable then returns its value.

If X is an unbound variable then it must be known to have a countable set of potential values. In this case X is nondeterministically restricted to be equal to one of the values in this countable set, thus forcing X to be bound. The dereferenced value of X is then returned.

An unbound variable is known to have a countable set of potential values either if it is known to have a finite domain or if it is known to be integer valued.

An error is signalled if X is not known to have a finite domain and is not known to be integer valued.

Upon backtracking X will be bound to each potential value in turn, failing when there remain no untried alternatives.

Since the set of potential values is required only to be countable, not finite, the set of untried alternatives may never be exhausted and backtracking need not terminate. This can happen, for instance, when X is known to be an integer but lacks either an upper of lower bound.

The order in which the nondeterministic alternatives are tried is left unspecified to give future implementations leeway in incorporating heuristics in the process of determining a good search order.

Package

screamer.

Source

screamer.lisp.

Function: magic-continuation-argument (continuation)
Package

screamer.

Source

screamer.lisp.

Function: make-function-record (&key function-name lambda-list body callees deterministic? old-deterministic? screamer?)
Package

screamer.

Source

screamer.lisp.

Function: make-nondeterministic-function (&key function)
Package

screamer.

Source

screamer.lisp.

Function: make-variable-internal (&key name noticers enumerated-domain enumerated-antidomain value possibly-integer? possibly-noninteger-real? possibly-nonreal-number? possibly-boolean? possibly-nonboolean-nonnumber? lower-bound upper-bound)
Package

screamer.

Source

screamer.lisp.

Function: max-rule-down (z x y)
Package

screamer.

Source

screamer.lisp.

Function: max-rule-up (z x y)
Package

screamer.

Source

screamer.lisp.

Function: maxv-internal (x xs)
Package

screamer.

Source

screamer.lisp.

Function: maxv2 (x y)
Package

screamer.

Source

screamer.lisp.

Function: min-rule-down (z x y)
Package

screamer.

Source

screamer.lisp.

Function: min-rule-up (z x y)
Package

screamer.

Source

screamer.lisp.

Function: minv-internal (x xs)
Package

screamer.

Source

screamer.lisp.

Function: minv2 (x y)
Package

screamer.

Source

screamer.lisp.

Function: modified-function-definitions (function-name environment)
Package

screamer.

Source

screamer.lisp.

Function: needs-substitution? (form environment)
Package

screamer.

Source

screamer.lisp.

Reader: nondeterministic-function-function (instance)
Writer: (setf nondeterministic-function-function) (instance)
Package

screamer.

Source

screamer.lisp.

Target Slot

function.

Function: nondeterministic-function?-internal (object)
Package

screamer.

Source

screamer.lisp.

Function: occurs-in? (x value)
Package

screamer.

Source

screamer.lisp.

Function: orv-internal (xs)
Package

screamer.

Source

screamer.lisp.

Function: peal-off-documentation-string-and-declarations (body &optional documentation-string?)
Package

screamer.

Source

screamer.lisp.

Function: perform-substitutions (form environment)
Package

screamer.

Source

screamer.lisp.

Function: possibly-beta-reduce-funcall (continuation types form value?)
Package

screamer.

Source

screamer.lisp.

Function: print-nondeterministic-function (nondeterministic-function stream print-level)
Package

screamer.

Source

screamer.lisp.

Function: print-variable (x stream print-level)
Package

screamer.

Source

screamer.lisp.

Function: process-subforms (function form form-type environment)
Package

screamer.

Source

screamer.lisp.

Function: propagate-ac (predicate polarity? variables)
Package

screamer.

Source

screamer.lisp.

Function: propagate-gfc (predicate polarity? variables unassigned-variable)
Package

screamer.

Source

screamer.lisp.

Function: prune-enumerated-domain (x &optional enumerated-domain)
Package

screamer.

Source

screamer.lisp.

Function: quotify (thing)
Package

screamer.

Source

screamer.lisp.

Function: reorder-internal (variables cost-function terminate? order force-function)
Package

screamer.

Source

screamer.lisp.

Function: reorder-internal-nondeterministic (continuation-0 variables cost-function terminate? order force-function)
Package

screamer.

Source

screamer.lisp.

Function: restrict-boolean! (x)
Package

screamer.

Source

screamer.lisp.

Function: restrict-bounds! (x lower-bound upper-bound)
Package

screamer.

Source

screamer.lisp.

Function: restrict-enumerated-antidomain! (x enumerated-antidomain)
Package

screamer.

Source

screamer.lisp.

Function: restrict-enumerated-domain! (x enumerated-domain)
Package

screamer.

Source

screamer.lisp.

Function: restrict-false! (x)
Package

screamer.

Source

screamer.lisp.

Function: restrict-integer! (x)
Package

screamer.

Source

screamer.lisp.

Function: restrict-lower-bound! (x lower-bound)
Package

screamer.

Source

screamer.lisp.

Function: restrict-nonboolean! (x)
Package

screamer.

Source

screamer.lisp.

Function: restrict-noninteger! (x)
Package

screamer.

Source

screamer.lisp.

Function: restrict-nonnumber! (x)
Package

screamer.

Source

screamer.lisp.

Function: restrict-nonreal! (x)
Package

screamer.

Source

screamer.lisp.

Function: restrict-number! (x)
Package

screamer.

Source

screamer.lisp.

Function: restrict-real! (x)
Package

screamer.

Source

screamer.lisp.

Function: restrict-true! (x)
Package

screamer.

Source

screamer.lisp.

Function: restrict-upper-bound! (x upper-bound)
Package

screamer.

Source

screamer.lisp.

Function: restrict-value! (x value)
Package

screamer.

Source

screamer.lisp.

Function: run-noticers (x)
Package

screamer.

Source

screamer.lisp.

Function: screamer-error (header &rest args)
Package

screamer.

Source

screamer.lisp.

Function: self-evaluating? (thing)
Package

screamer.

Source

screamer.lisp.

Function: set-enumerated-domain! (x enumerated-domain)
Package

screamer.

Source

screamer.lisp.

Function: share! (x y)
Package

screamer.

Source

screamer.lisp.

Function: solution-nondeterministic (continuation-0 arguments ordering-force-function)

ARGUMENTS is a list of values. Typically it is a list of
variables but it may also contain nonvariables.

The specified ORDERING-FORCE-FUNCTION is used to force each of the variables in list to be bound.

Returns a list of the values of the elements of list in the same order that they appear in list, irrespective of the forcing order imposed by the ORDERING-FORCE-FUNCTION.

The ORDERING-FORCE-FUNCTION can be any function which takes a list of values as its single argument that is guaranteed to force all variables in that list to be bound upon its return. The returned value of the ORDERING-FORCE-FUNCTION is ignored.

The user can construct her own ORDERING-FORCE-FUNCTION or use one of the following alternatives provided with Screamer:

(STATIC-ORDERING #’LINEAR-FORCE),
(STATIC-ORDERING #’DIVIDE-AND-CONQUER-FORCE),
(REORDER COST-FUN TERMINATE-TEST ORDER #’LINEAR-FORCE) and
(REORDER COST-FUN TERMINATE-TEST ORDER #’DIVIDE-AND-CONQUER-FORCE).

Future implementation of Screamer may provide additional forcing and ordering functions.

Package

screamer.

Source

screamer.lisp.

Function: static-ordering-internal (variables force-function)
Package

screamer.

Source

screamer.lisp.

Function: static-ordering-internal-nondeterministic (continuation-0 variables force-function)
Package

screamer.

Source

screamer.lisp.

Function: template-internal (template variables)
Package

screamer.

Source

screamer.lisp.

Function: transform-assert! (form polarity?)
Package

screamer.

Source

screamer.lisp.

Function: transform-decide (form polarity?)
Package

screamer.

Source

screamer.lisp.

Function: transform-known? (form polarity?)
Package

screamer.

Source

screamer.lisp.

Function: unwind-trail-to (trail-pointer)
Package

screamer.

Source

screamer.lisp.

Function: valid-function-name? (function-name)
Package

screamer.

Source

screamer.lisp.

Function: variable-boolean? (x)
Package

screamer.

Source

screamer.lisp.

Reader: variable-enumerated-antidomain (instance)
Writer: (setf variable-enumerated-antidomain) (instance)
Package

screamer.

Source

screamer.lisp.

Target Slot

enumerated-antidomain.

Reader: variable-enumerated-domain (instance)
Writer: (setf variable-enumerated-domain) (instance)
Package

screamer.

Source

screamer.lisp.

Target Slot

enumerated-domain.

Function: variable-false? (x)
Package

screamer.

Source

screamer.lisp.

Function: variable-integer? (x)
Package

screamer.

Source

screamer.lisp.

Reader: variable-lower-bound (instance)
Writer: (setf variable-lower-bound) (instance)
Package

screamer.

Source

screamer.lisp.

Target Slot

lower-bound.

Reader: variable-name (instance)
Writer: (setf variable-name) (instance)
Package

screamer.

Source

screamer.lisp.

Target Slot

name.

Function: variable-nonboolean? (x)
Package

screamer.

Source

screamer.lisp.

Function: variable-noninteger? (x)
Package

screamer.

Source

screamer.lisp.

Function: variable-nonnumber? (x)
Package

screamer.

Source

screamer.lisp.

Function: variable-nonreal? (x)
Package

screamer.

Source

screamer.lisp.

Reader: variable-noticers (instance)
Writer: (setf variable-noticers) (instance)
Package

screamer.

Source

screamer.lisp.

Target Slot

noticers.

Function: variable-number? (x)
Package

screamer.

Source

screamer.lisp.

Reader: variable-possibly-boolean? (instance)
Writer: (setf variable-possibly-boolean?) (instance)
Package

screamer.

Source

screamer.lisp.

Target Slot

possibly-boolean?.

Reader: variable-possibly-integer? (instance)
Writer: (setf variable-possibly-integer?) (instance)
Package

screamer.

Source

screamer.lisp.

Target Slot

possibly-integer?.

Reader: variable-possibly-nonboolean-nonnumber? (instance)
Writer: (setf variable-possibly-nonboolean-nonnumber?) (instance)
Package

screamer.

Source

screamer.lisp.

Target Slot

possibly-nonboolean-nonnumber?.

Reader: variable-possibly-noninteger-real? (instance)
Writer: (setf variable-possibly-noninteger-real?) (instance)
Package

screamer.

Source

screamer.lisp.

Target Slot

possibly-noninteger-real?.

Reader: variable-possibly-nonreal-number? (instance)
Writer: (setf variable-possibly-nonreal-number?) (instance)
Package

screamer.

Source

screamer.lisp.

Target Slot

possibly-nonreal-number?.

Function: variable-real? (x)
Package

screamer.

Source

screamer.lisp.

Function: variable-true? (x)
Package

screamer.

Source

screamer.lisp.

Reader: variable-upper-bound (instance)
Writer: (setf variable-upper-bound) (instance)
Package

screamer.

Source

screamer.lisp.

Target Slot

upper-bound.

Reader: variable-value (instance)
Writer: (setf variable-value) (instance)
Package

screamer.

Source

screamer.lisp.

Target Slot

value.

Function: variable? (object)
Package

screamer.

Source

screamer.lisp.

Function: variables-in (x)
Package

screamer.

Source

screamer.lisp.

Function: variablize (x)
Package

screamer.

Source

screamer.lisp.

Function: void-continuation (continuation)
Package

screamer.

Source

screamer.lisp.

Function: walk (map-function reduce-function screamer? partial? nested? form environment)
Package

screamer.

Source

screamer.lisp.

Function: walk-block (map-function reduce-function screamer? partial? nested? form environment)
Package

screamer.

Source

screamer.lisp.

Function: walk-catch (map-function reduce-function screamer? partial? nested? form environment)
Package

screamer.

Source

screamer.lisp.

Function: walk-eval-when (map-function reduce-function screamer? partial? nested? form environment)
Package

screamer.

Source

screamer.lisp.

Function: walk-flet/labels (map-function reduce-function screamer? partial? nested? form environment form-type)
Package

screamer.

Source

screamer.lisp.

Function: walk-for-effects (map-function reduce-function screamer? partial? nested? form environment)
Package

screamer.

Source

screamer.lisp.

Function: walk-full (map-function form)
Package

screamer.

Source

screamer.lisp.

Function: walk-function (map-function reduce-function screamer? partial? nested? form environment)
Package

screamer.

Source

screamer.lisp.

Function: walk-function-call (map-function reduce-function screamer? partial? nested? form environment)
Package

screamer.

Source

screamer.lisp.

Function: walk-go (map-function form)
Package

screamer.

Source

screamer.lisp.

Function: walk-if (map-function reduce-function screamer? partial? nested? form environment)
Package

screamer.

Source

screamer.lisp.

Function: walk-lambda-list (map-function reduce-function screamer? partial? nested? lambda-list environment)
Package

screamer.

Source

screamer.lisp.

Function: walk-lambda-list-reducing (map-function reduce-function screamer? partial? nested? lambda-list environment &optional mode)
Package

screamer.

Source

screamer.lisp.

Function: walk-let/let* (map-function reduce-function screamer? partial? nested? form environment form-type)
Package

screamer.

Source

screamer.lisp.

Function: walk-macro-call (map-function reduce-function screamer? partial? nested? form environment)
Package

screamer.

Source

screamer.lisp.

Function: walk-multiple-value-call (map-function reduce-function screamer? partial? nested? form environment)
Package

screamer.

Source

screamer.lisp.

Function: walk-multiple-value-call-nondeterministic (map-function reduce-function screamer? partial? nested? form environment)
Package

screamer.

Source

screamer.lisp.

Function: walk-multiple-value-prog1 (map-function reduce-function screamer? partial? nested? form environment)
Package

screamer.

Source

screamer.lisp.

Function: walk-progn (map-function reduce-function screamer? partial? nested? form environment)
Package

screamer.

Source

screamer.lisp.

Function: walk-progv (map-function reduce-function screamer? partial? nested? form environment)
Package

screamer.

Source

screamer.lisp.

Function: walk-quote (map-function form)
Package

screamer.

Source

screamer.lisp.

Function: walk-return-from (map-function reduce-function screamer? partial? nested? form environment)
Package

screamer.

Source

screamer.lisp.

Function: walk-setf (map-function reduce-function screamer? partial? nested? form environment)
Package

screamer.

Source

screamer.lisp.

Function: walk-setq (map-function reduce-function screamer? partial? nested? form environment)
Package

screamer.

Source

screamer.lisp.

Function: walk-tagbody (map-function reduce-function screamer? partial? nested? form environment)
Package

screamer.

Source

screamer.lisp.

Function: walk-the (map-function reduce-function screamer? partial? nested? form environment)
Package

screamer.

Source

screamer.lisp.

Function: walk-throw (map-function reduce-function screamer? partial? nested? form environment)
Package

screamer.

Source

screamer.lisp.

Function: walk-unwind-protect (map-function reduce-function screamer? partial? nested? form environment)
Package

screamer.

Source

screamer.lisp.

Function: y-or-n-p (&optional format-string &rest format-args)
Package

screamer.

Source

screamer.lisp.


5.2.4 Structures

Structure: function-record
Package

screamer.

Source

screamer.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: function-name
Readers

function-record-function-name.

Writers

(setf function-record-function-name).

Slot: lambda-list
Readers

function-record-lambda-list.

Writers

(setf function-record-lambda-list).

Slot: body
Readers

function-record-body.

Writers

(setf function-record-body).

Slot: callees
Readers

function-record-callees.

Writers

(setf function-record-callees).

Slot: deterministic?
Initform

t

Readers

function-record-deterministic?.

Writers

(setf function-record-deterministic?).

Slot: old-deterministic?
Readers

function-record-old-deterministic?.

Writers

(setf function-record-old-deterministic?).

Slot: screamer?
Initform

screamer::*screamer?*

Readers

function-record-screamer?.

Writers

(setf function-record-screamer?).

Structure: nondeterministic-function
Package

screamer.

Source

screamer.lisp.

Direct superclasses

structure-object.

Direct methods

print-object.

Direct slots
Slot: function
Package

common-lisp.

Readers

nondeterministic-function-function.

Writers

(setf nondeterministic-function-function).

Structure: variable
Package

screamer.

Source

screamer.lisp.

Direct superclasses

structure-object.

Direct methods

print-object.

Direct slots
Slot: name
Readers

variable-name.

Writers

(setf variable-name).

Slot: noticers
Readers

variable-noticers.

Writers

(setf variable-noticers).

Slot: enumerated-domain
Initform

t

Readers

variable-enumerated-domain.

Writers

(setf variable-enumerated-domain).

Slot: enumerated-antidomain
Readers

variable-enumerated-antidomain.

Writers

(setf variable-enumerated-antidomain).

Slot: value
Readers

variable-value.

Writers

(setf variable-value).

Slot: possibly-integer?
Initform

t

Readers

variable-possibly-integer?.

Writers

(setf variable-possibly-integer?).

Slot: possibly-noninteger-real?
Initform

t

Readers

variable-possibly-noninteger-real?.

Writers

(setf variable-possibly-noninteger-real?).

Slot: possibly-nonreal-number?
Initform

t

Readers

variable-possibly-nonreal-number?.

Writers

(setf variable-possibly-nonreal-number?).

Slot: possibly-boolean?
Initform

t

Readers

variable-possibly-boolean?.

Writers

(setf variable-possibly-boolean?).

Slot: possibly-nonboolean-nonnumber?
Initform

t

Readers

variable-possibly-nonboolean-nonnumber?.

Writers

(setf variable-possibly-nonboolean-nonnumber?).

Slot: lower-bound
Readers

variable-lower-bound.

Writers

(setf variable-lower-bound).

Slot: upper-bound
Readers

variable-upper-bound.

Writers

(setf variable-upper-bound).


Appendix A Indexes


Next: , Previous: , Up: Indexes   [Contents][Index]

A.1 Concepts


Next: , Previous: , Up: Indexes   [Contents][Index]

A.2 Functions

Jump to:   (   *   +   -   /   <   =   >  
A   B   C   D   E   F   G   I   K   L   M   N   O   P   Q   R   S   T   U   V   W   Y  
Index Entry  Section

(
(setf function-record-body): Private ordinary functions
(setf function-record-callees): Private ordinary functions
(setf function-record-deterministic?): Private ordinary functions
(setf function-record-function-name): Private ordinary functions
(setf function-record-lambda-list): Private ordinary functions
(setf function-record-old-deterministic?): Private ordinary functions
(setf function-record-screamer?): Private ordinary functions
(setf nondeterministic-function-function): Private ordinary functions
(setf variable-enumerated-antidomain): Private ordinary functions
(setf variable-enumerated-domain): Private ordinary functions
(setf variable-lower-bound): Private ordinary functions
(setf variable-name): Private ordinary functions
(setf variable-noticers): Private ordinary functions
(setf variable-possibly-boolean?): Private ordinary functions
(setf variable-possibly-integer?): Private ordinary functions
(setf variable-possibly-nonboolean-nonnumber?): Private ordinary functions
(setf variable-possibly-noninteger-real?): Private ordinary functions
(setf variable-possibly-nonreal-number?): Private ordinary functions
(setf variable-upper-bound): Private ordinary functions
(setf variable-value): Private ordinary functions

*
*-rule-down: Private ordinary functions
*-rule-up: Private ordinary functions
*v: Public ordinary functions
*v-internal: Private ordinary functions
*v2: Private ordinary functions

+
+-rule-down: Private ordinary functions
+-rule-up: Private ordinary functions
+v: Public ordinary functions
+v-internal: Private ordinary functions
+v2: Private ordinary functions

-
-v: Public ordinary functions
-v-internal: Private ordinary functions
-v2: Private ordinary functions

/
/-rule: Private ordinary functions
/=-rule: Private ordinary functions
/=v: Public ordinary functions
/=v-internal: Private ordinary functions
/=v2: Private ordinary functions
/v: Public ordinary functions
/v-internal: Private ordinary functions
/v2: Private ordinary functions

<
<-rule: Private ordinary functions
<=-rule: Private ordinary functions
<=v: Public ordinary functions
<=v-internal: Private ordinary functions
<=v2: Private ordinary functions
<v: Public ordinary functions
<v-internal: Private ordinary functions
<v2: Private ordinary functions

=
=-rule: Private ordinary functions
=v: Public ordinary functions
=v-internal: Private ordinary functions
=v2: Private ordinary functions

>
>=v: Public ordinary functions
>=v-internal: Private ordinary functions
>v: Public ordinary functions
>v-internal: Private ordinary functions

A
a-boolean: Public ordinary functions
a-boolean-nondeterministic: Private ordinary functions
a-booleanv: Public ordinary functions
a-member-of: Public ordinary functions
a-member-of-nondeterministic: Private ordinary functions
a-member-ofv: Public ordinary functions
a-numberv: Public ordinary functions
a-real-abovev: Public ordinary functions
a-real-belowv: Public ordinary functions
a-real-betweenv: Public ordinary functions
a-realv: Public ordinary functions
a-tuple: Private ordinary functions
a-tuple-nondeterministic: Private ordinary functions
all-values: Public macros
an-integer: Public ordinary functions
an-integer-above: Public ordinary functions
an-integer-above-nondeterministic: Private ordinary functions
an-integer-abovev: Public ordinary functions
an-integer-below: Public ordinary functions
an-integer-below-nondeterministic: Private ordinary functions
an-integer-belowv: Public ordinary functions
an-integer-between: Public ordinary functions
an-integer-between-nondeterministic: Private ordinary functions
an-integer-betweenv: Public ordinary functions
an-integer-nondeterministic: Private ordinary functions
an-integerv: Public ordinary functions
andv: Public ordinary functions
andv-internal: Private ordinary functions
apply-nondeterministic: Public ordinary functions
apply-nondeterministic-nondeterministic: Private ordinary functions
apply-substitution: Public ordinary functions
applyv: Public ordinary functions
arguments-for-applyv: Private ordinary functions
assert!: Public macros
assert!-/=v: Private ordinary functions
assert!-/=v-internal: Private ordinary functions
assert!-/=v2: Private ordinary functions
assert!-<=v: Private ordinary functions
assert!-<=v-internal: Private ordinary functions
assert!-<=v2: Private ordinary functions
assert!-<v: Private ordinary functions
assert!-<v-internal: Private ordinary functions
assert!-<v2: Private ordinary functions
assert!-=v: Private ordinary functions
assert!-=v-internal: Private ordinary functions
assert!-=v2: Private ordinary functions
assert!->=v: Private ordinary functions
assert!->=v-internal: Private ordinary functions
assert!->v: Private ordinary functions
assert!->v-internal: Private ordinary functions
assert!-applyv: Private ordinary functions
assert!-booleanpv: Private ordinary functions
assert!-clause: Private ordinary functions
assert!-constraint: Private ordinary functions
assert!-constraint-ac: Private ordinary functions
assert!-constraint-gfc: Private ordinary functions
assert!-equalv: Private ordinary functions
assert!-false: Private ordinary functions
assert!-funcallv: Private ordinary functions
assert!-integerpv: Private ordinary functions
assert!-memberv: Private ordinary functions
assert!-memberv-internal: Private ordinary functions
assert!-notv-andv: Private ordinary functions
assert!-notv-andv-internal: Private ordinary functions
assert!-notv-applyv: Private ordinary functions
assert!-notv-booleanpv: Private ordinary functions
assert!-notv-equalv: Private ordinary functions
assert!-notv-funcallv: Private ordinary functions
assert!-notv-integerpv: Private ordinary functions
assert!-notv-memberv: Private ordinary functions
assert!-notv-memberv-internal: Private ordinary functions
assert!-notv-numberpv: Private ordinary functions
assert!-notv-realpv: Private ordinary functions
assert!-numberpv: Private ordinary functions
assert!-orv: Private ordinary functions
assert!-orv-internal: Private ordinary functions
assert!-realpv: Private ordinary functions
assert!-true: Private ordinary functions
attach-noticer!: Private ordinary functions
attach-noticer!-internal: Private ordinary functions

B
best-value: Public macros
booleanp: Public ordinary functions
booleanpv: Public ordinary functions
bound?: Public ordinary functions

C
cache-definition: Private ordinary functions
callees: Private ordinary functions
callers: Private ordinary functions
check-function-name: Private ordinary functions
check-lambda-list: Private ordinary functions
check-lambda-list-internal: Private ordinary functions
choice-point: Private macros
choice-point-external: Private macros
choice-point-internal: Private macros
compute-callees: Private ordinary functions
contains-local-setf/setq?: Private ordinary functions
contains-variables?: Private ordinary functions
copy-function-record: Private ordinary functions
copy-nondeterministic-function: Private ordinary functions
copy-variable: Private ordinary functions
corrupted?: Private ordinary functions
count-failures: Public macros
count-trues: Public ordinary functions
count-trues-internal: Private ordinary functions
count-truesv: Public ordinary functions
count-truesv-internal: Private ordinary functions
cps-convert: Private ordinary functions
cps-convert-block: Private ordinary functions
cps-convert-call: Private ordinary functions
cps-convert-function-name: Private ordinary functions
cps-convert-if: Private ordinary functions
cps-convert-let: Private ordinary functions
cps-convert-let*: Private ordinary functions
cps-convert-local-setf/setq: Private ordinary functions
cps-convert-multiple-value-call: Private ordinary functions
cps-convert-multiple-value-call-internal: Private ordinary functions
cps-convert-multiple-value-prog1: Private ordinary functions
cps-convert-progn: Private ordinary functions
cps-convert-return-from: Private ordinary functions
cps-convert-setq: Private ordinary functions
cps-convert-tagbody: Private ordinary functions
cps-non-convert-call: Private ordinary functions

D
decide: Public macros
declare-deterministic: Private ordinary functions
declare-nondeterministic: Private ordinary functions
define-screamer-package: Public macros
defmacro-compile-time: Private macros
defstruct-compile-time: Private macros
defun: Private macros
defun-compile-time: Private macros
defvar-compile-time: Private macros
determine-whether-callers-are-deterministic: Private ordinary functions
determine-whether-deterministic: Private ordinary functions
deterministic-lambda-list?: Private ordinary functions
deterministic?: Private ordinary functions
divide-and-conquer-force: Public ordinary functions
divide-and-conquer-force-nondeterministic: Private ordinary functions
domain-size: Public ordinary functions

E
either: Public macros
eliminate-variables: Private ordinary functions
emacs-eval: Private ordinary functions
equalv: Public ordinary functions
every-other: Private ordinary functions
expand-local-setf: Private ordinary functions
expand-local-setq: Private ordinary functions

F
fail: Public ordinary functions
find-best: Private ordinary functions
finite-domain?: Private ordinary functions
for-effects: Public macros
form-callees: Private ordinary functions
funcall-nondeterministic: Public ordinary functions
funcall-nondeterministic-nondeterministic: Private ordinary functions
funcallv: Public ordinary functions
Function, (setf function-record-body): Private ordinary functions
Function, (setf function-record-callees): Private ordinary functions
Function, (setf function-record-deterministic?): Private ordinary functions
Function, (setf function-record-function-name): Private ordinary functions
Function, (setf function-record-lambda-list): Private ordinary functions
Function, (setf function-record-old-deterministic?): Private ordinary functions
Function, (setf function-record-screamer?): Private ordinary functions
Function, (setf nondeterministic-function-function): Private ordinary functions
Function, (setf variable-enumerated-antidomain): Private ordinary functions
Function, (setf variable-enumerated-domain): Private ordinary functions
Function, (setf variable-lower-bound): Private ordinary functions
Function, (setf variable-name): Private ordinary functions
Function, (setf variable-noticers): Private ordinary functions
Function, (setf variable-possibly-boolean?): Private ordinary functions
Function, (setf variable-possibly-integer?): Private ordinary functions
Function, (setf variable-possibly-nonboolean-nonnumber?): Private ordinary functions
Function, (setf variable-possibly-noninteger-real?): Private ordinary functions
Function, (setf variable-possibly-nonreal-number?): Private ordinary functions
Function, (setf variable-upper-bound): Private ordinary functions
Function, (setf variable-value): Private ordinary functions
Function, *-rule-down: Private ordinary functions
Function, *-rule-up: Private ordinary functions
Function, *v: Public ordinary functions
Function, *v-internal: Private ordinary functions
Function, *v2: Private ordinary functions
Function, +-rule-down: Private ordinary functions
Function, +-rule-up: Private ordinary functions
Function, +v: Public ordinary functions
Function, +v-internal: Private ordinary functions
Function, +v2: Private ordinary functions
Function, -v: Public ordinary functions
Function, -v-internal: Private ordinary functions
Function, -v2: Private ordinary functions
Function, /-rule: Private ordinary functions
Function, /=-rule: Private ordinary functions
Function, /=v: Public ordinary functions
Function, /=v-internal: Private ordinary functions
Function, /=v2: Private ordinary functions
Function, /v: Public ordinary functions
Function, /v-internal: Private ordinary functions
Function, /v2: Private ordinary functions
Function, <-rule: Private ordinary functions
Function, <=-rule: Private ordinary functions
Function, <=v: Public ordinary functions
Function, <=v-internal: Private ordinary functions
Function, <=v2: Private ordinary functions
Function, <v: Public ordinary functions
Function, <v-internal: Private ordinary functions
Function, <v2: Private ordinary functions
Function, =-rule: Private ordinary functions
Function, =v: Public ordinary functions
Function, =v-internal: Private ordinary functions
Function, =v2: Private ordinary functions
Function, >=v: Public ordinary functions
Function, >=v-internal: Private ordinary functions
Function, >v: Public ordinary functions
Function, >v-internal: Private ordinary functions
Function, a-boolean: Public ordinary functions
Function, a-boolean-nondeterministic: Private ordinary functions
Function, a-booleanv: Public ordinary functions
Function, a-member-of: Public ordinary functions
Function, a-member-of-nondeterministic: Private ordinary functions
Function, a-member-ofv: Public ordinary functions
Function, a-numberv: Public ordinary functions
Function, a-real-abovev: Public ordinary functions
Function, a-real-belowv: Public ordinary functions
Function, a-real-betweenv: Public ordinary functions
Function, a-realv: Public ordinary functions
Function, a-tuple: Private ordinary functions
Function, a-tuple-nondeterministic: Private ordinary functions
Function, an-integer: Public ordinary functions
Function, an-integer-above: Public ordinary functions
Function, an-integer-above-nondeterministic: Private ordinary functions
Function, an-integer-abovev: Public ordinary functions
Function, an-integer-below: Public ordinary functions
Function, an-integer-below-nondeterministic: Private ordinary functions
Function, an-integer-belowv: Public ordinary functions
Function, an-integer-between: Public ordinary functions
Function, an-integer-between-nondeterministic: Private ordinary functions
Function, an-integer-betweenv: Public ordinary functions
Function, an-integer-nondeterministic: Private ordinary functions
Function, an-integerv: Public ordinary functions
Function, andv: Public ordinary functions
Function, andv-internal: Private ordinary functions
Function, apply-nondeterministic: Public ordinary functions
Function, apply-nondeterministic-nondeterministic: Private ordinary functions
Function, apply-substitution: Public ordinary functions
Function, applyv: Public ordinary functions
Function, arguments-for-applyv: Private ordinary functions
Function, assert!-/=v: Private ordinary functions
Function, assert!-/=v-internal: Private ordinary functions
Function, assert!-/=v2: Private ordinary functions
Function, assert!-<=v: Private ordinary functions
Function, assert!-<=v-internal: Private ordinary functions
Function, assert!-<=v2: Private ordinary functions
Function, assert!-<v: Private ordinary functions
Function, assert!-<v-internal: Private ordinary functions
Function, assert!-<v2: Private ordinary functions
Function, assert!-=v: Private ordinary functions
Function, assert!-=v-internal: Private ordinary functions
Function, assert!-=v2: Private ordinary functions
Function, assert!->=v: Private ordinary functions
Function, assert!->=v-internal: Private ordinary functions
Function, assert!->v: Private ordinary functions
Function, assert!->v-internal: Private ordinary functions
Function, assert!-applyv: Private ordinary functions
Function, assert!-booleanpv: Private ordinary functions
Function, assert!-clause: Private ordinary functions
Function, assert!-constraint: Private ordinary functions
Function, assert!-constraint-ac: Private ordinary functions
Function, assert!-constraint-gfc: Private ordinary functions
Function, assert!-equalv: Private ordinary functions
Function, assert!-false: Private ordinary functions
Function, assert!-funcallv: Private ordinary functions
Function, assert!-integerpv: Private ordinary functions
Function, assert!-memberv: Private ordinary functions
Function, assert!-memberv-internal: Private ordinary functions
Function, assert!-notv-andv: Private ordinary functions
Function, assert!-notv-andv-internal: Private ordinary functions
Function, assert!-notv-applyv: Private ordinary functions
Function, assert!-notv-booleanpv: Private ordinary functions
Function, assert!-notv-equalv: Private ordinary functions
Function, assert!-notv-funcallv: Private ordinary functions
Function, assert!-notv-integerpv: Private ordinary functions
Function, assert!-notv-memberv: Private ordinary functions
Function, assert!-notv-memberv-internal: Private ordinary functions
Function, assert!-notv-numberpv: Private ordinary functions
Function, assert!-notv-realpv: Private ordinary functions
Function, assert!-numberpv: Private ordinary functions
Function, assert!-orv: Private ordinary functions
Function, assert!-orv-internal: Private ordinary functions
Function, assert!-realpv: Private ordinary functions
Function, assert!-true: Private ordinary functions
Function, attach-noticer!: Private ordinary functions
Function, attach-noticer!-internal: Private ordinary functions
Function, booleanp: Public ordinary functions
Function, booleanpv: Public ordinary functions
Function, bound?: Public ordinary functions
Function, cache-definition: Private ordinary functions
Function, callees: Private ordinary functions
Function, callers: Private ordinary functions
Function, check-function-name: Private ordinary functions
Function, check-lambda-list: Private ordinary functions
Function, check-lambda-list-internal: Private ordinary functions
Function, compute-callees: Private ordinary functions
Function, contains-local-setf/setq?: Private ordinary functions
Function, contains-variables?: Private ordinary functions
Function, copy-function-record: Private ordinary functions
Function, copy-nondeterministic-function: Private ordinary functions
Function, copy-variable: Private ordinary functions
Function, corrupted?: Private ordinary functions
Function, count-trues: Public ordinary functions
Function, count-trues-internal: Private ordinary functions
Function, count-truesv: Public ordinary functions
Function, count-truesv-internal: Private ordinary functions
Function, cps-convert: Private ordinary functions
Function, cps-convert-block: Private ordinary functions
Function, cps-convert-call: Private ordinary functions
Function, cps-convert-function-name: Private ordinary functions
Function, cps-convert-if: Private ordinary functions
Function, cps-convert-let: Private ordinary functions
Function, cps-convert-let*: Private ordinary functions
Function, cps-convert-local-setf/setq: Private ordinary functions
Function, cps-convert-multiple-value-call: Private ordinary functions
Function, cps-convert-multiple-value-call-internal: Private ordinary functions
Function, cps-convert-multiple-value-prog1: Private ordinary functions
Function, cps-convert-progn: Private ordinary functions
Function, cps-convert-return-from: Private ordinary functions
Function, cps-convert-setq: Private ordinary functions
Function, cps-convert-tagbody: Private ordinary functions
Function, cps-non-convert-call: Private ordinary functions
Function, declare-deterministic: Private ordinary functions
Function, declare-nondeterministic: Private ordinary functions
Function, determine-whether-callers-are-deterministic: Private ordinary functions
Function, determine-whether-deterministic: Private ordinary functions
Function, deterministic-lambda-list?: Private ordinary functions
Function, deterministic?: Private ordinary functions
Function, divide-and-conquer-force: Public ordinary functions
Function, divide-and-conquer-force-nondeterministic: Private ordinary functions
Function, domain-size: Public ordinary functions
Function, eliminate-variables: Private ordinary functions
Function, emacs-eval: Private ordinary functions
Function, equalv: Public ordinary functions
Function, every-other: Private ordinary functions
Function, expand-local-setf: Private ordinary functions
Function, expand-local-setq: Private ordinary functions
Function, fail: Public ordinary functions
Function, find-best: Private ordinary functions
Function, finite-domain?: Private ordinary functions
Function, form-callees: Private ordinary functions
Function, funcall-nondeterministic: Public ordinary functions
Function, funcall-nondeterministic-nondeterministic: Private ordinary functions
Function, funcallv: Public ordinary functions
Function, function-definition: Private ordinary functions
Function, function-record-body: Private ordinary functions
Function, function-record-callees: Private ordinary functions
Function, function-record-deterministic?: Private ordinary functions
Function, function-record-function-name: Private ordinary functions
Function, function-record-lambda-list: Private ordinary functions
Function, function-record-old-deterministic?: Private ordinary functions
Function, function-record-p: Private ordinary functions
Function, function-record-screamer?: Private ordinary functions
Function, get-function-record: Private ordinary functions
Function, ground?: Public ordinary functions
Function, indirect-callees: Private ordinary functions
Function, indirect-callees-internal: Private ordinary functions
Function, indirect-callers: Private ordinary functions
Function, indirect-callers-internal: Private ordinary functions
Function, infinity-*: Private ordinary functions
Function, infinity-+: Private ordinary functions
Function, infinity--: Private ordinary functions
Function, infinity-max: Private ordinary functions
Function, infinity-min: Private ordinary functions
Function, integerpv: Public ordinary functions
Function, integers-between: Private ordinary functions
Function, is-magic-continuation?: Private ordinary functions
Function, is-magic-declaration?: Private ordinary functions
Function, known?-/=v: Private ordinary functions
Function, known?-/=v-internal: Private ordinary functions
Function, known?-/=v2: Private ordinary functions
Function, known?-/=v2-internal: Private ordinary functions
Function, known?-/=v2-variable: Private ordinary functions
Function, known?-<=v: Private ordinary functions
Function, known?-<=v-internal: Private ordinary functions
Function, known?-<=v2: Private ordinary functions
Function, known?-<=v2-internal: Private ordinary functions
Function, known?-<=v2-variable: Private ordinary functions
Function, known?-<v: Private ordinary functions
Function, known?-<v-internal: Private ordinary functions
Function, known?-<v2: Private ordinary functions
Function, known?-<v2-internal: Private ordinary functions
Function, known?-<v2-variable: Private ordinary functions
Function, known?-=v: Private ordinary functions
Function, known?-=v-internal: Private ordinary functions
Function, known?-=v2: Private ordinary functions
Function, known?-=v2-internal: Private ordinary functions
Function, known?-=v2-variable: Private ordinary functions
Function, known?->=v: Private ordinary functions
Function, known?->=v-internal: Private ordinary functions
Function, known?->v: Private ordinary functions
Function, known?->v-internal: Private ordinary functions
Function, known?-applyv: Private ordinary functions
Function, known?-booleanpv: Private ordinary functions
Function, known?-constraint: Private ordinary functions
Function, known?-equalv: Private ordinary functions
Function, known?-false: Private ordinary functions
Function, known?-funcallv: Private ordinary functions
Function, known?-integerpv: Private ordinary functions
Function, known?-memberv: Private ordinary functions
Function, known?-memberv-internal: Private ordinary functions
Function, known?-memberv-list: Private ordinary functions
Function, known?-memberv-list-internal: Private ordinary functions
Function, known?-notv-applyv: Private ordinary functions
Function, known?-notv-booleanpv: Private ordinary functions
Function, known?-notv-equalv: Private ordinary functions
Function, known?-notv-funcallv: Private ordinary functions
Function, known?-notv-integerpv: Private ordinary functions
Function, known?-notv-memberv: Private ordinary functions
Function, known?-notv-memberv-internal: Private ordinary functions
Function, known?-notv-memberv-list: Private ordinary functions
Function, known?-notv-memberv-list-internal: Private ordinary functions
Function, known?-notv-numberpv: Private ordinary functions
Function, known?-notv-realpv: Private ordinary functions
Function, known?-numberpv: Private ordinary functions
Function, known?-realpv: Private ordinary functions
Function, known?-true: Private ordinary functions
Function, lambda-expression?: Private ordinary functions
Function, linear-force: Public ordinary functions
Function, linear-force-nondeterministic: Private ordinary functions
Function, magic-continuation-argument: Private ordinary functions
Function, make-function-record: Private ordinary functions
Function, make-nondeterministic-function: Private ordinary functions
Function, make-variable: Public ordinary functions
Function, make-variable-internal: Private ordinary functions
Function, max-rule-down: Private ordinary functions
Function, max-rule-up: Private ordinary functions
Function, maxv: Public ordinary functions
Function, maxv-internal: Private ordinary functions
Function, maxv2: Private ordinary functions
Function, memberv: Public ordinary functions
Function, min-rule-down: Private ordinary functions
Function, min-rule-up: Private ordinary functions
Function, minv: Public ordinary functions
Function, minv-internal: Private ordinary functions
Function, minv2: Private ordinary functions
Function, modified-function-definitions: Private ordinary functions
Function, multiple-value-call-nondeterministic: Public ordinary functions
Function, needs-substitution?: Private ordinary functions
Function, nondeterministic-function-function: Private ordinary functions
Function, nondeterministic-function?: Public ordinary functions
Function, nondeterministic-function?-internal: Private ordinary functions
Function, notv: Public ordinary functions
Function, numberpv: Public ordinary functions
Function, occurs-in?: Private ordinary functions
Function, orv: Public ordinary functions
Function, orv-internal: Private ordinary functions
Function, peal-off-documentation-string-and-declarations: Private ordinary functions
Function, perform-substitutions: Private ordinary functions
Function, possibly-beta-reduce-funcall: Private ordinary functions
Function, print-nondeterministic-function: Private ordinary functions
Function, print-variable: Private ordinary functions
Function, process-subforms: Private ordinary functions
Function, propagate-ac: Private ordinary functions
Function, propagate-gfc: Private ordinary functions
Function, prune-enumerated-domain: Private ordinary functions
Function, purge: Public ordinary functions
Function, quotify: Private ordinary functions
Function, range-size: Public ordinary functions
Function, realpv: Public ordinary functions
Function, reorder: Public ordinary functions
Function, reorder-internal: Private ordinary functions
Function, reorder-internal-nondeterministic: Private ordinary functions
Function, restrict-boolean!: Private ordinary functions
Function, restrict-bounds!: Private ordinary functions
Function, restrict-enumerated-antidomain!: Private ordinary functions
Function, restrict-enumerated-domain!: Private ordinary functions
Function, restrict-false!: Private ordinary functions
Function, restrict-integer!: Private ordinary functions
Function, restrict-lower-bound!: Private ordinary functions
Function, restrict-nonboolean!: Private ordinary functions
Function, restrict-noninteger!: Private ordinary functions
Function, restrict-nonnumber!: Private ordinary functions
Function, restrict-nonreal!: Private ordinary functions
Function, restrict-number!: Private ordinary functions
Function, restrict-real!: Private ordinary functions
Function, restrict-true!: Private ordinary functions
Function, restrict-upper-bound!: Private ordinary functions
Function, restrict-value!: Private ordinary functions
Function, run-noticers: Private ordinary functions
Function, screamer-error: Private ordinary functions
Function, self-evaluating?: Private ordinary functions
Function, set-enumerated-domain!: Private ordinary functions
Function, share!: Private ordinary functions
Function, solution: Public ordinary functions
Function, solution-nondeterministic: Private ordinary functions
Function, static-ordering: Public ordinary functions
Function, static-ordering-internal: Private ordinary functions
Function, static-ordering-internal-nondeterministic: Private ordinary functions
Function, template: Public ordinary functions
Function, template-internal: Private ordinary functions
Function, trail: Public ordinary functions
Function, transform-assert!: Private ordinary functions
Function, transform-decide: Private ordinary functions
Function, transform-known?: Private ordinary functions
Function, unwedge-screamer: Public ordinary functions
Function, unwind-trail: Public ordinary functions
Function, unwind-trail-to: Private ordinary functions
Function, valid-function-name?: Private ordinary functions
Function, value-of: Public ordinary functions
Function, variable-boolean?: Private ordinary functions
Function, variable-enumerated-antidomain: Private ordinary functions
Function, variable-enumerated-domain: Private ordinary functions
Function, variable-false?: Private ordinary functions
Function, variable-integer?: Private ordinary functions
Function, variable-lower-bound: Private ordinary functions
Function, variable-name: Private ordinary functions
Function, variable-nonboolean?: Private ordinary functions
Function, variable-noninteger?: Private ordinary functions
Function, variable-nonnumber?: Private ordinary functions
Function, variable-nonreal?: Private ordinary functions
Function, variable-noticers: Private ordinary functions
Function, variable-number?: Private ordinary functions
Function, variable-possibly-boolean?: Private ordinary functions
Function, variable-possibly-integer?: Private ordinary functions
Function, variable-possibly-nonboolean-nonnumber?: Private ordinary functions
Function, variable-possibly-noninteger-real?: Private ordinary functions
Function, variable-possibly-nonreal-number?: Private ordinary functions
Function, variable-real?: Private ordinary functions
Function, variable-true?: Private ordinary functions
Function, variable-upper-bound: Private ordinary functions
Function, variable-value: Private ordinary functions
Function, variable?: Private ordinary functions
Function, variables-in: Private ordinary functions
Function, variablize: Private ordinary functions
Function, void-continuation: Private ordinary functions
Function, walk: Private ordinary functions
Function, walk-block: Private ordinary functions
Function, walk-catch: Private ordinary functions
Function, walk-eval-when: Private ordinary functions
Function, walk-flet/labels: Private ordinary functions
Function, walk-for-effects: Private ordinary functions
Function, walk-full: Private ordinary functions
Function, walk-function: Private ordinary functions
Function, walk-function-call: Private ordinary functions
Function, walk-go: Private ordinary functions
Function, walk-if: Private ordinary functions
Function, walk-lambda-list: Private ordinary functions
Function, walk-lambda-list-reducing: Private ordinary functions
Function, walk-let/let*: Private ordinary functions
Function, walk-macro-call: Private ordinary functions
Function, walk-multiple-value-call: Private ordinary functions
Function, walk-multiple-value-call-nondeterministic: Private ordinary functions
Function, walk-multiple-value-prog1: Private ordinary functions
Function, walk-progn: Private ordinary functions
Function, walk-progv: Private ordinary functions
Function, walk-quote: Private ordinary functions
Function, walk-return-from: Private ordinary functions
Function, walk-setf: Private ordinary functions
Function, walk-setq: Private ordinary functions
Function, walk-tagbody: Private ordinary functions
Function, walk-the: Private ordinary functions
Function, walk-throw: Private ordinary functions
Function, walk-unwind-protect: Private ordinary functions
Function, y-or-n-p: Private ordinary functions
function-definition: Private ordinary functions
function-record-body: Private ordinary functions
function-record-callees: Private ordinary functions
function-record-deterministic?: Private ordinary functions
function-record-function-name: Private ordinary functions
function-record-lambda-list: Private ordinary functions
function-record-old-deterministic?: Private ordinary functions
function-record-p: Private ordinary functions
function-record-screamer?: Private ordinary functions

G
get-function-record: Private ordinary functions
global: Public macros
ground?: Public ordinary functions

I
indirect-callees: Private ordinary functions
indirect-callees-internal: Private ordinary functions
indirect-callers: Private ordinary functions
indirect-callers-internal: Private ordinary functions
infinity-*: Private ordinary functions
infinity-+: Private ordinary functions
infinity--: Private ordinary functions
infinity-max: Private ordinary functions
infinity-min: Private ordinary functions
integerpv: Public ordinary functions
integers-between: Private ordinary functions
is-magic-continuation?: Private ordinary functions
is-magic-declaration?: Private ordinary functions
ith-value: Public macros

K
known?: Public macros
known?-/=v: Private ordinary functions
known?-/=v-internal: Private ordinary functions
known?-/=v2: Private ordinary functions
known?-/=v2-internal: Private ordinary functions
known?-/=v2-variable: Private ordinary functions
known?-<=v: Private ordinary functions
known?-<=v-internal: Private ordinary functions
known?-<=v2: Private ordinary functions
known?-<=v2-internal: Private ordinary functions
known?-<=v2-variable: Private ordinary functions
known?-<v: Private ordinary functions
known?-<v-internal: Private ordinary functions
known?-<v2: Private ordinary functions
known?-<v2-internal: Private ordinary functions
known?-<v2-variable: Private ordinary functions
known?-=v: Private ordinary functions
known?-=v-internal: Private ordinary functions
known?-=v2: Private ordinary functions
known?-=v2-internal: Private ordinary functions
known?-=v2-variable: Private ordinary functions
known?->=v: Private ordinary functions
known?->=v-internal: Private ordinary functions
known?->v: Private ordinary functions
known?->v-internal: Private ordinary functions
known?-applyv: Private ordinary functions
known?-booleanpv: Private ordinary functions
known?-constraint: Private ordinary functions
known?-equalv: Private ordinary functions
known?-false: Private ordinary functions
known?-funcallv: Private ordinary functions
known?-integerpv: Private ordinary functions
known?-memberv: Private ordinary functions
known?-memberv-internal: Private ordinary functions
known?-memberv-list: Private ordinary functions
known?-memberv-list-internal: Private ordinary functions
known?-notv-applyv: Private ordinary functions
known?-notv-booleanpv: Private ordinary functions
known?-notv-equalv: Private ordinary functions
known?-notv-funcallv: Private ordinary functions
known?-notv-integerpv: Private ordinary functions
known?-notv-memberv: Private ordinary functions
known?-notv-memberv-internal: Private ordinary functions
known?-notv-memberv-list: Private ordinary functions
known?-notv-memberv-list-internal: Private ordinary functions
known?-notv-numberpv: Private ordinary functions
known?-notv-realpv: Private ordinary functions
known?-numberpv: Private ordinary functions
known?-realpv: Private ordinary functions
known?-true: Private ordinary functions

L
lambda-expression?: Private ordinary functions
linear-force: Public ordinary functions
linear-force-nondeterministic: Private ordinary functions
local: Public macros
local-output: Public macros

M
Macro, all-values: Public macros
Macro, assert!: Public macros
Macro, best-value: Public macros
Macro, choice-point: Private macros
Macro, choice-point-external: Private macros
Macro, choice-point-internal: Private macros
Macro, count-failures: Public macros
Macro, decide: Public macros
Macro, define-screamer-package: Public macros
Macro, defmacro-compile-time: Private macros
Macro, defstruct-compile-time: Private macros
Macro, defun: Private macros
Macro, defun-compile-time: Private macros
Macro, defvar-compile-time: Private macros
Macro, either: Public macros
Macro, for-effects: Public macros
Macro, global: Public macros
Macro, ith-value: Public macros
Macro, known?: Public macros
Macro, local: Public macros
Macro, local-output: Public macros
Macro, multiple-value-bind: Private macros
Macro, necessarily?: Public macros
Macro, one-value: Public macros
Macro, possibly?: Public macros
Macro, print-values: Public macros
Macro, when-failing: Public macros
magic-continuation-argument: Private ordinary functions
make-function-record: Private ordinary functions
make-nondeterministic-function: Private ordinary functions
make-variable: Public ordinary functions
make-variable-internal: Private ordinary functions
max-rule-down: Private ordinary functions
max-rule-up: Private ordinary functions
maxv: Public ordinary functions
maxv-internal: Private ordinary functions
maxv2: Private ordinary functions
memberv: Public ordinary functions
Method, print-object: Public standalone methods
Method, print-object: Public standalone methods
min-rule-down: Private ordinary functions
min-rule-up: Private ordinary functions
minv: Public ordinary functions
minv-internal: Private ordinary functions
minv2: Private ordinary functions
modified-function-definitions: Private ordinary functions
multiple-value-bind: Private macros
multiple-value-call-nondeterministic: Public ordinary functions

N
necessarily?: Public macros
needs-substitution?: Private ordinary functions
nondeterministic-function-function: Private ordinary functions
nondeterministic-function?: Public ordinary functions
nondeterministic-function?-internal: Private ordinary functions
notv: Public ordinary functions
numberpv: Public ordinary functions

O
occurs-in?: Private ordinary functions
one-value: Public macros
orv: Public ordinary functions
orv-internal: Private ordinary functions

P
peal-off-documentation-string-and-declarations: Private ordinary functions
perform-substitutions: Private ordinary functions
possibly-beta-reduce-funcall: Private ordinary functions
possibly?: Public macros
print-nondeterministic-function: Private ordinary functions
print-object: Public standalone methods
print-object: Public standalone methods
print-values: Public macros
print-variable: Private ordinary functions
process-subforms: Private ordinary functions
propagate-ac: Private ordinary functions
propagate-gfc: Private ordinary functions
prune-enumerated-domain: Private ordinary functions
purge: Public ordinary functions

Q
quotify: Private ordinary functions

R
range-size: Public ordinary functions
realpv: Public ordinary functions
reorder: Public ordinary functions
reorder-internal: Private ordinary functions
reorder-internal-nondeterministic: Private ordinary functions
restrict-boolean!: Private ordinary functions
restrict-bounds!: Private ordinary functions
restrict-enumerated-antidomain!: Private ordinary functions
restrict-enumerated-domain!: Private ordinary functions
restrict-false!: Private ordinary functions
restrict-integer!: Private ordinary functions
restrict-lower-bound!: Private ordinary functions
restrict-nonboolean!: Private ordinary functions
restrict-noninteger!: Private ordinary functions
restrict-nonnumber!: Private ordinary functions
restrict-nonreal!: Private ordinary functions
restrict-number!: Private ordinary functions
restrict-real!: Private ordinary functions
restrict-true!: Private ordinary functions
restrict-upper-bound!: Private ordinary functions
restrict-value!: Private ordinary functions
run-noticers: Private ordinary functions

S
screamer-error: Private ordinary functions
self-evaluating?: Private ordinary functions
set-enumerated-domain!: Private ordinary functions
share!: Private ordinary functions
solution: Public ordinary functions
solution-nondeterministic: Private ordinary functions
static-ordering: Public ordinary functions
static-ordering-internal: Private ordinary functions
static-ordering-internal-nondeterministic: Private ordinary functions

T
template: Public ordinary functions
template-internal: Private ordinary functions
trail: Public ordinary functions
transform-assert!: Private ordinary functions
transform-decide: Private ordinary functions
transform-known?: Private ordinary functions

U
unwedge-screamer: Public ordinary functions
unwind-trail: Public ordinary functions
unwind-trail-to: Private ordinary functions

V
valid-function-name?: Private ordinary functions
value-of: Public ordinary functions
variable-boolean?: Private ordinary functions
variable-enumerated-antidomain: Private ordinary functions
variable-enumerated-domain: Private ordinary functions
variable-false?: Private ordinary functions
variable-integer?: Private ordinary functions
variable-lower-bound: Private ordinary functions
variable-name: Private ordinary functions
variable-nonboolean?: Private ordinary functions
variable-noninteger?: Private ordinary functions
variable-nonnumber?: Private ordinary functions
variable-nonreal?: Private ordinary functions
variable-noticers: Private ordinary functions
variable-number?: Private ordinary functions
variable-possibly-boolean?: Private ordinary functions
variable-possibly-integer?: Private ordinary functions
variable-possibly-nonboolean-nonnumber?: Private ordinary functions
variable-possibly-noninteger-real?: Private ordinary functions
variable-possibly-nonreal-number?: Private ordinary functions
variable-real?: Private ordinary functions
variable-true?: Private ordinary functions
variable-upper-bound: Private ordinary functions
variable-value: Private ordinary functions
variable?: Private ordinary functions
variables-in: Private ordinary functions
variablize: Private ordinary functions
void-continuation: Private ordinary functions

W
walk: Private ordinary functions
walk-block: Private ordinary functions
walk-catch: Private ordinary functions
walk-eval-when: Private ordinary functions
walk-flet/labels: Private ordinary functions
walk-for-effects: Private ordinary functions
walk-full: Private ordinary functions
walk-function: Private ordinary functions
walk-function-call: Private ordinary functions
walk-go: Private ordinary functions
walk-if: Private ordinary functions
walk-lambda-list: Private ordinary functions
walk-lambda-list-reducing: Private ordinary functions
walk-let/let*: Private ordinary functions
walk-macro-call: Private ordinary functions
walk-multiple-value-call: Private ordinary functions
walk-multiple-value-call-nondeterministic: Private ordinary functions
walk-multiple-value-prog1: Private ordinary functions
walk-progn: Private ordinary functions
walk-progv: Private ordinary functions
walk-quote: Private ordinary functions
walk-return-from: Private ordinary functions
walk-setf: Private ordinary functions
walk-setq: Private ordinary functions
walk-tagbody: Private ordinary functions
walk-the: Private ordinary functions
walk-throw: Private ordinary functions
walk-unwind-protect: Private ordinary functions
when-failing: Public macros

Y
y-or-n-p: Private ordinary functions

Jump to:   (   *   +   -   /   <   =   >  
A   B   C   D   E   F   G   I   K   L   M   N   O   P   Q   R   S   T   U   V   W   Y  

Next: , Previous: , Up: Indexes   [Contents][Index]

A.3 Variables

Jump to:   *  
B   C   D   E   F   L   N   O   P   S   U   V  
Index Entry  Section

*
*block-tags*: Private special variables
*dynamic-extent?*: Public special variables
*fail*: Private special variables
*function-record-table*: Private special variables
*iscream?*: Public special variables
*local?*: Private special variables
*maximum-discretization-range*: Public special variables
*minimum-shrink-ratio*: Public special variables
*name*: Private special variables
*nondeterministic-context?*: Private special variables
*nondeterministic?*: Private special variables
*ordered-lambda-list-keywords*: Private special variables
*screamer-version*: Public special variables
*screamer?*: Private special variables
*strategy*: Public special variables
*tagbody-tags*: Private special variables
*trail*: Private special variables

B
body: Private structures

C
callees: Private structures

D
deterministic?: Private structures

E
enumerated-antidomain: Private structures
enumerated-domain: Private structures

F
function: Private structures
function-name: Private structures

L
lambda-list: Private structures
lower-bound: Private structures

N
name: Private structures
noticers: Private structures

O
old-deterministic?: Private structures

P
possibly-boolean?: Private structures
possibly-integer?: Private structures
possibly-nonboolean-nonnumber?: Private structures
possibly-noninteger-real?: Private structures
possibly-nonreal-number?: Private structures

S
screamer?: Private structures
Slot, body: Private structures
Slot, callees: Private structures
Slot, deterministic?: Private structures
Slot, enumerated-antidomain: Private structures
Slot, enumerated-domain: Private structures
Slot, function: Private structures
Slot, function-name: Private structures
Slot, lambda-list: Private structures
Slot, lower-bound: Private structures
Slot, name: Private structures
Slot, noticers: Private structures
Slot, old-deterministic?: Private structures
Slot, possibly-boolean?: Private structures
Slot, possibly-integer?: Private structures
Slot, possibly-nonboolean-nonnumber?: Private structures
Slot, possibly-noninteger-real?: Private structures
Slot, possibly-nonreal-number?: Private structures
Slot, screamer?: Private structures
Slot, upper-bound: Private structures
Slot, value: Private structures
Special Variable, *block-tags*: Private special variables
Special Variable, *dynamic-extent?*: Public special variables
Special Variable, *fail*: Private special variables
Special Variable, *function-record-table*: Private special variables
Special Variable, *iscream?*: Public special variables
Special Variable, *local?*: Private special variables
Special Variable, *maximum-discretization-range*: Public special variables
Special Variable, *minimum-shrink-ratio*: Public special variables
Special Variable, *name*: Private special variables
Special Variable, *nondeterministic-context?*: Private special variables
Special Variable, *nondeterministic?*: Private special variables
Special Variable, *ordered-lambda-list-keywords*: Private special variables
Special Variable, *screamer-version*: Public special variables
Special Variable, *screamer?*: Private special variables
Special Variable, *strategy*: Public special variables
Special Variable, *tagbody-tags*: Private special variables
Special Variable, *trail*: Private special variables

U
upper-bound: Private structures

V
value: Private structures

Jump to:   *  
B   C   D   E   F   L   N   O   P   S   U   V