-
Notifications
You must be signed in to change notification settings - Fork 29
/
package.lisp
119 lines (118 loc) · 3.74 KB
/
package.lisp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
;;;; Written by:
;;;;
;;;; Jeffrey Mark Siskind (Department of Computer Science, University of Toronto)
;;;; David Allen McAllester (MIT Artificial Intelligence Laboratory)
;;;;
;;;; Copyright 1991 Massachusetts Institute of Technology. All rights reserved.
;;;; Copyright 1992, 1993 University of Pennsylvania. All rights reserved.
;;;; Copyright 1993 University of Toronto. All rights reserved.
;;;;
;;;; Permission is hereby granted, free of charge, to any person obtaining a copy of
;;;; this software and associated documentation files (the "Software"), to deal in
;;;; the Software without restriction, including without limitation the rights to
;;;; use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
;;;; the Software, and to permit persons to whom the Software is furnished to do so,
;;;; subject to the following conditions:
;;;;
;;;; The above copyright and authorship notice and this permission notice shall be
;;;; included in all copies or substantial portions of the Software.
;;;;
;;;; THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
;;;; IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
;;;; FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
;;;; COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
;;;; IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
;;;; CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
(defpackage :screamer
(:shadow :defun :multiple-value-bind :y-or-n-p :variable)
(:use :cl)
(:export #:either
#:fail
#:local
#:global
#:for-effects
#:multiple-value-call-nondeterministic
#:one-value
#:possibly?
#:necessarily?
#:all-values
#:ith-value
#:print-values
#:nondeterministic-function?
#:funcall-nondeterministic
#:apply-nondeterministic
#:unwind-trail
#:trail
#:purge
#:unwedge-screamer
#:local-output
#:a-boolean
#:an-integer
#:an-integer-above
#:an-integer-below
#:an-integer-between
#:a-member-of
#:when-failing
#:count-failures
#:boolean
#:booleanp
#:make-variable
#:numberpv
#:realpv
#:integerpv
#:booleanpv
#:memberv
#:assert!
#:known?
#:decide
#:=v
#:<v
#:<=v
#:>v
#:>=v
#:/=v
#:a-booleanv
#:an-integerv
#:an-integer-abovev
#:an-integer-belowv
#:an-integer-betweenv
#:a-realv
#:a-real-abovev
#:a-real-belowv
#:a-real-betweenv
#:a-numberv
#:a-member-ofv
#:notv
#:andv
#:orv
#:count-trues
#:count-truesv
#:+v
#:-v
#:*v
#:/v
#:minv
#:maxv
#:funcallv
#:applyv
#:equalv
#:bound?
#:value-of
#:ground?
#:apply-substitution
#:linear-force
#:divide-and-conquer-force
#:static-ordering
#:domain-size
#:range-size
#:reorder
#:solution
#:best-value
#:template
#:define-screamer-package
#:*screamer-version*
#:*dynamic-extent?*
#:*iscream?*
#:*minimum-shrink-ratio*
#:*maximum-discretization-range*
#:*strategy*))