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
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
|
\documentclass{article}
\usepackage{axiom}
\author{Gabriel Dos~Reis}
\begin{document}
\begin{abstract}
\end{abstract}
\tableofcontents
\eject
\section{The Constructor domain}
<<domain CTORKIND ConstructorKinid>>=
)abbrev domain CTORKIND ConstructorKind
++ Author: Gabriel Dos Reis
++ Date Create: October 07, 2008.
++ Date Last Updated: October 07, 2008.
++ Related Constructors:
++ Description:
++ This domain enumerates the three kinds of constructors
++ available in OpenAxiom: category constructors, domain
++ constructors, and package constructors.
ConstructorKind(): Public == Private where
Public == SetCategory with
category: % ++ `category' designates category constructors
domain: % ++ `domain' designates domain constructors
package: % ++ `package' designates package constructors.
Private == add
category == INTERN("category","KEYWORD")$Lisp
domain == INTERN("domain","KEYWORD")$Lisp
package == INTERN("package","KEYWORD")$Lisp
k1 = k2 == EQ(k1,k2)$Lisp
coerce(k: %): OutputForm ==
k = category => outputForm 'category
k = domain => outputForm 'domain
outputForm 'package
@
<<domain CTOR Constructor>>=
)abbrev domain CTOR Constructor
++ Author: Gabriel Dos Reis
++ Date Create: October 07, 2008.
++ Date Last Updated: October 07, 2008.
++ Related Constructors: Domain, Category
++ Basic Operations: name, kind, arity.
++ Description:
++ This domain provides implementations for constructors.
Constructor(): Public == Private where
Public == SetCategory with
name: % -> Identifier
++ name(ctor) returns the name of the constructor `ctor'.
kind: % -> ConstructorKind
++ kind(ctor) returns the kind of the constructor `ctor'.
arity: % -> SingleInteger
++ arity(ctor) returns the arity of the constructor `ctor'.
++ A negative value means that the ctor takes a variable
++ length argument list, e.g. Mapping, Record, etc.
Private == add
Rep == Identifier
name x == rep x
x = y == rep x = rep y
coerce(x: %): OutputForm == rep(x)::OutputForm
@
\section{domain Category}
<<domain CATEGORY Category>>=
import CoercibleTo OutputForm
)abbrev domain CATEGORY Category
++ Author: Gabriel Dos Reis
++ Date Create: February 16, 2008.
++ Date Last Updated: February 16, 2008.
++ Basic Operations: coerce
++ Related Constructors:
++ Also See: Type
Category(): Public == Private where
Public ==> CoercibleTo OutputForm
Private ==> add
coerce x ==
outputDomainConstructor(x)$Lisp
@
\section{domain Domain}
<<domain DOMAIN Domain>>=
import SetCategory
import Void
import ConstructorCall
)abbrev domain DOMAIN Domain
++ Author: Gabriel Dos Reis
++ Date Create: October 18, 2007.
++ Date Last Updated: January 19, 2008.
++ Basic Operations: coerce, reify
++ Related Constructors: Type, Syntax, OutputForm
++ Also See: Type, ConstructorCall
Domain(): Public == Private where
Public == SetCategory with
reify: % -> ConstructorCall
++ reify(d) returns the abstract syntax for the domain `x'.
reflect: ConstructorCall -> %
++ reflect cc returns the domain object designated by the
++ ConstructorCall syntax `cc'. The constructor implied
++ by `cc' must be known to the system since it is instantiated.
showSummary: % -> Void
++ showSummary(d) prints out implementation detail information
++ of domain `d'.
Private == add
coerce x ==
outputDomainConstructor(x)$Lisp
reify x ==
devaluate(x)$Lisp @ ConstructorCall
reflect cc ==
evalDomain(cc)$Lisp @ %
x = y ==
reify x = reify y
showSummary x ==
showSummary(x)$Lisp
@
\section{License}
<<license>>=
--Copyright (C) 2007-2008, Gabriel Dos Reis.
--All rights reserved.
--
--Redistribution and use in source and binary forms, with or without
--modification, are permitted provided that the following conditions are
--met:
--
-- - Redistributions of source code must retain the above copyright
-- notice, this list of conditions and the following disclaimer.
--
-- - Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in
-- the documentation and/or other materials provided with the
-- distribution.
--
-- - Neither the name of The Numerical Algorithms Group Ltd. nor the
-- names of its contributors may be used to endorse or promote products
-- derived from this software without specific prior written permission.
--
--THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
--IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
--TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
--PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
--OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
--EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
--PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
--PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
--LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
--NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
--SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
@
<<*>>=
<<license>>
<<domain CTORKIND ConstructorKinid>>
<<domain CATEGORY Category>>
<<domain DOMAIN Domain>>
@
|
