author | lcp |
Thu, 06 Apr 1995 12:08:43 +0200 | |
changeset 1014 | 8bec0698d58c |
parent 753 | ec86863e87c8 |
child 1401 | 0c439768f45c |
permissions | -rw-r--r-- |
0 | 1 |
(* Title: ZF/univ.thy |
2 |
ID: $Id$ |
|
3 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
|
4 |
Copyright 1993 University of Cambridge |
|
5 |
||
6 |
A small universe for lazy recursive types |
|
7 |
*) |
|
8 |
||
124 | 9 |
QUniv = Univ + QPair + "mono" + "equalities" + |
0 | 10 |
consts |
11 |
quniv :: "i=>i" |
|
12 |
||
753 | 13 |
defs |
0 | 14 |
quniv_def "quniv(A) == Pow(univ(eclose(A)))" |
15 |
||
16 |
end |