Proof-producing reflection for HOL with an application to model polymorphism Benja Fallenstein1 and Ramana Kumar2 1 2

First Page		Document Content
Date: 2016-04-20 00:08:12 Mathematical logic Metalogic Logic Model theory Type theory Proof assistants Proof theory Higher-order logic Theoretical computer science Isabelle Simply typed lambda calculus Gdel's incompleteness theorems		Proof-producing reflection for HOL with an application to model polymorphism Benja Fallenstein1 and Ramana Kumar2 1 2 Add to Reading List Source URL: cakeml.org Download Document from Source Website File Size: 312,33 KB Share Document on Facebook

	PML : A new proof assistant and deduction system Christophe Raffalli LAMA DocID: 1rnYn - View Document
	Fuzzing the Rust Typechecker Using CLP Kyle Dewey Jared Roesch Ben Hardekopf DocID: 1rgc6 - View Document
	An Introduction to Logical Relations Proving Program Properties Using Logical Relations Lau Skorstengaard Contents DocID: 1rabj - View Document
	Final test: Type Theory and Coqjanuary 2011, 10:30–12:30, HG00.308 The mark for this test is the total number of points divided by ten, where the first 10 points are free. 1. Give a term of the simply typed la DocID: 1ra6V - View Document
	Chapter 3 Simple Types We study simple types in this chapter, We first formalize a simply-typed programming language L0 and then establish its type soundness, setting some machinery for development in the following chap DocID: 1r0ej - View Document