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
|
set show timing off .
***
*** Test variant unification in the meta-interpreter.
***
load metaInterpreter
fmod XOR is
sort XOR .
sort Elem .
ops c1 c2 c3 c4 : -> Elem .
subsort Elem < XOR .
op _+_ : XOR XOR -> XOR [ctor assoc comm] .
op 0 : -> XOR .
op a : -> XOR .
vars X Y : XOR .
eq Y + 0 = Y [variant] .
eq X + X = 0 [variant] .
eq X + X + Y = Y [variant] .
endfm
mod VARIANT-UNIFY-TEST is
pr META-INTERPRETER .
sort MsgList .
subsort Msg < MsgList .
op me : -> Oid .
op User : -> Cid .
op problem:(_,_) : UnificationProblem TermList -> Attribute .
op soln:_ : Nat -> Attribute .
op result : MsgList -> Attribute .
op _,_ : MsgList MsgList -> MsgList [assoc id: nil] .
op nil : -> MsgList .
vars X Y Z : Oid .
var AS : AttributeSet .
var N : Nat .
var V : Term .
var TL : TermList .
var S : Substitution .
var Q : Qid .
var B : Bool .
var P : Parent .
var R : RewriteCount .
var ML : MsgList .
var UP : UnificationProblem .
rl < X : User | AS > createdInterpreter(X, Y, Z) =>
< X : User | AS > insertModule(Z, X, upModule('XOR, true)) .
rl < X : User | AS, problem:(UP, TL) > insertedModule(X, Y) =>
< X : User | AS, problem:(UP, TL), soln: 1, result(nil) > getVariantUnifier(Y, X, 'XOR, UP, TL, '#, 0) .
rl < X : User | AS, problem:(UP, TL), soln: N, result(ML) > gotVariantUnifier(X, Y, R, S, Q) =>
< X : User | AS, problem:(UP, TL), soln: (N + 1), result(ML, gotVariantUnifier(X, Y, R, S, Q)) >
getVariantUnifier(Y, X, 'XOR, UP, TL, '#, N) .
endm
erew in VARIANT-UNIFY-TEST : <>
< me : User | problem: ('_+_['X:XOR, 'c1.Elem] =? '_+_['Y:XOR, 'c2.Elem], empty) >
createInterpreter(interpreterManager, me, newProcess) .
variant unify in XOR : X:XOR + c1 =? Y:XOR + c2 .
erew in VARIANT-UNIFY-TEST : <>
< me : User | problem: ('_+_['X:XOR, 'c1.Elem] =? '_+_['Y:XOR, 'c2.Elem], '_+_['X:XOR, 'c1.Elem]) >
createInterpreter(interpreterManager, me, newProcess) .
variant unify in XOR : X:XOR + c1 =? Y:XOR + c2 such that X:XOR + c1 irreducible .
mod DISJOINT-VARIANT-UNIFY-TEST is
pr META-INTERPRETER .
sort MsgList .
subsort Msg < MsgList .
op me : -> Oid .
op User : -> Cid .
op problem:(_,_) : UnificationProblem TermList -> Attribute .
op soln:_ : Nat -> Attribute .
op result : MsgList -> Attribute .
op _,_ : MsgList MsgList -> MsgList [assoc id: nil] .
op nil : -> MsgList .
vars X Y Z : Oid .
var AS : AttributeSet .
var N : Nat .
var V : Term .
var TL : TermList .
vars S S' : Substitution .
var Q : Qid .
var B : Bool .
var P : Parent .
var R : RewriteCount .
var ML : MsgList .
var UP : UnificationProblem .
rl < X : User | AS > createdInterpreter(X, Y, Z) =>
< X : User | AS > insertModule(Z, X, upModule('XOR, true)) .
rl < X : User | AS, problem:(UP, TL) > insertedModule(X, Y) =>
< X : User | AS, problem:(UP, TL), soln: 1, result(nil) > getDisjointVariantUnifier(Y, X, 'XOR, UP, TL, '#, 0) .
rl < X : User | AS, problem:(UP, TL), soln: N, result(ML) > gotDisjointVariantUnifier(X, Y, R, S, S', Q) =>
< X : User | AS, problem:(UP, TL), soln: (N + 1), result(ML, gotDisjointVariantUnifier(X, Y, R, S, S', Q)) >
getDisjointVariantUnifier(Y, X, 'XOR, UP, TL, '#, N) .
endm
erew in DISJOINT-VARIANT-UNIFY-TEST : <>
< me : User | problem: ('_+_['X:XOR, 'c1.Elem] =? '_+_['Y:XOR, 'c2.Elem], empty) >
createInterpreter(interpreterManager, me, newProcess) .
erew in DISJOINT-VARIANT-UNIFY-TEST : <>
< me : User | problem: ('_+_['X:XOR, 'c1.Elem] =? '_+_['Y:XOR, 'c2.Elem], '_+_['X:XOR, 'c1.Elem]) >
createInterpreter(interpreterManager, me, newProcess) .
|
