File: metaIntNewNarrowSearch.maude

package info (click to toggle)
maude 3.5.1-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 18,480 kB
  • sloc: cpp: 133,192; makefile: 2,180; yacc: 1,984; sh: 1,373; lex: 886
file content (126 lines) | stat: -rw-r--r-- 3,726 bytes parent folder | download | duplicates (4)
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
set show timing off .
set show advisories off .

***
*** Test getNarrowingSearchResult()/getNarrowingSearchResultAndPath() in the meta-interpreter.
***

load metaInterpreter

mod NARROW is
  sort Foo .
  ops f g h : Foo -> Foo .
  ops i j k : Foo Foo -> Foo .

vars X Y Z W A B C D : Foo .
  eq j(f(X), Y) = i(f(Y), X) [variant] .
  rl g(i(X, k(Y, Z))) => f(k(Z, X)) [narrowing] .
endm

mod NARROW-TEST is
  pr META-INTERPRETER .
  sort MsgList .
  subsort Msg < MsgList .
  op empty : -> MsgList .
  op _;_ : MsgList MsgList -> MsgList [assoc id: empty] .

  op me : -> Oid .
  op User : -> Cid .
  op soln:_ : Nat -> Attribute .
  op got:_  : MsgList -> Attribute .
  op start:_ : Term -> Attribute .
  op goal:_ : Term -> Attribute .
  op fold:_ : Qid -> Attribute .

  vars X Y Z : Oid .
  var AS : AttributeSet .
  vars N M : Nat .
  vars S S' : Substitution .
  var ST T G : Term .
  var TY : Type .
  var C : Context .
  var Q Q' L : Qid .
  var ML : MsgList .
  var TL : TermList .
  var F : Qid .

  rl < X : User | AS > createdInterpreter(X, Y, Z) =>
     < X : User | AS > insertModule(Z, X, upModule('NARROW, true)) .

  rl < X : User | AS, start: ST, goal: G, fold: F > insertedModule(X, Y) =>
     < X : User | AS, soln: 1, start: ST, goal: G, fold: F, got: empty >
     getNarrowingSearchResult(Y, X, 'NARROW, ST, G, '*, unbounded, F, 0) .

  rl < X : User | AS, soln: N, start: ST, goal: G, fold: F, got: ML >
     gotNarrowingSearchResult(X, Y, M, T, TY, S, Q, S', Q') =>
     < X : User | AS, soln: (N + 1),  start: ST, goal: G, fold: F,
     got: (ML ; gotNarrowingSearchResult(X, Y, M, T, TY, S, Q, S', Q')) >
     getNarrowingSearchResult(Y, X, 'NARROW, ST, G, '*, unbounded, F, N) .
endm

set show breakdown on .

erew in NARROW-TEST : <> 
< me : User | start: ('g['j['A:Foo, 'B:Foo]]),
goal: 'C:Foo,
fold: 'none >
createInterpreter(interpreterManager, me, none) .

erew in NARROW-TEST : <> 
< me : User | start: ('g['j['A:Foo, 'B:Foo]]),
goal: 'C:Foo,
fold: 'match >
createInterpreter(interpreterManager, me, none) .

mod NARROW-TEST is
  pr META-INTERPRETER .
  sort MsgList .
  subsort Msg < MsgList .
  op empty : -> MsgList .
  op _;_ : MsgList MsgList -> MsgList [assoc id: empty] .

  op me : -> Oid .
  op User : -> Cid .
  op soln:_ : Nat -> Attribute .
  op got:_  : MsgList -> Attribute .
  op start:_ : Term -> Attribute .
  op goal:_ : Term -> Attribute .
  op fold:_ : Qid -> Attribute .

  vars X Y Z : Oid .
  var AS : AttributeSet .
  vars N M : Nat .
  vars S S' : Substitution .
  var ST T G : Term .
  var TY : Type .
  var C : Context .
  var Q Q' L : Qid .
  var ML : MsgList .
  var TL : TermList .
  var F : Qid .
  var TR : NarrowingTrace .
  rl < X : User | AS > createdInterpreter(X, Y, Z) =>
     < X : User | AS > insertModule(Z, X, upModule('NARROW, true)) .

  rl < X : User | AS, start: ST, goal: G, fold: F > insertedModule(X, Y) =>
     < X : User | AS, soln: 1, start: ST, goal: G, fold: F, got: empty >
     getNarrowingSearchResultAndPath(Y, X, 'NARROW, ST, G, '*, unbounded, F, 0) .

  rl < X : User | AS, soln: N, start: ST, goal: G, fold: F, got: ML >
     gotNarrowingSearchResultAndPath(X, Y, M, T, TY, S, TR, S', Q') =>
     < X : User | AS, soln: (N + 1),  start: ST, goal: G, fold: F,
     got: (ML ; gotNarrowingSearchResultAndPath(X, Y, M, T, TY, S, TR, S', Q')) >
     getNarrowingSearchResultAndPath(Y, X, 'NARROW, ST, G, '*, unbounded, F, N) .
endm

erew in NARROW-TEST : <> 
< me : User | start: ('g['j['A:Foo, 'B:Foo]]),
goal: 'C:Foo,
fold: 'none >
createInterpreter(interpreterManager, me, none) .

erew in NARROW-TEST : <> 
< me : User | start: ('g['j['A:Foo, 'B:Foo]]),
goal: 'C:Foo,
fold: 'match >
createInterpreter(interpreterManager, me, none) .