author | lcp |
Tue, 29 Nov 1994 00:31:31 +0100 | |
changeset 753 | ec86863e87c8 |
parent 124 | 858ab9a9b047 |
child 1401 | 0c439768f45c |
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" defs quniv_def "quniv(A) == Pow(univ(eclose(A)))" end