isabelle: src/HOLCF/Tr1.thy@b472d703fa06 (annotated)

1479 21eb5e156d91 expanded tabs clasohm parents: 1274 diff changeset	1	(* Title: HOLCF/tr1.thy
243 c22b85994e17 Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF nipkow parents: diff changeset	2	ID: $Id$
1479 21eb5e156d91 expanded tabs clasohm parents: 1274 diff changeset	3	Author: Franz Regensburger
243 c22b85994e17 Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF nipkow parents: diff changeset	4	Copyright 1993 Technische Universitaet Muenchen
c22b85994e17 Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF nipkow parents: diff changeset	5
625 119391dd1d59 New version nipkow parents: 243 diff changeset	6	Introduce the domain of truth values tr = one ++ one
243 c22b85994e17 Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF nipkow parents: diff changeset	7
625 119391dd1d59 New version nipkow parents: 243 diff changeset	8	The type is axiomatized as the least solution of a domain equation.
119391dd1d59 New version nipkow parents: 243 diff changeset	9	The functor term that specifies the domain equation is:
243 c22b85994e17 Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF nipkow parents: diff changeset	10
625 119391dd1d59 New version nipkow parents: 243 diff changeset	11	FT = <++,K_{one},K_{one}>
243 c22b85994e17 Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF nipkow parents: diff changeset	12
625 119391dd1d59 New version nipkow parents: 243 diff changeset	13	For details see chapter 5 of:
119391dd1d59 New version nipkow parents: 243 diff changeset	14
119391dd1d59 New version nipkow parents: 243 diff changeset	15	[Franz Regensburger] HOLCF: Eine konservative Erweiterung von HOL um LCF,
119391dd1d59 New version nipkow parents: 243 diff changeset	16	Dissertation, Technische Universit"at M"unchen, 1994
243 c22b85994e17 Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF nipkow parents: diff changeset	17
c22b85994e17 Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF nipkow parents: diff changeset	18	*)
c22b85994e17 Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF nipkow parents: diff changeset	19
c22b85994e17 Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF nipkow parents: diff changeset	20	Tr1 = One +
c22b85994e17 Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF nipkow parents: diff changeset	21
c22b85994e17 Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF nipkow parents: diff changeset	22	types tr 0
c22b85994e17 Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF nipkow parents: diff changeset	23	arities tr :: pcpo
c22b85994e17 Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF nipkow parents: diff changeset	24
c22b85994e17 Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF nipkow parents: diff changeset	25	consts
1479 21eb5e156d91 expanded tabs clasohm parents: 1274 diff changeset	26	abs_tr :: "one ++ one -> tr"
21eb5e156d91 expanded tabs clasohm parents: 1274 diff changeset	27	rep_tr :: "tr -> one ++ one"
21eb5e156d91 expanded tabs clasohm parents: 1274 diff changeset	28	TT :: "tr"
21eb5e156d91 expanded tabs clasohm parents: 1274 diff changeset	29	FF :: "tr"
21eb5e156d91 expanded tabs clasohm parents: 1274 diff changeset	30	tr_when :: "'c -> 'c -> tr -> 'c"
243 c22b85994e17 Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF nipkow parents: diff changeset	31
c22b85994e17 Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF nipkow parents: diff changeset	32	rules
c22b85994e17 Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF nipkow parents: diff changeset	33
1479 21eb5e156d91 expanded tabs clasohm parents: 1274 diff changeset	34	abs_tr_iso "abs_tr`(rep_tr`u) = u"
21eb5e156d91 expanded tabs clasohm parents: 1274 diff changeset	35	rep_tr_iso "rep_tr`(abs_tr`x) = x"
243 c22b85994e17 Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF nipkow parents: diff changeset	36
1168 74be52691d62 The curried version of HOLCF is now just called HOLCF. The old regensbu parents: 625 diff changeset	37	defs
243 c22b85994e17 Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF nipkow parents: diff changeset	38
1479 21eb5e156d91 expanded tabs clasohm parents: 1274 diff changeset	39	TT_def "TT == abs_tr`(sinl`one)"
21eb5e156d91 expanded tabs clasohm parents: 1274 diff changeset	40	FF_def "FF == abs_tr`(sinr`one)"
243 c22b85994e17 Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF nipkow parents: diff changeset	41
1168 74be52691d62 The curried version of HOLCF is now just called HOLCF. The old regensbu parents: 625 diff changeset	42	tr_when_def "tr_when ==
1479 21eb5e156d91 expanded tabs clasohm parents: 1274 diff changeset	43	(LAM e1 e2 t. sswhen`(LAM x.e1)`(LAM y.e2)`(rep_tr`t))"
1274 ea0668a1c0ba added 8bit pragmas regensbu parents: 1168 diff changeset	44
1168 74be52691d62 The curried version of HOLCF is now just called HOLCF. The old regensbu parents: 625 diff changeset	45	end

author	wenzelm
	Thu, 06 Feb 1997 18:22:21 +0100
changeset 2588	b472d703fa06
parent 2394	91d8abf108be
permissions	-rw-r--r--