author | clasohm |
Tue, 16 Nov 1993 14:24:21 +0100 | |
changeset 124 | 858ab9a9b047 |
parent 0 | a5a9c433f639 |
child 753 | ec86863e87c8 |
permissions | -rw-r--r-- |
(* Title: ZF/univ.thy ID: $Id$ Author: Lawrence C Paulson, Cambridge University Computer Laboratory Copyright 1993 University of Cambridge A small universe for lazy recursive types *) QUniv = Univ + QPair + "mono" + "equalities" + consts quniv :: "i=>i" rules quniv_def "quniv(A) == Pow(univ(eclose(A)))" end