Ait-Kaci H.Warren's abstract machine.A tutorial reconstruction.1999

WARREN’S ABSTRACT MACHINE

example, 72–74 explicit definition, 66

for WAM, 100 put value, 23

example, 31, 43, 55, 57, 61, 64, 72

explicit definition, 23 for WAM, 99

put variable, 23

example, 24, 31, 51, 55, 57, 61, 64, 72–74

explicit definition, 62 for WAM, 99

for a temporary variable, 23

query, 9

compilation, 11, 22, 27 empty, 25

reference

chain, 16, 63, 65 chronological, 63 dangling, 62, 63

stack, 62, 63, 65, 67, 68 register allocation, 12, 54 resolution

flat, 6, 25 leftmost, 25, 33 SLD, 5, 33 top-down, 33

retry, 79

explicit definition for WAM, 110

retry me else, 39 example, 43, 80–82 explicit definition, 41

for WAM, 108 Robinson, John Alan, 95

Rosenzweig, Dean, 83, 84, 86 rule, 25

binding, 64, 68, 69 chain, 25, 57, 86 compilation, 27 deep, 25, 86

Russinoff, David, 5

S register, 16

set constant, 48 example, 51

explicit definition, 49 for WAM, 103

set local value, 68 explicit definition, 69

for WAM, 103 set value, 13

example, 14, 24, 51 explicit definition, 14

for WAM, 102 set variable, 13

example, 14, 24, 51 explicit definition, 14

for WAM, 102 set void, 52

explicit definition, 53 for WAM, 103

shallow cut, 83, 84 signature, 91 stack, 28

frame, 28 global, 13 local, 28

structure, 9 cell, 10

substitution, 19, 91 application, 19, 94 composition, 19, 92

PAGE 126 OF 129

Reprinted from MIT Press Copyright c Hassan A¨IT-KACI

A TUTORIAL RECONSTRUCTION

switch on constant, 78 example, 80, 81

explicit definition for WAM, 111

switch on structure, 79 example, 80, 81

explicit definition for WAM, 111

switch on term, 78 example, 80–82 explicit definition

for WAM, 110

term

L0 program, 9 L0 query, 9 first-order, 9, 91 representation, 10

tidy trail operation, 85 tidy trail operation, 115 TR register, 37

trail, 36 cleanup, 85 pointer, 37 tamping, 85

unwinding, 40 trail operation, 114 trailing

unnecessary, 62 variable, 37, 62

trimming delayed, 73

environment, 58, 59, 61, 64, 68, 71–74, 85

trust, 79 example, 80, 81

explicit definition for WAM, 110

trust me, 39 example, 43, 80–82 explicit definition, 42

for WAM, 109 try, 79

example, 80, 81 explicit definition for WAM, 109

try me else, 39 example, 43, 80–82 explicit definition

for M3, 41 for WAM, 108

unbound variable, 10 unification, 9, 92

algorithm, 19, 93 unify operation

for M0, 20 for WAM, 116

unify constant, 47 example, 51

explicit definition, 49 for WAM, 105

unify local value, 68 explicit definition, 69 for WAM, 104

unify value, 16 example, 16, 82 explicit definition, 18

for WAM, 104 unify variable, 15

example, 16, 24, 51, 80–82 explicit definition, 18

for WAM, 104 unify void, 52

example, 53, 80 explicit definition, 53

Copyright c Hassan A¨IT-KACI Reprinted from MIT Press

PAGE 127 OF 129

				WARREN’S ABSTRACT MACHINE
	for WAM, 105			David S., 4
	unwind		trail operation, 114	X register, 11
	van Hentenryck, Pascal, 67
	variable, 9
	anonymous, 47
	instructions, 53
	binding, 10, 16, 62
	cell, 10
	classification, 69
	Warren’s, 70
	cut, 85
	global, 70
	globalizing, 67–69, 71
	local, 28, 60, 70
	permanent, 27, 28, 69
	discarding, 62, 64, 66–68
	ordering, 63
	register, 11
	temporary, 27, 69
	unsafe, 64
	WAM, 3
	clause treatment, 89
	complete, 3, 6
	correctness, 5
	designer, 4
	features, 4
	publication, 3
	simplification, 5
	techniques, 4
	unification, 89
	variant, 4
	WAM Binding Rule, 63, 64, 68, 69
	WAM Principle, 45, 47, 60, 79
	Warren
	Abstract Machine, 3
	David H. D., 3, 45, 89, 90

PAGE 128 OF 129

Reprinted from MIT Press Copyright c Hassan A¨IT-KACI

A TUTORIAL RECONSTRUCTION

Copyright c Hassan A¨IT-KACI Reprinted from MIT Press

PAGE 129 OF 129