author | paulson |
Mon, 23 Sep 1996 17:42:56 +0200 | |
changeset 2003 | b48f066d52dc |
parent 1478 | 2b8c2a7547ab |
child 2469 | b50b8c0eec01 |
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