Implementing F S0 in Isabelle: adding structure at the metalevel (1995)

by Seán Matthews
Venue:University of Cambridge Computer Laboratory
Citations:1 - 0 self

Documents Related by Co-Citation

2 Tassel – R Boulton, A Gordon, M Gordon, J Harrison, J Herbert, J Van - 1992
4 editors. Higher order logic theorem proving and its applications – J J Joyce, C-J H Seger - 1994
1 Melham (Eds – M J C Gordon, T F - 1993
1 Boute (Eds – V Stavridou, T F Melham, R T - 1992
10 Implementing FS0 in Isabelle: adding structure at the metalevel – S Matthews - 1996
3 Coding binding and substitution explicitly in isabelle – Christopher Owens - 1995
21 The Theory of LEGO – Randy Pollack - 1994
17 A mechanized theory of -calculus in HOL – T Melham - 1992
27 Substitution revisited – Allen Stoughton - 1988
12 Why we can’t have SML-style datatype declarations in HOL – E L Gunter - 1993
22 Higher-order abstract syntax with induction in Coq – Joelle Despeyroux, Andre Hirschowitz - 1994
6 A Mechanized Theory of the π-calculus in HOL – T F Melham - 1994
36 A Proof of the Church-Rosser Theorem and its Representation in a Logical Framework – Frank Pfenning - 1992
31 A mechanisation of name-carrying syntax up to alpha-conversion – Andrew D Gordon - 1994
995 Bigraphs and Mobile Processes – Ole Høgh Jensen, Robin Milner - 2003
112 Introduction to Combinators and λ-calculus – J R Hindley, J P Seldin - 1986
423 Introduction to Higher Order Categorical Logic – J Lambek, P Scott - 1986
1115 The Lambda Calculus: Its Syntax and Semantics – H Barendregt - 1984
164 Isabelle: A generic theorem prover, volume 828 – L C Paulson - 1994