author | wenzelm |
Mon, 13 Mar 2000 13:21:39 +0100 | |
changeset 8434 | 5e4bba59bfaa |
parent 7878 | 43b03d412b82 |
child 8703 | 816d8f6513be |
permissions | -rw-r--r-- |
4776 | 1 |
(* Title: HOL/UNITY/LessThan |
2 |
ID: $Id$ |
|
3 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
|
4 |
Copyright 1998 University of Cambridge |
|
5 |
||
6 |
lessThan, greaterThan, atLeast, atMost |
|
5536 | 7 |
|
8 |
Could generalize to any linear ordering? |
|
4776 | 9 |
*) |
10 |
||
5232 | 11 |
LessThan = Main + |
4776 | 12 |
|
13 |
constdefs |
|
14 |
||
7878
43b03d412b82
working version with localTo[C] instead of localTo
paulson
parents:
5536
diff
changeset
|
15 |
(*MOVE TO RELATION.THY??*) |
43b03d412b82
working version with localTo[C] instead of localTo
paulson
parents:
5536
diff
changeset
|
16 |
Restrict :: "[ 'a set, ('a*'b) set] => ('a*'b) set" |
43b03d412b82
working version with localTo[C] instead of localTo
paulson
parents:
5536
diff
changeset
|
17 |
"Restrict A r == r Int (A Times UNIV)" |
43b03d412b82
working version with localTo[C] instead of localTo
paulson
parents:
5536
diff
changeset
|
18 |
|
4776 | 19 |
lessThan :: "nat => nat set" |
20 |
"lessThan n == {i. i<n}" |
|
21 |
||
22 |
atMost :: "nat => nat set" |
|
23 |
"atMost n == {i. i<=n}" |
|
24 |
||
25 |
greaterThan :: "nat => nat set" |
|
26 |
"greaterThan n == {i. n<i}" |
|
27 |
||
28 |
atLeast :: "nat => nat set" |
|
29 |
"atLeast n == {i. n<=i}" |
|
30 |
||
31 |
end |