Five axioms of alpha-conversion (1996)

by Andrew D. Gordon , Tom Melham
Venue:Ninth international Conference on Theorem Proving in Higher Order Logics TPHOL
Citations:51 - 0 self

Active Bibliography

3 Coding binding and substitution explicitly in isabelle – Christopher Owens - 1995
8 A Full Formalisation of π-Calculus Theory in the Calculus of Constructions – Daniel Hirschkoff - 1997
2 A First-Order Syntax for the pi-Calculus in Isabelle/HOL using Permutations – Christine Röckl
A Formalised First-Order . . . – René Vestergaard, James Brotherston - 2002
Editorial Manager(tm) for Journal of Automated Reasoning Manuscript Draft Manuscript Number: Title: A Canonical Locally Named Representation of Binding Article Type: Special Issue TAASN – unknown authors
3 A Canonical Locally Named Representation of Binding – Randy Pollack , Masahiko Sato
2 The Representational Adequacy of HYBRID – R. L. Crole
217 A Linear Logical Framework – Iliano Cervesato, Frank Pfenning - 1996
2 External and internal syntax of the λ-calculus – Masahiko Sato, Randy Pollack
1 Comparing Higher-Order Encodings in Logical Frameworks and Tile Logic – Roberto Bruni, Furio Honsell, Marina Lenisa, Marino Miculan - 2001
3 Foundations of Functional Programming – Lawrence C. Paulson - 2000
120 Confluence properties of Weak and Strong Calculi of Explicit Substitutions – Pierre-Louis Curien , Therese Hardin, Jean-Jacques Levy - 1996
2 Categorical and Graphical Models of Programming Languages – Ralf Schweimeier - 2001
2 A Reversible SE(M)CD Machine – Werner Kluge
12 Combining de Bruijn indices and higher-order abstract syntax in Coq – Venanzio Capretta, Amy P. Felty - 2006
Author manuscript, published in "Second international conference on Certified Programs and Proofs (2012)" Proof Pearl: Abella Formalization of λ-Calculus Cube Property – Beniamino Accattoli - 2013
Abstract VeriML: A dependently-typed, user-extensible and language-centric approach to proof assistants – Antonios Michael Stampoulis - 2013
81 Automating the Meta Theory of Deductive Systems – Carsten Schurmann, Dana Scott - 2000
26 How to Believe a Machine-Checked Proof – Robert Pollack - 1997