INDEX

A | B | C | D | E | F | G | I | L | M | N | O | P | Q | R | S | T | U | V | W | X | $

A

 abnormal stop 1.5, 6.4
activation brackets see evaluation brackets
acyclic graph
22,Ref-11
applicable sentences 17
applicative order 18
126,Ref-16
arithmetic expressions 121
arithmetic functions Ref-11

B

 basic Refal 4
basic Refal 50
blanks 8,Ref-6
51,52,58
block 5,15-16,89,93-95
blocks, implementation of 96
branching 62-63,68
brackets as pointers 50-54
break point 29
97,Ref-13
built-in functions 18,23
Bury-Dig functions 89,97-101

C

 Callmu 133
23,Ref-9
channels of input-output 33
character-symbol Ref-5
148
19,20,76,79,83
Ref-15
closed e-variables 45
comment lines 15,27,55
comments Ref-8
comments, slashed 16-17,27
communication between
functions 69
Ref-12
conditions 89-91
configuration 144
consecutive processing 67
conservative predicates 65
52,54,69
98,Ref-13

D

 data structures of Refal 2,9
datatypes 57
deadlock in mapping 45,91
delayed metacoding 138
depth-first search 76,107
97,Ref-13
Ref-14
Ref-12
Ref-12
138,146,Ref-17
downgrading 136
driving 149
duplication of variables 61-67
dynamic Mu 134-135

E

 e-variable 13
efficiency considerations 4,21,
,52-54,59-61,62,65,66-67,
,96,100,114,120,145
efficient interpretation 40
End-Of-File character 29
entry functions 26,31
146
evaluation brackets 16
evaluator 29-30,141-142
Ref-15
expression 10-11,Ref-6
expression exchange code
,Ref-18
extended Refal 89
29-30,142,Ref-1

F

 Fab 74-75
factorial 20
20,72-73
Ref-15
format comments 55-56
formats of functions 54-58,68
free variable 5,12,Ref-6
freezer 2,143
146

G

 Get 33,Ref-10
26
ground expression 17,139,Ref-7

I

 identifier 6,13,Ref-5
62
implicit resursion 60
Ref-15
87
par
142
input-output functions 33-40,147
9,35,126
insertion sort 115
inside-out order
see applicative order
interpreters 133
21
iteration 70
iterative factorial 73

L

 Last Ref-15
left-to-right matching 43
lengthening of open variables
,91,94
Ref-16
levels of control 132
Lisp 2,73-74
Ref-16

M

 macrodigit 6,Ref-5
main module 32
mapping numbers 44
mapping, general requirements 43-44
mapping, rules of 44-45
marked expression 80
83,Ref-1
merge-sort 115-116
metacode 136-137
metasystem transition 132
Missionaries and
Cannibales 102,110-112
modules 31,133
Ref-12
134
multibrackets 80-81
Ref-12
133,Ref-16
134

N

 nested parentheses 76 Ref-14

O

 object expression 9,42
one-address computer 121
open e-variables 45
33-34,37,Ref-10
63,93-94,113
Ref-15

P

 Pair 84
palindrome 4-5
5
parallel function calls 68
partial evaluation 2,145
Pascal 70,73
passive expression 17
paths in a graph 118
119-121
pattern expression 12,42,Ref-7
pattern matching 13,42-49
pointer 79
77
69,89-90
63,65
65-66
pretty print 77
primary active sub-expression 17
24,39,Ref-10
program field 17
program transformation 143
projecting see matching
Prolog 2
23,39,Ref-10
34,Ref-11
33-34,Ref-10

Q

 quick-sort 117-118
quotes 7,Ref-5

R

 RASL 28,31,41,99,Ref-2
real numbers 8,Ref-5
R-13
Ref-12
recursion 70
recursive arithmetic 22
Refal machine 6,17
Ref-2
28,Ref-2
35,126,Ref-2
29,Ref-3,Ref-18
75
rigid elements of patterns 45
Ref-13

S

 s-variable 13
self-application 136
sentence 5,15,Ref-7
sorting algorithms 113
sorting, definition 114
static Mu 134-135
Ref-16
structure brackets 9,Ref-4
60-61,95-96
sub-arguments 54-55
Ref-11
87
symbol 6
symbolic name see identifier
Ref-14
System diskette Ref-1

T

 t-variable 13
tail recursion 73
term 9
Ref-16
tracer 146,Ref-18
24,26,100
translate a word 21
translation of arithmetic ex-
pressions 121
22,100
123
87
trees 11,85-86,127
Ref-12

148
type signs (indicators) 13,Ref-4
Ref-14

U

 unnamed functions 94
140,Ref-3
upgrading 136
Ref-16
139,146,Ref-17
133

V

 view field 17
visible functions 134

W

 where-clauses 89-91
where-with sign 90
whole numbers 7-8
with-clauses 89,93-95

X

 Xxin 36
36
Xxout 36

$

 $-functions 91-92,96
26,32,Ref-4
see
32,134,Ref-4
see