|
1 %ID: $Id$ |
|
2 %Author: Jia Meng, NICTA |
|
3 %untyped combinator reduction (include S) |
|
4 |
|
5 input_clause(a1,axiom, |
|
6 [++equal(hAPP(hAPP(c_COMBK,P),Q),P)]). |
|
7 |
|
8 %S P Q R |
|
9 input_clause(a2,axiom, |
|
10 [++equal(hAPP(hAPP(hAPP(c_COMBS,P),Q),R),hAPP(hAPP(P,R),hAPP(Q,R)))]). |
|
11 |
|
12 input_clause(a3,axiom, |
|
13 [++equal(hAPP(c_COMBI,P),P)]). |
|
14 |
|
15 %B P Q R --> P(Q R) |
|
16 input_clause(a4,axiom, |
|
17 [++equal(hAPP(hAPP(hAPP(c_COMBB,P),Q),R),hAPP(P,hAPP(Q,R)))]). |
|
18 |
|
19 %C P Q R --> P R Q |
|
20 input_clause(a5,axiom, |
|
21 [++equal(hAPP(hAPP(hAPP(c_COMBC,P),Q),R),hAPP(hAPP(P,R),Q))]). |
|
22 |
|
23 %the combinators are all different |
|
24 input_clause(a6,axiom, |
|
25 [--equal(c_COMBI,c_COMBK)]). |
|
26 |
|
27 input_clause(a7,axiom, |
|
28 [--equal(c_COMBI,c_COMBS)]). |
|
29 |
|
30 input_clause(a8,axiom, |
|
31 [--equal(c_COMBI,c_COMBB)]). |
|
32 |
|
33 input_clause(a9,axiom, |
|
34 [--equal(c_COMBI,c_COMBC)]). |
|
35 |
|
36 input_clause(a10,axiom, |
|
37 [--equal(c_COMBK,c_COMBS)]). |
|
38 |
|
39 input_clause(a11,axiom, |
|
40 [--equal(c_COMBK,c_COMBB)]). |
|
41 |
|
42 input_clause(a12,axiom, |
|
43 [--equal(c_COMBK,c_COMBC)]). |
|
44 |
|
45 input_clause(a13,axiom, |
|
46 [--equal(c_COMBS,c_COMBB)]). |
|
47 |
|
48 input_clause(a14,axiom, |
|
49 [--equal(c_COMBS,c_COMBC)]). |
|
50 |
|
51 input_clause(a15,axiom, |
|
52 [--equal(c_COMBB,c_COMBC)]). |
|
53 |
|
54 input_clause(a16,axiom, |
|
55 [--hBOOL(hAPP(hAPP(fequal,X),Y)),++equal(X,Y)]). |
|
56 |
|
57 input_clause(a17,axiom, |
|
58 [++hBOOL(hAPP(hAPP(fequal,X),Y)),--equal(X,Y)]). |
|
59 |
|
60 |
|
61 |