Autarkic Computations in Formal Proofs (1997)

Cached

Download Links

by Henk Barendregt , Erik Barendsen
Venue:J. Autom. Reasoning
Citations:21 - 1 self

Documents Related by Co-Citation

75 Theorem Proving Modulo – Gilles Dowek, Thérèse Hardin, Claude Kirchner
724 M.: Isabelle/HOL - A Proof Assistant for HigherOrder Logic – T Nipkow, L C Paulson, Wenzel - 2002
70 A Compiled Implementation of Strong Reduction – Benjamin Grégoire, Inria Rocquencourt, Xavier Leroy
4 Coq’Art: The Calculus of Inductive Constructions, volume XXV of Text in theor. comp. science: an EATCS series – Y Bertot, P Castéran - 2004
262 Investigations into logical deduction – G Gentzen - 1969
1097 Proof-Carrying Code – George C. Necula - 1997
333 Logic Programming with Focusing Proofs in Linear Logic – Jean-marc Andreoli - 1992
35 Least and greatest fixed points in linear logic Extended Version – David Baelde, Dale Miller - 2007
374 Uniform proofs as a foundation for logic programming – Dale Miller, Gopalan Nadathur , Frank Pfenning , Andre Scedrov - 1991
43 Focusing and Polarization in Linear, Intuitionistic, and Classical Logics – Chuck Liang , Dale Miller - 2009
944 Term Rewriting and All That – Franz Baader, Tobias Nipkow - 1998
40 Logic and Computation – L Paulson - 1982
1125 The Lambda Calculus: Its Syntax and Semantics – H P Barendregt - 1981
96 Super-Exponential Complexity of Presburger Arithmetic – Michael Jo Fischer, Michael J. Fischer, Michael O. Rabin, Michael O. Rabin - 1974
53 Metatheory and Reflection in Theorem Proving: A Survey and Critique – John Harrison - 1995
11 Verifying and reflecting quantifier elimination for Presburger arithmetic – Amine Chaieb, Tobias Nipkow - 2005
23 Solution d’une question particulière du calcul des inegalités. Nouveau Bulletin des Sciences par la Scociété Philomatique de Paris – J Fourier
24 A proof-producing decision procedure for real arithmetic – Sean Mclaughlin, John Harrison - 2005
81 The complexity of linear problems in fields – Wei88 Volker Weispfenning - 1988