Scalable Fine-Grained Proofs for Formula Processing Haniel Barbosa1,2(B) , Jasmin Christian Blanchette3,1,4 , and Pascal Fontaine1 1 Université de Lorraine, CNRS, Inria, LORIA, Nancy, France

First Page		Document Content
Date: 2017-09-19 19:50:55 Mathematical logic Logic Mathematics Predicate logic Computability theory Models of computation First-order logic Lambda calculus Term Quantifier Natural deduction CurryHoward correspondence		Scalable Fine-Grained Proofs for Formula Processing Haniel Barbosa1,2(B) , Jasmin Christian Blanchette3,1,4 , and Pascal Fontaine1 1 Université de Lorraine, CNRS, Inria, LORIA, Nancy, France Add to Reading List Source URL: pxtp.github.io Download Document from Source Website File Size: 175,64 KB Share Document on Facebook

	Speaker: Jason Rute Title: Randomness, Brownian Motion, Riesz Capacity, and Complexity Abstract: Algorithmic randomness is a topic in computability theory which investigates which paths in a stochastic process behave ran DocID: 1sWjT - View Document
	In pursuit of decidable ‘logical form’ Michael Minock TCS/CSC KTH Royal Institute of Technology, Stockholm, Sweden Abstract DocID: 1rsvH - View Document
	Curriculum and Course Syllabi for a High-School Program in Computer Science1 Judith Gal-Ezer2 David Harel3 DocID: 1rozw - View Document
	A brief introduction to Higher Order Logic and the HOL proof assistant Monica Nesi DocID: 1rjEK - View Document
	Steve Warner Curriculum Vitae Department of Mathematics Hofstra University Hempstead, NY 11549 DocID: 1rjw8 - View Document