Meta-Theory of Sequent-Style Calculi in Coq (1997)

Cached

Download Links

by A.A. Adams
Citations:1 - 1 self

Documents Related by Co-Citation

11 Higher-Order Abstract Syntax – J Despeyroux, A Felty, A Hirschowitz - 1995
4 de Bruijn. -Calculus Notation with Nameless Dummies, A Tool for Automatic Formula Manipulation – N G - 1972
6 Coq en Coq – B Barras - 1996
7 Primitive recursion for higher order abstract syntax – Joëlle Despeyroux, Frank Pfenning, Carsten Schürmann - 1996
10 Residual theory in -calculus: a complete Gallina development – G Huet - 1994
9 A Formalization of the Strong Normalisation Proof for System F – T Altenkirch - 1993
175 Logic Programming in the LF Logical Framework – Frank Pfenning - 1991
51 Five axioms of alpha-conversion – Andrew D. Gordon, Tom Melham - 1996
29 Checking Algorithms for Pure Type Systems – L.S. van Benthem Jutting, J. McKinna, R. Pollack - 1993
29 From semantics to rules: A machine assisted analysis – Catarina Coquand - 1999
72 Constructions: A Higher Order Proof System for Mechanizing Mathematics – T Coquand, G P Huet - 1985
90 Reasoning with higher-order abstract syntax in a logical framework – Raymond C. Mcdowell, Dale A. Miller - 2002
74 Natural Deduction – D Prawitz - 1965
109 Inductively defined types – Thierry Coquand, Christine Paulin - 1988
260 Programming in Martin Löf’s Type Theory: An Introduction – B Nordström, K Petersson, J M Smith - 1990
1115 The Lambda Calculus: Its Syntax and Semantics – H Barendregt - 1984
259 Investigations into logical deduction – G Gentzen - 1969
43 Pure type systems formalized – James Mckinna, Robert Pollack - 1993