Coinductive big-step operational semantics Xavier Leroy a,∗ Herv´e Grall b a INRIA Paris-Rocquencourt Domaine de Voluceau, B.P. 105, 78153 Le Chesnay, France

First Page		Document Content
Date: 2007-12-16 08:06:13 Logical syntax Theoretical computer science Logic in computer science Proof theory Coinduction Rule of inference Theorem Formal proof Structural induction Logic Mathematics Mathematical logic		Coinductive big-step operational semantics Xavier Leroy a,∗ Herv´e Grall b a INRIA Paris-Rocquencourt Domaine de Voluceau, B.P. 105, 78153 Le Chesnay, France Add to Reading List Source URL: pauillac.inria.fr Download Document from Source Website File Size: 266,04 KB Share Document on Facebook

	Making Automatic Theorem Provers more Versatile Simon Cruanes Veridis, Inria Nancy https://cedeela.fr/~simon/ August 2017 DocID: 1xVS8 - View Document
	Theorem-Proving by Resolution as a Basis for Question-Answering Systems Cordell Green Stanford Research Institute Menlo Park, California DocID: 1xVHV - View Document
	A proof of Minkowski’s second theorem Matthew Tointon Minkowski’s second theorem is a fundamental result from the geometry of numbers with important applications in additive combinatorics (see, for example, its appli DocID: 1xVE5 - View Document
	Theorem Proving using Lazy Proof Expli ation Corma Flanagan1 , Rajeev Joshi1 , Xinming Ou2 , and James B. Saxe1 1 Systems Resear h Center, HP Labs, Palo Alto, CA 2 DocID: 1xVDI - View Document
	A BOUNDEDNESS THEOREM FOR NEARBY SLOPES OF HOLONOMIC D-MODULES by Jean-Baptiste Teyssier Abstract. — Using twisted nearby cycles, we define a new notion of slopes for complex holonomic D-modules. We prove a boundednes DocID: 1xVAt - View Document