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
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
|
\documentclass{article}
\usepackage{axiom}
\author{Gabriel Dos~Reis}
\begin{document}
\begin{abstract}
\end{abstract}
\tableofcontents
\eject
\section{domain Syntax}
<<domain SYNTAX Syntax>>=
import UnionType
import SetCategory
import Boolean
import Integer
import DoubleFloat
import Symbol
import SExpression
)abbrev domain SYNTAX Syntax
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Updated: October 18, 2008
++ Description: This domain provides a simple domain, general enough for
++ building complete representation of Spad programs as objects
++ of a term algebra built from ground terms of type integers, foats,
++ symbols, and strings.
++ This domain differs from InputForm in that it represents
++ any entity in a Spad program, not just expressions. Furthermore,
++ while InputForm may contain atoms like vectors and other Lisp
++ objects, the Syntax domain is supposed to contain only that
++ initial algebra build from the primitives listed above.
++ Related Constructors: Boolean, Integer, Float, Symbol, String, SExpression.
++ See Also: SExpression.
++ The equality supported by this domain is structural.
Syntax(): Public == Private where
Public == Join(UnionType, SetCategory) with
convert: % -> SExpression
++ convert(s) returns the s-expression representation of a syntax.
convert: SExpression -> %
++ convert(s) converts an s-expression to Syntax. Note, when `s'
++ is not an atom, it is expected that it designates a proper list,
++ e.g. a sequence of cons cells ending with nil.
coerce: Integer -> %
++ coerce(i) injects the integer value `i' into the Syntax domain.
coerce: % -> Integer
++ coerce(s) extracts and integer value from the syntax `s'
autoCoerce: % -> Integer
++ autoCoerce(s) forcibly extracts an integer value from
++ the syntax `s'; no check performed. To be called only
++ at the discretion of the compiler.
coerce: DoubleFloat -> %
++ coerce(f) injects the float value `f' into the Syntax domain
coerce: % -> DoubleFloat
++ coerce(s) extracts a float value from the syntax `s'.
autoCoerce: % -> DoubleFloat
++ autoCoerce(s) forcibly extracts a float value from the syntax `s';
++ no check performed. To be called only at the discretion of
++ the compiler
coerce: Symbol -> %
++ coerce(s) injects the symbol `s' into the Syntax domain.
coerce: % -> Symbol
++ coerce(s) extracts a symbol from the syntax `s'.
autoCoerce: % -> Symbol
++ autoCoerce(s) forcibly extracts a symbo from the Syntax
++ domain `s'; no check performed. To be called only at
++ at the discretion of the compiler.
coerce: String -> %
++ coerce(s) injects the string value `s' into the syntax domain
coerce: % -> String
++ coerce(s) extracts a string value from the syntax `s'.
autoCoerce: % -> String
++ autoCoerce(s) forcibly extracts a string value from
++ the syntax `s'; no check performed. To be called only at
++ the discretion of the compiler.
buildSyntax: (Symbol, List %) -> %
++ buildSyntax(op, [a1, ..., an]) builds a syntax object
++ for op(a1,...,an).
buildSyntax: (%, List %) -> %
++ buildSyntax(op, [a1, ..., an]) builds a syntax object
++ for op(a1,...,an).
nil?: % -> Boolean
++ nil?(s) is true when `s' is a syntax for the constant nil.
getOperator: % -> Union(Integer, DoubleFloat, Symbol, String, %)
++ getOperator(x) returns the operator, or tag, of the syntax `x'.
++ The value returned is itself a syntax if `x' really is an
++ application of a function symbol as opposed to being an
++ atomic ground term.
getOperands: % -> List %
++ getOperands(x) returns the list of operands to the operator in `x'.
compound?: % -> Boolean
++ compound? x is true when `x' is not an atomic syntax.
_case: (%, [|Integer|]) -> Boolean
++ x case Integer is true if `x' really is an Integer
_case: (%, [|DoubleFloat|]) -> Boolean
++ x case DoubleFloat is true if `x' really is a DoubleFloat
_case: (%, [|Symbol|]) -> Boolean
++ x case Symbol is true if `x' really is a Symbol
_case: (%, [|String|]) -> Boolean
++ x case String is true if `x' really is a String
Private == add
x = y ==
EQUAL(x,y)$Lisp
s case Integer ==
INTEGERP(s)$Lisp
s case DoubleFloat ==
FLOATP(s)$Lisp
s case String ==
STRINGP(s)$Lisp
s case Symbol ==
IDENTP(s)$Lisp
coerce(x: %): OutputForm ==
x case String => outputForm(x : String)
x pretend OutputForm
convert(x: %): SExpression ==
x : SExpression
convert(x: SExpression): % ==
x pretend %
coerce(i: Integer): % ==
i pretend %
autoCoerce(i: %): Integer == -- used for hard coercion
i : Integer
coerce(i: %): Integer ==
i case Integer => i
userError "invalid conversion target type"
coerce(f: DoubleFloat): % ==
f pretend %
autoCoerce(f: %): DoubleFloat == -- used for hard coercion
f : DoubleFloat
coerce(f: %): DoubleFloat ==
f case DoubleFloat => f
userError "invalid conversion target type"
coerce(s: Symbol): % ==
s pretend %
autoCoerce(s: %): Symbol == -- used for hard coercion
s : Symbol
coerce(s: %): Symbol ==
s case Symbol => s
userError "invalid conversion target type"
coerce(s: String): % ==
s pretend %
autoCoerce(s: %): String == -- used for hard coercion
s : String
coerce(s: %): String ==
s case String => s
userError "invalid conversion target type"
buildSyntax(s: Symbol, l: List %): % ==
CONS(s,l)$Lisp
buildSyntax(op: %, l: List %): % ==
CONS(op,l)$Lisp
nil? x ==
NULL(x)$Lisp
atom?(x: %): Boolean ==
ATOM(x)$Lisp
getOperator x ==
atom? x => userError "atom as operand to getOperator"
op: % := CAR(x)$Lisp
op case Symbol => op pretend Symbol
op case Integer => op pretend Integer
op case DoubleFloat => op pretend DoubleFloat
op case String => op pretend String
op
compound? x ==
CONSP(x)$Lisp
getOperands x ==
atom? x => []
CDR(x)$Lisp
@
\section{domain ConstructorCall}
<<domain CTORCALL ConstructorCall>>=
import SetCategory
import Symbol
import List Syntax
)abbrev domain CTORCALL ConstructorCall
++ Author: Gabriel Dos Reis
++ Date Created: January 19, 2008
++ Date Last Updated: July 03, 2008
++ Description: This domains represents a syntax object that
++ designates a category, domain, or a package.
++ See Also: Syntax, Domain
ConstructorCall(): Public == Private where
Public == SetCategory with
constructorName: % -> Symbol
++ constructorName c returns the name of the constructor
arguments: % -> List Syntax
++ arguments returns the list of syntax objects for the
++ arguments used to invoke the constructor.
Private == add
Rep == List Syntax
constructorName x ==
(first rep x)::Symbol
arguments x ==
rest rep x
x = y ==
rep x = rep y
coerce x ==
outputDomainConstructor(x)$Lisp
@
\section{The Signature domain}
<<domain SIG Signature>>=
import SetCategory
import CoercibleTo
import List
import Syntax
)abbrev domain SIG Signature
++ Author: Gabriel Dos Reis
++ Date Created: January 10, 2008
++ Date Last Updated: August 30, 2008
++ Description: This is the datatype for operation signatures as
++ used by the compiler and the interpreter. Note that this domain
++ differs from SignatureAst.
++ See also: ConstructorCall, Domain.
Signature(): Public == Private where
Public == SetCategory with
signature: (List Syntax,Syntax) -> %
++ signature(s,t) constructs a Signature object with parameter
++ types indicaded by `s', and return type indicated by `t'.
target: % -> Syntax
++ target(s) returns the target type of the signature `s'.
source: % -> List Syntax
++ source(s) returns the list of parameter types of `s'.
Private == add
Rep == List Syntax
signature(s,t) == per cons(t,s)
target x == first rep x
source x == rest rep x
x = y == rep x = rep y
coerce(x: %): OutputForm ==
rarrow([s::OutputForm for s in source x]::OutputForm,
target(x)::OutputForm)$OutputForm
@
\section{domain ElaboratedExpression}
<<domain ELABEXPR ElaboratedExpression>>=
import Boolean
import Symbol
import ConstructorCall
import List
import SExpression
)abbrev domain ELABEXPR ElaboratedExpression
++ Author: Gabriel Dos Reis
++ Date Created: January 19, 2008
++ Date Last Updated: January 20, 2008
++ Description: This domains an expresion as elaborated by the interpreter.
++ See Also:
ElaboratedExpression(): Public == Private where
Public ==> CoercibleTo OutputForm with
type: % -> ConstructorCall
++ type(e) returns the type of the expression as computed by
++ the interpreter.
constant?: % -> Boolean
++ constant?(e) returns true if `e' is a constant.
getConstant: % -> Union(SExpression,"failed")
++ getConstant(e) retrieves the constant value of `e'e.
variable?: % -> Boolean
++ variable?(e) returns true if `e' is a variable.
getIdentifier: % -> Union(Symbol,"failed")
++ getIdentifier(e) retrieves the name of the variable `e'.
callForm?: % -> Boolean
++ callForm?(e) is true when `e' is a call expression.
getOperator: % -> Union(Symbol, "failed")
++ getOperator(e) retrieves the operator being invoked in `e',
++ when `e' is an expression.
getOperands: % -> Union(List %, "failed")
++ getOperands(e) returns the list of operands in `e', assuming it
++ is a call form.
Private ==> add
isAtomic(x: %): Boolean ==
ATOM(x)$Lisp @ Boolean
type x ==
getMode(x)$Lisp @ ConstructorCall
callForm? x ==
CONSP(x)$Lisp @ Boolean
getOperator x ==
op: SExpression := getUnnameIfCan(x)$Lisp
null? op => "failed"
op pretend Symbol
constant? x ==
isAtomic x and
EQ(getUnnameIfCan(x)$Lisp, _$immediateDataSymbol$Lisp)$Lisp : Boolean
getConstant x ==
constant? x => getValue(x)$Lisp @ SExpression
"failed"
variable? x ==
isAtomic x and not constant? x
getIdentifier x ==
variable? x => symbol (getUnname(x)$Lisp@SExpression)
"failed"
@
\section{SpadAbstractSyntaxCategory}
<<category ASTCAT AbstractSyntaxCategory>>=
import SetCategory
import CoercibleTo Syntax
)abbrev category ASTCAT AbstractSyntaxCategory
++ Author: Gabriel Dos Reis
++ Date Created: July 5, 2008
++ Date Last Modified: September 21, 2008
++ Description: This is the category of Spad abstract syntax trees.
AbstractSyntaxCategory(): Category ==
Join(SetCategory, CoercibleTo Syntax) with
coerce: Syntax -> %
add
coerce(x: %): Syntax ==
x pretend Syntax
coerce(x: Syntax): % ==
x pretend %
coerce(x: %): OutputForm ==
x::Syntax::OutputForm
@
\section{The SpadSyntaxCategory category}
<<category SASTCAT SpadSyntaxCategory>>=
)abbrev category SASTCAT SpadSyntaxCategory
++ Author: Gabriel Dos Reis
++ Date Created: July 5, 2008
++ Date Last Modified: September 3, 2008
++ Description: This is the category of Spad syntax objects.
SpadSyntaxCategory(): Category == AbstractSyntaxCategory
@
\subsection{The Exports of SpadAst}
<<category SPADXPT SpadAstExports>>=
)abbrev category SPADXPT SpadAstExports
++ Author: Gabriel Dos Reis
++ Date Created: September 20, 2008
++ Date Last Modified: September 21, 2008
++ Description: This category describes the exported
++ signatures of the SpadAst domain.
SpadAstExports(): Category == Join(SpadSyntaxCategory, UnionType) with
_case: (%, [|ImportAst()|]) -> Boolean
++ s case ImportAst holds if `s' represents an `import' statement.
autoCoerce: % -> ImportAst()
++ autoCoerce(s) returns the ImportAst view of `s'. Left at the
++ discretion of the compiler.
_case: (%, [|DefinitionAst()|]) -> Boolean
++ s case DefinitionAst holds if `s' represents a definition.
autoCoerce: % -> DefinitionAst()
++ autoCoerce(s) returns the DefinitionAst view of `s'. Left at the
++ discretion of the compiler.
_case: (%, [|MacroAst()|]) -> Boolean
++ s case MacroAst holds if `s' represents a macro definition.
autoCoerce: % -> MacroAst()
++ autoCoerce(s) returns the MacroAst view of `s'. Left at the
++ discretion of the compiler.
_case: (%, [|WhereAst()|]) -> Boolean
++ s case WhereAst holds if `s' represents an expression with
++ local definitions.
autoCoerce: % -> WhereAst()
++ autoCoerce(s) returns the WhereAst view of `s'. Left at the
++ discretion of the compiler.
_case: (%, [|CategoryAst()|]) -> Boolean
++ s case CategoryAst holds if `s' represents an unnamed category.
autoCoerce: % -> CategoryAst()
++ autoCoerce(s) returns the CategoryAst view of `s'. Left at the
++ discretion of the compiler.
_case: (%, [|CapsuleAst()|]) -> Boolean
++ s case CapsuleAst holds if `s' represents a domain capsule.
autoCoerce: % -> CapsuleAst()
++ autoCoerce(s) returns the CapsuleAst view of `s'. Left at the
++ discretion of the compiler.
_case: (%, [|SignatureAst()|]) -> Boolean
++ s case SignatureAst holds if `s' represents a signature export.
autoCoerce: % -> SignatureAst()
++ autoCoerce(s) returns the SignatureAst view of `s'. Left at the
++ discretion of the compiler.
_case: (%, [|AttributeAst()|]) -> Boolean
++ s case AttributeAst holds if `s' represents an attribute.
autoCoerce: % -> AttributeAst()
++ autoCoerce(s) returns the AttributeAst view of `s'. Left at the
++ discretion of the compiler.
_case: (%, [|MappingAst()|]) -> Boolean
++ s case MappingAst holds if `s' represents a mapping type.
autoCoerce: % -> MappingAst()
++ autoCoerce(s) returns the MappingAst view of `s'. Left at the
++ discretion of the compiler.
_case: (%, [|IfAst()|]) -> Boolean
++ s case IfAst holds if `s' represents an if-statement.
autoCoerce: % -> IfAst()
++ autoCoerce(s) returns the IfAst view of `s'. Left at the
++ discretion of the compiler.
_case: (%, [|RepeatAst()|]) -> Boolean
++ s case RepeatAst holds if `s' represents an repeat-loop.
autoCoerce: % -> RepeatAst()
++ autoCoerce(s) returns the RepeatAst view of `s'. Left at the
++ discretion of the compiler.
_case: (%, [|WhileAst()|]) -> Boolean
++ s case WhileAst holds if `s' represents a while-iterator
autoCoerce: % -> WhileAst()
++ autoCoerce(s) returns the WhileAst view of `s'. Left at the
++ discretion of the compiler.
_case: (%, [|InAst()|]) -> Boolean
++ s case InAst holds if `s' represents a in-iterator
autoCoerce: % -> InAst()
++ autoCoerce(s) returns the InAst view of `s'. Left at the
++ discretion of the compiler.
_case: (%, [|CollectAst()|]) -> Boolean
++ s case CollectAst holds if `s' represents a list-comprehension.
autoCoerce: % -> CollectAst()
++ autoCoerce(s) returns the CollectAst view of `s'. Left at the
++ discretion of the compiler.
_case: (%, [|ConstructAst()|]) -> Boolean
++ s case ConstructAst holds if `s' represents a list-expression.
autoCoerce: % -> ConstructAst()
++ autoCoerce(s) returns the ConstructAst view of `s'. Left at the
++ discretion of the compiler.
_case: (%, [|ExitAst()|]) -> Boolean
++ s case ExitAst holds if `s' represents an exit-expression.
autoCoerce: % -> ExitAst()
++ autoCoerce(s) returns the ExitAst view of `s'. Left at the
++ discretion of the compiler.
_case: (%, [|ReturnAst()|]) -> Boolean
++ s case ReturnAst holds if `s' represents a return-statement.
autoCoerce: % -> ReturnAst()
++ autoCoerce(s) returns the ReturnAst view of `s'. Left at the
++ discretion of the compiler.
_case: (%, [|CoerceAst()|]) -> Boolean
++ s case ReturnAst holds if `s' represents a coerce-expression.
autoCoerce: % -> CoerceAst()
++ autoCoerce(s) returns the CoerceAst view of `s'. Left at the
++ discretion of the compiler.
_case: (%, [|PretendAst()|]) -> Boolean
++ s case PretendAst holds if `s' represents a pretend-expression.
autoCoerce: % -> PretendAst()
++ autoCoerce(s) returns the PretendAst view of `s'. Left at the
++ discretion of the compiler.
_case: (%, [|RestrictAst()|]) -> Boolean
++ s case RestrictAst holds if `s' represents a restrict-expression.
autoCoerce: % -> RestrictAst()
++ autoCoerce(s) returns the RestrictAst view of `s'. Left at the
++ discretion of the compiler.
_case: (%, [|SegmentAst()|]) -> Boolean
++ s case SegmentAst holds if `s' represents a segment-expression.
autoCoerce: % -> SegmentAst()
++ autoCoerce(s) returns the SegmentAst view of `s'. Left at the
++ discretion of the compiler.
_case: (%, [|SequenceAst()|]) -> Boolean
++ s case SequenceAst holds if `s' represents a sequence-of-statements.
autoCoerce: % -> SequenceAst()
++ autoCoerce(s) returns the SequenceAst view of `s'. Left at the
++ discretion of the compiler.
_case: (%, [|LetAst()|]) -> Boolean
++ s case LetAst holds if `s' represents an assignment-expression.
autoCoerce: % -> LetAst()
++ autoCoerce(s) returns the LetAst view of `s'. Left at the
++ discretion of the compiler.
_case: (%, [|SuchThatAst()|]) -> Boolean
++ s case SuchThatAst holds if `s' represents a qualified-expression.
autoCoerce: % -> SuchThatAst()
++ autoCoerce(s) returns the SuchThatAst view of `s'. Left at the
++ discretion of the compiler.
_case: (%, [|ColonAst()|]) -> Boolean
++ s case ColonAst holds if `s' represents a colon-expression.
autoCoerce: % -> ColonAst()
++ autoCoerce(s) returns the ColoonAst view of `s'. Left at the
++ discretion of the compiler.
_case: (%, [|CaseAst()|]) -> Boolean
++ s case CaseAst holds if `s' represents a case-expression.
autoCoerce: % -> CaseAst()
++ autoCoerce(s) returns the CaseAst view of `s'. Left at the
++ discretion of the compiler.
_case: (%, [|HasAst()|]) -> Boolean
++ s case HasAst holds if `s' represents a has-expression.
autoCoerce: % -> HasAst()
++ autoCoerce(s) returns the HasAst view of `s'. Left at the
++ discretion of the compiler.
_case: (%, [|IsAst()|]) -> Boolean
++ s case IsAst holds if `s' represents an is-expression.
autoCoerce: % -> IsAst()
++ autoCoerce(s) returns the IsAst view of `s'. Left at the
++ discretion of the compiler.
_case: (%, [|Identifier|]) -> Boolean
++ s case Identifier holds if `s' represents an identifier.
autoCoerce: % -> Identifier
++ autoCoerce(s) returns the Identifier view of `s'. Left at the
++ discretion of the compiler.
_case: (%, [|String|]) -> Boolean
++ s case String holds if `s' represents a string literal.
autoCoerce: % -> String
++ autoCoerce(s) returns the String view of `s'. Left at the
++ discretion of the compiler.
_case: (%, [|Integer|]) -> Boolean
++ s case Integer holds if `s' represents an integer literal.
autoCoerce: % -> Integer
++ autoCoerce(s) returns the Integer view of `s'. Left at the
++ discretion of the compiler.
@
\subsection{The Literal domain}
<<domain LITERAL Literal>>=
)abbrev domain LITERAL Literal
++ Author: Gabriel Dos Reis
++ Date Created: July 5, 2008
++ Date Last Modified: September 1, 2008
++ Description: This domain represents AST for Spad literals.
Literal(T: SetCategory): Public == Private where
Public == Join(SpadSyntaxCategory, CoercibleTo T)
Private == add
Rep == T
coerce(x: %): T == rep x
coerce(x: %): OutputForm == x::T::OutputForm
@
\subsection{The Identifier domain}
<<domain IDENT Identifier>>=
++ Author: Gabriel Dos Reis
++ Date Created: July 5, 2008
++ Date Last Modified: September 1, 2008
++ Description: This domain represents identifer AST.
)abbrev domain IDENT Identifier
Identifier(): Public == Private where
Public == Join(SpadSyntaxCategory, CoercibleTo Symbol)
Private == add
Rep == Symbol
coerce(x: %): Symbol == rep x
coerce(x: %): OutputForm == x::Symbol::OutputForm
@
\subsection{The HeadAst domain}
<<domain HEADAST HeadAst>>=
import AbstractSyntaxCategory
import Symbol
import List Symbol
)abbrev domain HEADAST HeadAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents the header of a definition.
HeadAst(): Public == Private where
Public == SpadSyntaxCategory with
headAst: (Identifier,List Identifier) -> %
++ headAst(f,[x1,..,xn]) constructs a function definition header.
name: % -> Identifier
++ name(h) returns the name of the operation defined defined.
parameters: % -> List Identifier
++ parameters(h) gives the parameters specified in the
++ definition header `h'.
Private == add
Rep == List Identifier
headAst(op,args) == per cons(op,args)
name h == first rep h
parameters h == rest rep h
coerce(x: %): OutputForm ==
elt('HeadAst::OutputForm,
['name::OutputForm = name(x)::OutputForm,
'parameters::OutputForm = parameters(x)::OutputForm])$OutputForm
@
\subsection{The TypeAst domain}
<<domain TYPEAST TypeAst>>=
SpadAst(): SpadAstExports
import AbstractSyntaxCategory
)abbrev domain TYPEAST TypeAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents a type AST.
TypeAst(): Public == Private where
Public == SpadSyntaxCategory
Private == add
coerce(x: %): OutputForm == (x : SpadAst)::OutputForm
@
\subsection{The ImportAst domain}
<<domain IMPTAST ImportAst>>=
import List
import TypeAst
)abbrev domain IMPTAST ImportAst
)abbrev domain TYPEAST TypeAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents an `import' of types.
ImportAst(): Public == Private where
Public == SpadSyntaxCategory with
coerce: List TypeAst -> %
++ ts::ImportAst constructs an ImportAst for the list if types `ts'.
imports: % -> List TypeAst
++ imports(x) returns the list of imported types.
Private == add
import Pair
Rep == Pair(Symbol, List TypeAst)
coerce(ts: List TypeAst): % == per pair('import,ts)
imports x == second rep x
coerce(x: %): OutputForm ==
elt('ImportAst::OutputForm,
['imports::OutputForm = imports(x)::OutputForm])$OutputForm
@
\subsection{The MappingAst domain}
<<domain MAPPAST MappingAst>>=
)abbrev domain MAPPAST MappingAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents a mapping type AST. A mapping AST
++ is a syntactic description of a function type, e.g. its result
++ type and the list of its argument types.
MappingAst(): Public == Private where
Public == Join(SpadSyntaxCategory, CoercibleTo TypeAst) with
coerce: Signature -> %
++ sig::MappingAst builds a MappingAst from the Signature `sig'.
mappingAst: (List TypeAst, TypeAst) -> %
++ mappingAst(s,t) builds the mapping AST s -> t
source: % -> List TypeAst
++ source(s) returns the parameter type AST list of `s'.
target: % -> TypeAst
++ target(s) returns the result type AST for `s'.
Private == add
import Pair
Rep == Pair(Symbol,Signature)
coerce(sig: Signature): % == per pair('Mapping,sig)
mappingAst(s,t) ==
per pair('Mapping,cons(t,s) : Signature)
source x == source(second rep x)$Signature : List(TypeAst)
target x == target(second rep x)$Signature : TypeAst
coerce(x: %): TypeAst == x : TypeAst
coerce(x: %): OutputForm ==
elt('MappingAst::OutputForm,
['source::OutputForm = source(x)::OutputForm,
'target::OutputForm = target(x)::OutputForm])$OutputForm
@
\subsection{The SignatureAst domain}
<<domain SIGAST SignatureAst>>=
)abbrev domain SIGAST SignatureAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents a signature AST. A signature AST
++ is a description of an exported operation, e.g. its name, result
++ type, and the list of its argument types.
SignatureAst(): Public == Private where
Public == SpadSyntaxCategory with
signatureAst: (Identifier, Signature) -> %
++ signatureAst(n,s,t) builds the signature AST n: s -> t
name: % -> Identifier
++ name(s) returns the name of the signature `s'.
signature: % -> Signature
++ signature(s) returns AST of the declared signature for `s'.
Private == add
import List
Rep == Pair(Symbol, Pair(Identifier,List Signature))
signatureAst(n,sig) ==
per pair('SIGNATURE,pair(n,[sig]))
name x == first second rep x
signature x == value second second rep x
coerce(x: %): OutputForm ==
elt('SignatureAst::OutputForm,
['name::OutputForm = name(x)::OutputForm,
'signature::OutputForm = signature(x)::OutputForm])$OutputForm
@
\subsection{The AttributeAst domain}
<<domain ATTRAST AttributeAst>>=
SpadAst(): SpadAstExports
)abbrev domain ATTRAST AttributeAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents the syntax of an attribute in
++ a category expression.
AttributeAst(): Public == Private where
Public == SpadSyntaxCategory with
name: % -> SpadAst
++ name(a) returns the name of the attribute `a'. Note, this
++ name may be domain name, not just an identifier.
Private == add
Rep == Pair(Symbol,SpadAst)
name x == second rep x
coerce(x: %): OutputForm ==
elt('AttributeAst::OutputForm,
['name::OutputForm = name(x)::OutputForm])$OutputForm
@
\subsection{The JoinAst domain}
<<domain JOINAST JoinAst>>=
)abbrev domain JOINAST JoinAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents the join of categories ASTs.
JoinAst(): Public == Private where
Public == Join(SpadSyntaxCategory, CoercibleTo TypeAst) with
coerce: List TypeAst -> %
++ ts::JoinAst construct the AST for a join of the types `ts'.
categories: % -> List TypeAst
++ catehories(x) returns the types in the join `x'.
Private == add
Rep == Pair(Symbol, List TypeAst)
categories x == second rep x
coerce(cats: List TypeAst): % == per pair('Join,cats)
coerce(x: %): TypeAst == x : TypeAst
@
\subsection{The IfAst domain}
<<domain IFAST IfAst>>=
SpadAst(): SpadAstExports
)abbrev domain IFAST IfAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents AST for conditional expressions.
IfAst(): Public == Private where
Public == SpadSyntaxCategory with
condition: % -> SpadAst
++ condition(e) returns the condition of the if-expression `e'.
thenBranch: % -> SpadAst
++ thenBranch(e) returns the `then-branch' of `e'.
elseBranch: % -> SpadAst
++ thenBranch(e) returns the `else-branch' of `e'.
Private == add
Rep == List SpadAst
condition x == second rep x
thenBranch x == third rep x
elseBranch x == last rep x
coerce(x: %): OutputForm ==
elt('IfAst::OutputForm,
['condition::OutputForm = condition(x)::OutputForm,
'thenBranch::OutputForm = thenBranch(x)::OutputForm,
'elseBranch::OutputForm = elseBranch(x)::OutputForm])$OutputForm
@
\subsection{The RepeatAst domain}
<<domain RPTAST RepeatAst>>=
SpadAst(): SpadAstExports
)abbrev domain RPTAST RepeatAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents the `repeat' iterator syntax.
RepeatAst(): Public == Private where
Public == SpadSyntaxCategory with
iterators: % -> List SpadAst
++ iterators(e) returns the list of iterators controlling the loop `e'.
body: % -> SpadAst
++ body(e) returns the body of the loop `e'.
Private == add
Rep == List SpadAst
iterators x ==
s := rep x
s.(2..(#s - 1))
body x == last rep x
coerce(x: %): OutputForm ==
elt('RepeatAst::OutputForm,
['iterators::OutputForm = iterators(x)::OutputForm,
'body::OutputForm = body(x)::OutputForm])$OutputForm
@
\subsection{The WhileAst domain}
<<domain WHILEAST WhileAst>>=
SpadAst(): SpadAstExports
)abbrev domain WHILEAST WhileAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents the `while' iterator syntax.
WhileAst(): Public == Private where
Public == SpadSyntaxCategory with
condition: % -> SpadAst
++ condition(i) returns the condition of the while iterator `i'.
Private == add
Rep == Pair(Symbol,SpadAst)
condition x == second rep x
coerce(x: %): OutputForm ==
elt('WhileAst::OutputForm,
['condition::OutputForm = condition(x)::OutputForm])$OutputForm
@
\subsection{The InAst domain}
<<domain INAST InAst>>=
SpadAst(): SpadAstExports
)abbrev domain INAST InAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents the `in' iterator syntax.
InAst(): Public == Private where
Public == SpadSyntaxCategory with
iterationVar: % -> Symbol
++ iterationVar(i) returns the name of the iterating
++ variable of the `in' iterator 'i'
sequence: % -> SpadAst
++ sequence(i) returns the sequence expression being
++ iterated over by `i'.
Private == add
Rep == List Syntax
iterationVar x == (second rep x)::Symbol
sequence x == (last rep x) : SpadAst
coerce(x: %): OutputForm ==
elt('InAst::OutputForm,
['iterationVar::OutputForm = iterationVar(x)::OutputForm,
'sequence::OutputForm = sequence(x)::OutputForm])$OutputForm
@
\subsection{The CollectAst domain}
<<domain CLLCTAST CollectAst>>=
SpadAst(): SpadAstExports
)abbrev domain CLLCTAST CollectAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents list comprehension syntax.
CollectAst(): Public == Private where
Public == SpadSyntaxCategory with
iterators: % -> List SpadAst
++ iterators(e) returns the list of the iterators of
++ the list comprehension `e'.
body: % -> SpadAst
++ body(e) return the expression being
++ collected by the list comprehension `e'.
Private == add
Rep == List SpadAst
body x == last rep x
iterators x ==
s := rep x
s.(2..(#s -1))
coerce(x: %): OutputForm ==
elt('CollectAst::OutputForm,
['iterators::OutputForm = iterators(x)::OutputForm,
'body::OutputForm = body(x)::OutputForm])$OutputForm
@
\subsection{The ReduceAst domain}
<<domain RDUCEAST ReduceAst>>=
SpadAst(): SpadAstExports
)abbrev domain RDUCEAST ReduceAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents list reduction syntax.
ReduceAst(): Public == Private where
Public == SpadSyntaxCategory with
operator: % -> SpadAst
++ operator(e) returns the magma operation being applied.
body: % -> SpadAst
++ body(e) return the list of expressions being redcued.
Private == add
Rep == List SpadAst
operator x == second rep x
body x == third rep x
@
\subsection{The ConstructAst domain}
<<domain LSTAST ConstructAst>>=
SpadAst(): SpadAstExports
)abbrev domain LSTAST ConstructAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents `literal sequence' syntax.
ConstructAst(): Public == Private where
Public == SpadSyntaxCategory with
elements: % -> List SpadAst
++ elements(e) returns the list of expressions in the
++ `literal' list `e'.
Private == add
import Pair
Rep == Pair(Symbol, List SpadAst)
elements x == second rep x
coerce(x: %): OutputForm ==
elt('ConstructAst::OutputForm,
['elements::OutputForm = elements(x)::OutputForm])$OutputForm
@
\subsection{The ExitAst domain}
<<domain EXITAST ExitAst>>=
SpadAst(): SpadAstExports
)abbrev domain EXITAST ExitAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents exit expressions.
ExitAst(): Public == Private where
Public == SpadSyntaxCategory with
expression: % -> SpadAst
++ expression(e) returns the exit expression of `e'.
level: % -> Integer
++ level(e) returns the nesting exit level of `e'
Private == add
Rep == List SpadAst
expression x == third rep x
level x == (second rep x) : Integer
coerce(x: %): OutputForm ==
elt('ExitAst::OutputForm,
['level::OutputForm = level(x)::OutputForm,
'expression::OutputForm = expression(x)::OutputForm])$OutputForm
@
\subsection{The ReturnAst domain}
<<domain RETAST ReturnAst>>=
SpadAst(): SpadAstExports
)abbrev domain RETAST ReturnAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents `return' expressions.
ReturnAst(): Public == Private where
Public == SpadSyntaxCategory with
expression: % -> SpadAst
++ expression(e) returns the expression returned by `e'.
Private == add
import Pair
Rep == Pair(Symbol,SpadAst)
expression x == second rep x
coerce(x: %): OutputForm ==
elt('ReturnAst::OutputForm,
['expression::OutputForm = expression(x)::OutputForm])$OutputForm
@
\subsection{The SequenceAst domain}
<<domain SEQAST SequenceAst>>=
SpadAst(): SpadAstExports
)abbrev domain SEQAST SequenceAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents a block of expressions.
SequenceAst(): Public == Private where
Public == SpadSyntaxCategory with
body: % -> List SpadAst
++ body(e) returns the list of expressions in the sequence
++ of instruction `e'.
last: % -> SpadAst
++ last(e) returns the last instruction in `e'.
Private == add
import Pair
Rep == Pair(Symbol,List SpadAst)
body x == second rep x
last x == last(second rep x)$List(SpadAst)
coerce(x: %): OutputForm ==
elt('SequenceAst::OutputForm,
['body::OutputForm = body(x)::OutputForm])$OutputForm
@
\subsection{The LetAst domain}
<<domain LETAST LetAst>>=
SpadAst(): SpadAstExports
import List
)abbrev domain LETAST LetAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents assignment expressions.
LetAst(): Public == Private where
Public == SpadSyntaxCategory with
lhs: % -> SpadAst
++ lhs(e) returns the left hand side of the assignment expression `e'.
rhs: % -> SpadAst
++ rhs(e) returns the right hand side of the assignment expression `e'.
Private == add
Rep == List SpadAst
lhs x == second rep x
rhs x == third rep x
coerce(x: %): OutputForm ==
elt('LetAst::OutputForm,
['lhs::OutputForm = lhs(x)::OutputForm,
'rhs::OutputForm = rhs(x)::OutputForm])$OutputForm
@
\subsection{The PretendAst domain}
<<domain PRTDAST PretendAst>>=
SpadAst(): SpadAstExports
)abbrev domain PRTDAST PretendAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents `pretend' expressions.
PretendAst(): Public == Private where
Public == SpadSyntaxCategory with
expression: % -> SpadAst
++ expression(e) returns the expression being converted.
target: % -> TypeAst
++ target(e) returns the target type of the conversion..
Private == add
Rep == List Syntax
expression x == (second rep x) : SpadAst
target x == (third rep x) : TypeAst
coerce(x: %): OutputForm ==
elt('PretendAst::OutputForm,
['expression::OutputForm = expression(x)::OutputForm,
'target::OutputForm = target(x)::OutputForm])$OutputForm
@
\subsection{The CoerceAst domain}
<<domain CRCEAST CoercedAst>>=
SpadAst(): SpadAstExports
)abbrev domain CRCEAST CoerceAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents `coerce' expressions.
CoerceAst(): Public == Private where
Public == SpadSyntaxCategory with
expression: % -> SpadAst
++ expression(e) returns the expression being converted.
target: % -> TypeAst
++ target(e) returns the target type of the conversion..
Private == add
Rep == List Syntax
expression x == (second rep x) : SpadAst
target x == (third rep x) : TypeAst
coerce(x: %): OutputForm ==
elt('CoerceAst::OutputForm,
['expression::OutputForm = expression(x)::OutputForm,
'target::OutputForm = target(x)::OutputForm])$OutputForm
@
\subsection{The RestrictAst domain}
<<domain RSTRCAST RestrictAst>>=
SpadAst(): SpadAstExports
)abbrev domain RSTRCAST RestrictAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents `restrict' expressions.
RestrictAst(): Public == Private where
Public == SpadSyntaxCategory with
expression: % -> SpadAst
++ expression(e) returns the expression being converted.
target: % -> TypeAst
++ target(e) returns the target type of the conversion..
Private == add
Rep == List Syntax
expression x == (second rep x) : SpadAst
target x == (third rep x) : TypeAst
coerce(x: %): OutputForm ==
elt('RestrictAst::OutputForm,
['expression::OutputForm = expression(x)::OutputForm,
'target::OutputForm = target(x)::OutputForm])$OutputForm
@
\subsection{The CallAst domain}
<<domain CALLAST CallAst>>=
SpadAst(): SpadAstExports
import List
)abbrev domain CALLAST CallAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents calls.
CallAst(): Public == Private where
Public == SpadSyntaxCategory with
operator: % -> SpadAst
++ operation(e) returns the operation being called in `e'.
operands: % -> List SpadAst
++ arguments(e) returns the argument list used in the call `e'.
Private == add
Rep == List SpadAst
operator x == first rep x
operands x == rest rep x
coerce(x: %): OutputForm ==
elt('CallAst::OutputForm,
['operator::OutputForm = operator(x)::OutputForm,
'operands::OutputForm = operands(x)::OutputForm])$OutputForm
@
\subsection{The SegmentAst domain}
<<domain SEGAST SegmentAst>>=
SpadAst(): SpadAstExports
)abbrev domain SEGAST SegmentAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents segement expressions.
SegmentAst(): Public == Private where
Public == SpadSyntaxCategory with
bounds: % -> List SpadAst
++ bounds(s) returns the bounds of the segment `s'. If
++ `s' designates an infinite interval, then the returns
++ list a singleton list.
Private == add
Rep == List SpadAst
bounds x == rest rep x
coerce(x: %): OutputForm ==
elt('SegmentAst::OutputForm,
['bounds::OutputForm = bounds(x)::OutputForm])$OutputForm
@
\subsection{The SuchThatAst domain}
<<domain SUCHTAST SuchThatAst>>=
SpadAst(): SpadAstExports
)abbrev domain SUCHTAST SuchThatAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents the filter iterator syntax.
SuchThatAst(): Public == Private where
Public == SpadSyntaxCategory with
predicate: % -> SpadAst
++ predicate(e) returns the syntax object for the predicate
++ in the filter iterator syntax `e'.
Private == add
Rep == List SpadAst
predicate e == second rep e
coerce(x: %): OutputForm ==
elt('SuchThatAst::OutputForm,
['predicate::OutputForm = predicate(x)::OutputForm])$OutputForm
@
\subsection{The ColonAst domain}
<<domain COLONAST ColonAst>>=
SpadAst(): SpadAstExports
)abbrev domain COLONAST ColonAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents type specification
++ for an identifier or expression.
ColonAst(): Public == Private where
Public == SpadSyntaxCategory with
lhs: % -> SpadAst
++ lhs(e) returns the left hand side of the colon expression `e'.
rhs: % -> TypeAst
++ rhs(e) returns the right hand side of the colon expression `e'.
Private == add
Rep == List SpadAst
lhs x == (second rep x) : SpadAst
rhs x == (third rep x) : TypeAst
coerce(x: %): OutputForm ==
elt('ColonAst::OutputForm,
['lhs::OutputForm = lhs(x)::OutputForm,
'rhs::OutputForm = rhs(x)::OutputForm])$OutputForm
@
\subsection{The AddAst domain}
<<domain ADDAST AddAst>>=
SpadAst(): SpadAstExports
)abbrev domain ADDAST AddAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents the syntax for an add-expression.
AddAst(): Public == Private where
Public == SpadSyntaxCategory with
base: % -> SpadAst
++ base(d) returns the base domain(s) of the add-domain expression.
body: % -> SpadAst
++ base(d) returns the actual body of the add-domain expression `d'.
Private == add
Rep == List SpadAst
base x == second rep x
body x == third rep x
coerce(x: %): OutputForm ==
elt('AddAst::OutputForm,
['base::OutputForm = base(x)::OutputForm,
'body::OutputForm = body(x)::OutputForm])$OutputForm
@
\subsection{The CapsuleAst domain}
<<domain CAPSLAST CapsuleAst>>=
SpadAst(): SpadAstExports
)abbrev domain CAPSLAST CapsuleAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents the capsule of a domain definition.
CapsuleAst(): Public == Private where
Public == SpadSyntaxCategory with
body: % -> List SpadAst
++ body(c) returns the list of top level expressions appearing in `c'.
Private == add
Rep == Pair(Symbol, List SpadAst)
body x == second rep x
coerce(x: %): OutputForm ==
elt('CapsuleAst::OutputForm,
['body::OutputForm = body(x)::OutputForm])$OutputForm
@
\subsection{The CaseAst domain}
<<domain CASEAST CaseAst>>=
SpadAst(): SpadAstExports
)abbrev domain CASEAST CaseAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents a `case' expression.
CaseAst(): Public == Private where
Public == SpadSyntaxCategory with
lhs: % -> SpadAst
++ lhs(e) returns the left hand side of the case expression `e'.
rhs: % -> SpadAst
++ rhs(e) returns the right hand side of the case expression `e'.
Private == add
Rep == List SpadAst
lhs x == second rep x
rhs x == third rep x
coerce(x: %): OutputForm ==
elt('CaseAst::OutputForm,
['lhs::OutputForm = lhs(x)::OutputForm,
'rhs::OutputForm = rhs(x)::OutputForm])$OutputForm
@
\subsection{The HasAst domain}
<<domain HASAST HasAst>>=
SpadAst(): SpadAstExports
)abbrev domain HASAST HasAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents a `has' expression.
HasAst(): Public == Private where
Public == SpadSyntaxCategory with
lhs: % -> SpadAst
++ lhs(e) returns the left hand side of the has expression `e'.
rhs: % -> SpadAst
++ rhs(e) returns the right hand side of the case expression `e'.
Private == add
Rep == List SpadAst
lhs x == second rep x
rhs x == third rep x
coerce(x: %): OutputForm ==
elt('HasAst::OutputForm,
['lhs::OutputForm = lhs(x)::OutputForm,
'rhs::OutputForm = rhs(x)::OutputForm])$OutputForm
@
\subsection{The IsAst domain}
<<domain ISAST IsAst>>=
SpadAst(): SpadAstExports
)abbrev domain ISAST IsAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents a `has' expression.
IsAst(): Public == Private where
Public == SpadSyntaxCategory with
lhs: % -> SpadAst
++ lhs(e) returns the left hand side of the is expression `e'.
rhs: % -> SpadAst
++ rhs(e) returns the right hand side of the is expression `e'.
Private == add
Rep == List SpadAst
lhs x == second rep x
rhs x == third rep x
coerce(x: %): OutputForm ==
elt('IsAst::OutputForm,
['lhs::OutputForm = lhs(x)::OutputForm,
'rhs::OutputForm = rhs(x)::OutputForm])$OutputForm
@
\subsection{The CategoryAst domain}
<<domain CATAST CategoryAst>>=
SpadAst(): SpadAstExports
)abbrev domain CATAST CategoryAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents the unnamed category defined
++ by a list of exported signatures
CategoryAst(): Public == Private where
Public == SpadSyntaxCategory with
kind: % -> Symbol
++ kind(c) returns the kind of unnamed category, either
++ 'domain' or 'package'.
body: % -> List SpadAst
++ body(c) returns the list of exports in category syntax `c'.
Private == add
Rep == List SpadAst
kind x == (second rep x) : Symbol
body x == rest rest rep x
coerce(x: %): OutputForm ==
elt('CategoryAst::OutputForm,
['kind::OutputForm = kind(x)::OutputForm,
'body::OutputForm = body(x)::OutputForm])$OutputForm
@
\subsection{The WhereAst domain}
<<domain WHEREAST WhereAst>>=
SpadAst(): SpadAstExports
)abbrev domain WHEREAST WhereAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents the syntax of a `where' expression.
WhereAst(): Public == Private where
Public == SpadSyntaxCategory with
mainExpression: % -> SpadAst
++ mainExpression(e) returns the main expression of the
++ `where' expression `e'.
qualifier: % -> SpadAst
++ qualifier(e) returns the qualifier of the expression `e'.
Private == add
Rep == List SpadAst
mainExpression x == second rep x
qualifier x == third rep x
coerce(x: %): OutputForm ==
elt('WhereAst::OutputForm,
['mainExpression::OutputForm = mainExpression(x)::OutputForm,
'qualifier::OutputForm = qualifier(x)::OutputForm])$OutputForm
@
\subsection{The CommaAst domain}
<<domain COMMAAST CommaAst>>=
SpadAst(): SpadAstExports
)abbrev domain COMMAAST CommaAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents the syntax of a comma-separated
++ list of expressions.
CommaAst(): Public == Private where
Public == SpadSyntaxCategory with
body: % -> List SpadAst
++ body(e) returns the list of expressions making up `e'.
Private == add
Rep == List SpadAst
body x == rest rep x
coerce(x: %): OutputForm ==
elt('CommaAst::OutputForm,
['body::OutputForm = body(x)::OutputForm])$OutputForm
@
\subsection{The QuasiquoteAst domain}
<<domain QQUTAST QuasiquoteAst>>=
SpadAst(): SpadAstExports
)abbrev domain QQUTAST QuasiquoteAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents the syntax of a quasiquote
++ expression.
QuasiquoteAst(): Public == Private where
Public == SpadSyntaxCategory with
expression: % -> SpadAst
++ expression(e) returns the syntax for the expression being quoted.
Private == add
Rep == List SpadAst
expression x == second rep x
coerce(x: %): OutputForm ==
elt('QuasiquoteAst::OutputForm,
['expression::OutputForm = expression(x)::OutputForm])$OutputForm
@
\subsection{The DefinitionAst domain}
<<domain DEFAST DefinitionAst>>=
SpadAst(): SpadAstExports
)abbrev domain DEFAST DefinitionAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents the syntax of a definition.
DefinitionAst(): Public == Private where
Public == SpadSyntaxCategory with
head: % -> HeadAst
++ head(d) returns the head of the definition `d'. This is a
++ list of identifiers starting with the name of the operation
++ followed by the name of the parameters, if any.
signature: % -> Signature
++ signature(d) returns the signature of the operation being
++ defined. Note that this list may be partial in that it
++ contains only the types actually specified in the definition.
body: % -> SpadAst
++ body(d) returns the right hand side of the definition `d'.
Private == add
Rep == List SpadAst
head x == (second rep x) : HeadAst
signature x == (third rep x) : Signature
body x == last rep x
coerce(x: %): OutputForm ==
elt('DefinitionAst::OutputForm,
['head::OutputForm = head(x)::OutputForm,
'signature::OutputForm = signature(x)::OutputForm,
'body::OutputForm = body(x)::OutputForm])$OutputForm
@
\subsection{The MacroAst domain}
<<domain MACROAST MacroAst>>=
SpadAst(): SpadAstExports
)abbrev domain MACROAST MacroAst
++ Author: Gabriel Dos Reis
++ Date Created: November 10, 2007
++ Date Last Modified: September 21, 2008
++ Description: This domain represents the syntax of a macro definition.
MacroAst(): Public == Private where
Public == SpadSyntaxCategory with
head: % -> HeadAst
++ head(m) returns the head of the macro definition `m'. This is a
++ list of identifiers starting with the name of the macro
++ followed by the name of the parameters, if any.
body: % -> SpadAst
++ body(m) returns the right hand side of the definition `m'.
Private == add
Rep == List SpadAst
head x == (second rep x) : HeadAst
body x == last rep x
coerce(x: %): OutputForm ==
elt('MacroAst::OutputForm,
['head::OutputForm = head(x)::OutputForm,
'body::OutputForm = body(x)::OutputForm])$OutputForm
@
\subsection{The SpadAst domain}
<<domain SPADAST SpadAst>>=
)abbrev domain SPADAST SpadAst
++ Author: Gabriel Dos Reis
++ Date Created: September 21, 2008
++ Date Last Modified: September 21, 2008
++ Description: This domain represents a kind of base domain
++ for Spad syntax domain. It merely exists as a kind of
++ of abstract base in object-oriented programming language.
++ However, this is not an abstract class.
SpadAst(): SpadAstExports() == add
isAst(x: %, tag: Symbol): Boolean ==
(op := getOperator(x::Syntax)) case Symbol and op = tag
x case ImportAst == isAst(x,'import)
autoCoerce(x: %): ImportAst == x : ImportAst
x case DefinitionAst == isAst(x,'DEF)
autoCoerce(x: %): DefinitionAst == x : DefinitionAst
x case MacroAst == isAst(x,'MDEF)
autoCoerce(x: %): MacroAst == x : MacroAst
x case WhereAst == isAst(x,'where)
autoCoerce(x: %): WhereAst == x : WhereAst
x case CategoryAst == isAst(x,'CATEGORY)
autoCoerce(x: %): CategoryAst == x : CategoryAst
x case CapsuleAst == isAst(x,'CAPSULE)
autoCoerce(x: %): CapsuleAst == x : CapsuleAst
x case SignatureAst == isAst(x,'SIGNATURE)
autoCoerce(x: %): SignatureAst == x : SignatureAst
x case AttributeAst == isAst(x,'ATTRIBUTE)
autoCoerce(x: %): AttributeAst == x : AttributeAst
x case MappingAst == isAst(x,'Mapping)
autoCoerce(x: %): MappingAst == x : MappingAst
x case IfAst == isAst(x,'IF)
autoCoerce(x: %): IfAst == x : IfAst
x case RepeatAst == isAst(x,'REPEAT)
autoCoerce(x: %): RepeatAst == x : RepeatAst
x case WhileAst == isAst(x,'WHILE)
autoCoerce(x: %): WhileAst == x : WhileAst
x case InAst == isAst(x,'IN)
autoCoerce(x: %): InAst == x : InAst
x case CollectAst == isAst(x,'COLLECT)
autoCoerce(x: %): CollectAst == x : CollectAst
x case ConstructAst == isAst(x,'construct)
autoCoerce(x: %): ConstructAst == x : ConstructAst
x case ExitAst == isAst(x,'exit)
autoCoerce(x: %): ExitAst == x : ExitAst
x case ReturnAst == isAst(x,'RETURN)
autoCoerce(x: %): ReturnAst == x : ReturnAst
x case CoerceAst == isAst(x,'_:_:)
autoCoerce(x: %): CoerceAst == x : CoerceAst
x case PretendAst == isAst(x,'pretend)
autoCoerce(x: %): PretendAst == x : PretendAst
x case RestrictAst == isAst(x,'_@)
autoCoerce(x: %): RestrictAst == x : RestrictAst
x case SegmentAst == isAst(x,'SEGMENT)
autoCoerce(x: %): SegmentAst == x : SegmentAst
x case SequenceAst == isAst(x,'SEQ)
autoCoerce(x: %): SequenceAst == x : SequenceAst
x case LetAst == isAst(x,'_%LET)
autoCoerce(x: %): LetAst == x : LetAst
x case SuchThatAst == isAst(x,'_|)
autoCoerce(x: %): SuchThatAst == x : SuchThatAst
x case ColonAst == isAst(x,'_:)
autoCoerce(x: %): ColonAst == x : ColonAst
x case CaseAst == isAst(x,'_case)
autoCoerce(x: %): CaseAst == x : CaseAst
x case HasAst == isAst(x,'_has)
autoCoerce(x: %): HasAst == x : HasAst
x case IsAst == isAst(x,'_is)
autoCoerce(x: %): IsAst == x : IsAst
x case Identifier == (x::Syntax) case Symbol
autoCoerce(x: %): Identifier == x:Identifier
x case String == (x::Syntax) case String
autoCoerce(x: %): String == x : String
x case Integer == (x::Syntax) case Integer
autoCoerce(x: %): Integer == x : Integer
coerce(x: %): OutputForm ==
x' := x : Syntax
compound? x' and ((op := getOperator x') case Symbol) =>
op = 'IF => x:IfAst::OutputForm
op = 'REPEAT => x:RepeatAst::OutputForm
op = 'WHILE => x:WhileAst::OutputForm
op = 'IN => x:InAst::OutputForm
op = 'COLLECT => x:CollectAst::OutputForm
op = 'construct => x:ConstructAst::OutputForm
op = 'exit => x:ExitAst::OutputForm
op = 'return => x:ReturnAst::OutputForm
op = 'SEQ => x:SequenceAst::OutputForm
op = '_%LET => x:LetAst::OutputForm
op = 'pretend => x:PretendAst::OutputForm
op = '_:_: => x:CoerceAst::OutputForm
op = '_@ => x:RestrictAst::OutputForm
op = 'SEGMENT => x:SegmentAst::OutputForm
op = '_| => x:SuchThatAst::OutputForm
op = '_: => x:ColonAst::OutputForm
op = 'add => x:AddAst::OutputForm
op = '_case => x:CaseAst::OutputForm
op = '_has => x:CaseAst::OutputForm
op = '_is => x:CaseAst::OutputForm
op = 'where => x:WhereAst::OutputForm
op = '_%Comma => x:CommaAst::OutputForm
op = 'Mapping => x:MappingAst::OutputForm
op = 'DEF => x:DefinitionAst::OutputForm
op = 'MDEF => x:MacroAst::OutputForm
op = 'SIGNATURE => x:SignatureAst::OutputForm
op = 'ATTRIBUTE => x:AttributeAst::OutputForm
op = 'CATEGORY => x:CategoryAst::OutputForm
op = 'CAPSULE => x:CapsuleAst::OutputForm
op = 'import => x:ImportAst::OutputForm
x'::OutputForm
x'::OutputForm
@
\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 SYNTAX Syntax>>
<<domain SIG Signature>>
<<domain CTORCALL ConstructorCall>>
<<domain ELABEXPR ElaboratedExpression>>
<<category ASTCAT AbstractSyntaxCategory>>
<<category SASTCAT SpadSyntaxCategory>>
<<category SPADXPT SpadAstExports>>
<<domain LITERAL Literal>>
<<domain HEADAST HeadAst>>
<<domain TYPEAST TypeAst>>
<<domain ATTRAST AttributeAst>>
<<domain IMPTAST ImportAst>>
<<domain MAPPAST MappingAst>>
<<domain SIGAST SignatureAst>>
<<domain JOINAST JoinAst>>
<<domain IFAST IfAst>>
<<domain RPTAST RepeatAst>>
<<domain WHILEAST WhileAst>>
<<domain INAST InAst>>
<<domain CLLCTAST CollectAst>>
<<domain LSTAST ConstructAst>>
<<domain EXITAST ExitAst>>
<<domain RETAST ReturnAst>>
<<domain SEGAST SegmentAst>>
<<domain SEQAST SequenceAst>>
<<domain PRTDAST PretendAst>>
<<domain CRCEAST CoercedAst>>
<<domain RSTRCAST RestrictAst>>
<<domain LETAST LetAst>>
<<domain RDUCEAST ReduceAst>>
<<domain SUCHTAST SuchThatAst>>
<<domain COLONAST ColonAst>>
<<domain ADDAST AddAst>>
<<domain CAPSLAST CapsuleAst>>
<<domain CASEAST CaseAst>>
<<domain HASAST HasAst>>
<<domain ISAST IsAst>>
<<domain CATAST CategoryAst>>
<<domain WHEREAST WhereAst>>
<<domain COMMAAST CommaAst>>
<<domain QQUTAST QuasiquoteAst>>
<<domain DEFAST DefinitionAst>>
<<domain MACROAST MacroAst>>
@
\end{document}
|