| author | wenzelm |
| Wed, 17 Mar 1999 13:39:44 +0100 | |
| changeset 6374 | a67e4729efb2 |
| parent 124 | 858ab9a9b047 |
| 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