|
1 %ID: $Id$ |
|
2 %Author: Jia Meng, NICTA |
|
3 %typed combinator reduction for const-types-only (no S) |
|
4 |
|
5 %K P Q --> P |
|
6 input_clause(a1,axiom, |
|
7 [++equal(hAPP(hAPP(c_COMBK(A,B),P),Q),P)]). |
|
8 |
|
9 %I P --> P |
|
10 input_clause(a3,axiom, |
|
11 [++equal(hAPP(c_COMBI(T),P),P)]). |
|
12 |
|
13 %B P Q R --> P(Q R) |
|
14 input_clause(a4,axiom, |
|
15 [++equal(hAPP(hAPP(hAPP(c_COMBB(A,B,C),P),Q),R),hAPP(P,hAPP(Q,R)))]). |
|
16 |
|
17 |
|
18 %C P Q R --> P R Q |
|
19 input_clause(a5,axiom, |
|
20 [++equal(hAPP(hAPP(hAPP(c_COMBC(A,B,C),P),Q),R),hAPP(hAPP(P,R),Q))]). |
|
21 |
|
22 %the combinators are all different |
|
23 input_clause(a6,axiom, |
|
24 [--equal(c_COMBI(T),c_COMBK(A,B))]). |
|
25 |
|
26 input_clause(a8,axiom, |
|
27 [--equal(c_COMBI(T),c_COMBB(A,B,C))]). |
|
28 |
|
29 input_clause(a9,axiom, |
|
30 [--equal(c_COMBI(T),c_COMBC(A,B,C))]). |
|
31 |
|
32 input_clause(a11,axiom, |
|
33 [--equal(c_COMBK(A,B),c_COMBB(A1,B1,C1))]). |
|
34 |
|
35 input_clause(a12,axiom, |
|
36 [--equal(c_COMBK(A,B),c_COMBC(A2,B2,C2))]). |
|
37 |
|
38 input_clause(a15,axiom, |
|
39 [--equal(c_COMBB(A1,B1,C1),c_COMBC(A2,B2,C2))]). |
|
40 |
|
41 input_clause(a16,axiom, |
|
42 [--hBOOL(hAPP(hAPP(fequal(A),X),Y)),++equal(X,Y)]). |
|
43 |
|
44 input_clause(a17,axiom, |
|
45 [++hBOOL(hAPP(hAPP(fequal(A),X),Y)),--equal(X,Y)]). |
|
46 |
|
47 |
|
48 |