| author | paulson |
| Thu, 21 Sep 2006 17:31:10 +0200 | |
| changeset 20660 | 8606ddd42554 |
| parent 20647 | 680b58597f65 |
| permissions | -rw-r--r-- |
|
20647
680b58597f65
Added in combinator reduction axioms for B' C' and S'. Also split the original reduction axioms into separate files: I+K, B+C, S, B'+C', S'.
mengj
parents:
diff
changeset
|
1 |
%ID: $Id$ |
|
680b58597f65
Added in combinator reduction axioms for B' C' and S'. Also split the original reduction axioms into separate files: I+K, B+C, S, B'+C', S'.
mengj
parents:
diff
changeset
|
2 |
%Author: Jia Meng, NICTA |
|
680b58597f65
Added in combinator reduction axioms for B' C' and S'. Also split the original reduction axioms into separate files: I+K, B+C, S, B'+C', S'.
mengj
parents:
diff
changeset
|
3 |
%full-typed combinator reduction for B', C' |
|
680b58597f65
Added in combinator reduction axioms for B' C' and S'. Also split the original reduction axioms into separate files: I+K, B+C, S, B'+C', S'.
mengj
parents:
diff
changeset
|
4 |
|
|
680b58597f65
Added in combinator reduction axioms for B' C' and S'. Also split the original reduction axioms into separate files: I+K, B+C, S, B'+C', S'.
mengj
parents:
diff
changeset
|
5 |
clause( |
|
680b58597f65
Added in combinator reduction axioms for B' C' and S'. Also split the original reduction axioms into separate files: I+K, B+C, S, B'+C', S'.
mengj
parents:
diff
changeset
|
6 |
forall([A, B, C, F, G, U, V, X], |
|
20660
8606ddd42554
corrected for the translation from _ to __ in c_COMBx_e
paulson
parents:
20647
diff
changeset
|
7 |
or( equal(typeinfo(hAPP(typeinfo(hAPP(typeinfo(hAPP(typeinfo(hAPP(typeinfo(c_COMBB__e,tc_fun(tc_fun(A,B),tc_fun(tc_fun(U,A),tc_fun(tc_fun(V,U),tc_fun(V,B))))),typeinfo(C,tc_fun(A,B))),tc_fun(tc_fun(U,A),tc_fun(tc_fun(V,U),tc_fun(V,B)))),typeinfo(F,tc_fun(U,A))),tc_fun(tc_fun(V,U),tc_fun(V,B))),typeinfo(G,tc_fun(V,U))),tc_fun(V,B)),typeinfo(X,V)),B),typeinfo(hAPP(typeinfo(C,tc_fun(A,B)),typeinfo(hAPP(typeinfo(F,tc_fun(U,A)),typeinfo(hAPP(typeinfo(G,tc_fun(V,U)),typeinfo(X,V)),U)),A)),B)))), |
|
20647
680b58597f65
Added in combinator reduction axioms for B' C' and S'. Also split the original reduction axioms into separate files: I+K, B+C, S, B'+C', S'.
mengj
parents:
diff
changeset
|
8 |
a6 ). |
|
680b58597f65
Added in combinator reduction axioms for B' C' and S'. Also split the original reduction axioms into separate files: I+K, B+C, S, B'+C', S'.
mengj
parents:
diff
changeset
|
9 |
|
|
680b58597f65
Added in combinator reduction axioms for B' C' and S'. Also split the original reduction axioms into separate files: I+K, B+C, S, B'+C', S'.
mengj
parents:
diff
changeset
|
10 |
clause( |
|
680b58597f65
Added in combinator reduction axioms for B' C' and S'. Also split the original reduction axioms into separate files: I+K, B+C, S, B'+C', S'.
mengj
parents:
diff
changeset
|
11 |
forall([A, B, C, F, G, U, V, X], |
|
20660
8606ddd42554
corrected for the translation from _ to __ in c_COMBx_e
paulson
parents:
20647
diff
changeset
|
12 |
or( equal(typeinfo(hAPP(typeinfo(hAPP(typeinfo(hAPP(typeinfo(hAPP(typeinfo(c_COMBC__e,tc_fun(tc_fun(A,tc_fun(B,U)),tc_fun(tc_fun(V,A),tc_fun(B,tc_fun(V,U))))),typeinfo(C,tc_fun(A,tc_fun(B,U)))),tc_fun(tc_fun(V,A),tc_fun(B,tc_fun(V,U)))),typeinfo(F,tc_fun(V,A))),tc_fun(B,tc_fun(V,U))),typeinfo(G,B)),tc_fun(V,U)),typeinfo(X,V)),U),typeinfo(hAPP(typeinfo(hAPP(typeinfo(C,tc_fun(A,tc_fun(B,U))),typeinfo(hAPP(typeinfo(F,tc_fun(V,A)),typeinfo(X,V)),A)),tc_fun(B,U)),typeinfo(G,B)),U)))), |
|
20647
680b58597f65
Added in combinator reduction axioms for B' C' and S'. Also split the original reduction axioms into separate files: I+K, B+C, S, B'+C', S'.
mengj
parents:
diff
changeset
|
13 |
a7 ). |