Final year project Bertus: Implementing Observational Equality

First Page		Document Content
Date: 2013-09-05 05:05:27 Type theory Logic in computer science Dependently typed programming Lambda calculus Mathematical constructivism Intuitionistic type theory Proof assistant Dependent type Coq Mathematics Logic Theoretical computer science		Final year project Bertus: Implementing Observational Equality Add to Reading List Source URL: www.doc.ic.ac.uk Download Document from Source Website File Size: 1,01 MB Share Document on Facebook

	Proof Assistants and the Dynamic Nature of Formal Theories Robert L. Constable Cornell University Abstract DocID: 1qLDo - View Document
	A sufficient condition for the continuity of permanental processes with applications to local times of Markov processes DocID: 1qnAE - View Document
	ZDM Mathematics Education:295–306 DOIs11858ORIGINAL ARTICLE Bringing forth mathematical concepts: signifying sensorimotor DocID: 1ouI7 - View Document
	Emanuele Frittaion Curriculum Vitae 2016 DocID: 1okGN - View Document
	Effective Uniform Bounds from Proofs in Abstract Functional Analysis Ulrich Kohlenbach Department of Mathematics Darmstadt University of Technology Schlossgartenstraße 7 DocID: 1oiUp - View Document