Analyzing individual proofs as the basis of interoperability between proof systems Gilles Dowek? Abstract. We describe the first results of a project to analyze in which theories formal proofs can be expressed and use th

First Page		Document Content
Date: 2017-09-19 19:50:55 Mathematical logic Theoretical computer science Mathematics Type theory Logic in computer science Dependently typed programming Formal methods Logical framework Proof theory First-order logic Lambda calculus Calculus of constructions		Analyzing individual proofs as the basis of interoperability between proof systems Gilles Dowek? Abstract. We describe the first results of a project to analyze in which theories formal proofs can be expressed and use th Add to Reading List Source URL: pxtp.github.io Download Document from Source Website File Size: 257,58 KB Share Document on Facebook

	Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of view DocID: 1xVR3 - View Document
	Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗ DocID: 1xUAX - View Document
	Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcs DocID: 1xUr4 - View Document
	Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingen DocID: 1xTuz - View Document
	CS 153 Current Topics in Theoretical Computer Science Spring 2016 DocID: 1vryF - View Document