author | paulson |
Wed, 21 Aug 1996 13:22:23 +0200 | |
changeset 1933 | 8b24773de6db |
parent 1479 | 21eb5e156d91 |
child 2275 | dbce3dce821a |
permissions | -rw-r--r-- |
1479 | 1 |
(* Title: HOLCF/cfun1.thy |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
2 |
ID: $Id$ |
1479 | 3 |
Author: Franz Regensburger |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
4 |
Copyright 1993 Technische Universitaet Muenchen |
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
5 |
|
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
6 |
Definition of the type -> of continuous functions |
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
7 |
|
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
8 |
*) |
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
9 |
|
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
10 |
Cfun1 = Cont + |
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
11 |
|
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
12 |
|
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
13 |
(* new type of continuous functions *) |
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
14 |
|
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
15 |
types "->" 2 (infixr 5) |
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
16 |
|
1479 | 17 |
arities "->" :: (pcpo,pcpo)term (* No properties for ->'s range *) |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
18 |
|
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
19 |
consts |
1479 | 20 |
Cfun :: "('a => 'b)set" |
21 |
fapp :: "('a -> 'b)=>('a => 'b)" (* usually Rep_Cfun *) |
|
22 |
(* application *) |
|
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
23 |
|
1479 | 24 |
fabs :: "('a => 'b)=>('a -> 'b)" (binder "LAM " 10) |
25 |
(* usually Abs_Cfun *) |
|
26 |
(* abstraction *) |
|
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
27 |
|
1479 | 28 |
less_cfun :: "[('a -> 'b),('a -> 'b)]=>bool" |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
29 |
|
1168
74be52691d62
The curried version of HOLCF is now just called HOLCF. The old
regensbu
parents:
430
diff
changeset
|
30 |
syntax "@fapp" :: "('a -> 'b)=>('a => 'b)" ("_`_" [999,1000] 999) |
74be52691d62
The curried version of HOLCF is now just called HOLCF. The old
regensbu
parents:
430
diff
changeset
|
31 |
|
74be52691d62
The curried version of HOLCF is now just called HOLCF. The old
regensbu
parents:
430
diff
changeset
|
32 |
translations "f`x" == "fapp f x" |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
33 |
|
1168
74be52691d62
The curried version of HOLCF is now just called HOLCF. The old
regensbu
parents:
430
diff
changeset
|
34 |
defs |
1479 | 35 |
Cfun_def "Cfun == {f. cont(f)}" |
1168
74be52691d62
The curried version of HOLCF is now just called HOLCF. The old
regensbu
parents:
430
diff
changeset
|
36 |
|
74be52691d62
The curried version of HOLCF is now just called HOLCF. The old
regensbu
parents:
430
diff
changeset
|
37 |
rules |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
38 |
|
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
39 |
(*faking a type definition... *) |
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
40 |
(* -> is isomorphic to Cfun *) |
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
41 |
|
1479 | 42 |
Rep_Cfun "fapp fo : Cfun" |
43 |
Rep_Cfun_inverse "fabs (fapp fo) = fo" |
|
44 |
Abs_Cfun_inverse "f:Cfun ==> fapp(fabs f) = f" |
|
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
45 |
|
1168
74be52691d62
The curried version of HOLCF is now just called HOLCF. The old
regensbu
parents:
430
diff
changeset
|
46 |
defs |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
47 |
(*defining the abstract constants*) |
1479 | 48 |
less_cfun_def "less_cfun fo1 fo2 == ( fapp fo1 << fapp fo2 )" |
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
49 |
|
1274 | 50 |
(* start 8bit 1 *) |
51 |
(* end 8bit 1 *) |
|
52 |
||
53 |
||
243
c22b85994e17
Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF
nipkow
parents:
diff
changeset
|
54 |
end |
1274 | 55 |
|
56 |
(* start 8bit 2 *) |
|
57 |
(* end 8bit 2 *) |