
This directory contains the PVS formalisation of Chapter 3 of my 
PhD thesis "Coalgebraic Methods for Object-Oriented Specification".

The thesis is available at 
http://wwwtcs.inf.tu-dresden.de/~tews/PhD/

Documentation for this directory is in ../index.html. You can view this 
file online at http://wwwtcs.inf.tu-dresden.de/~tews/PhD/.

To typecheck start pvs and type ``M-x load-file typecheck.el''.
To prove everything load file all.pvs and invoke prove-importchain.
Be patient, typechecking and proving takes about 5 minutes on 
my 1GHz Athlon. 

There is considerable overlap between the material in this directory 
and the material described at http://wwwtcs.inf.tu-dresden.de/~tews/binary/.


Filelist

K2.pvs : 		K2(Y,X) = (A => Y) => X. 
K3.pvs : 		K3(Y,X) = (A => Y) => bool
aczel.pvs :		equivalence of bisimulations
aczel_counter.pvs :	counterexample for bisimulations
aczel_counter2.pvs :	version 2 
aczel_counter3.pvs :	version 3
base.pvs : 		bicartesian closed structure
cart.pvs :		some cardinality definitions
def.pvs :		specification with with binary method and final 
			model, the binary method cannot be defined as 
			extension
exp.pvs :		non fibred predicate lifting for HOF
f.pvs :			F(X) = (X => X), originally developed for the
			Aczel/Mendler proofs, now F is used in inv-union
fibprops.pvs : 		properties of predicate and relation fibration
fibrations.pvs :	predicate and relation fibration
finitely.pvs :		finitely based coalgebras
g.pvs :			G(X) = (X => A) => A 
graph.pvs :		counterexemple: a morphism which is not a 
			bisimulation
image_morph.pvs :	image of a morphism is an invariant
			counterexample for HOF
intersection.pvs :	counterexample for intersection of 
			bisimulations/invariants
inv-char.pvs :		invariant characterization following Rutten,
			counterexample for HOF
inv-union.pvs : 	Example: union of invariants, greatest invariants
			based on F from f.pvs
invariant.pvs :		projection of bisimulation and
			intersection of invariant and bisimulation
kernel.pvs :		counterexample for kernel
mendler_counter.pvs :	counterexample for invariants
nat.pvs :		a simple lemma about even and odd
per.pvs :		partial equivalence relations and results
per_extended.pvs : 	main induction for the closure of per's
perlift_counter.pvs :	counterexample for a technical lemma of per.pvs
			extension to a counterexample of the union of two 
			per bisimulations

pol_aczel.pvs :		isomorphism of T(R) and Rel(T)(R) for polynomials
power.pvs :		covariant powerset functor
relcomp.pvs :		counterexample for composition of relations
rellist.pvs :		functor List
t.pvs :			T(Y,X) = (X => Y) => X 
union.pvs :		K(Y,X) = Y => A, 
			counterexample for union of bisimulations,
			no final coalgebra

index.html :		
table.html :	
detailed.html :		

pvs-batch.el :		load everything
all.pvs :		include all



-----------------------------------------------------------------
Hendrik Tews     Department of Theoretical Computer Science
                 Dresden University of Technology, Germany

Telefon:   	 +49 351 4633 8351
e-mail:    	 tews@tcs.inf.tu-dresden.de
www:       	 http://home.pages.de/~tews/
pgp key:         http://home.pages.de/~tews/pgpkey.asc
-----------------------------------------------------------------
