A Meta-Logical Framework Based on Realizability

A Meta-Logical Framework Based on Realizability (2000)

Cached

Download Links

[www.cs.cmu.edu]

by Carsten Schürmann

BibTeX

@MISC{Schürmann00ameta-logical,
    author = {Carsten Schürmann},
    title = {A Meta-Logical Framework Based on Realizability},
    year = {2000}
}

Bookmark

OpenURL

Abstract

this paper, we develop the type theory M

Citations

634	A framework for defining logics - Harper, Honsell, et al. - 1999
493	Untersuchungen über das logische Schließen - Gentzen - 1935
281	System description: Twelf - a meta-logical framework for deductive systems - Pfenning, Schürmann - 1999
278	Lambda-calculus notation with nameless dummies, a tool for automatic formula manipulation - Bruijn - 1972
172	Logic programming in the LF logical framework - Pfenning - 1991
117	Primitive recursion for higher-order abstract syntax - Schürmann, Despeyroux, et al. - 2001
103	An algorithm for testing conversion in type theory - Coquand - 1990
90	Semantical analysis of higher-order abstract syntax - Hofmann
84	Reasoning with higher-order abstract syntax in a logical framework - McDowell, Miller - 2002
78	Automating the meta theory of deductive systems - Schürmann - 2000
55	Structural cut elimination - Pfenning - 1995
33	An extension to ML to handle bound variables in data structures - Miller - 1990
33	A proof of the Church–Rosser theorem and its representation in a logical framework - Pfenning - 1992
33	Elf: A meta-language for deductive systems - Pfenning - 1995
32	Automated theorem proving in a simple meta-logic for LF, in - Schürmann, Pfenning - 1998
29	Mode and termination checking for higher-order logic programs - Rohwedder, Pfenning - 1996
27	A functional theory of local names - Odersky
7	Induction et Syntaxe Abstraite d’Ordre Supérieur dans les Théories Typées - Leleu - 1998
2	On the correspondence between proofs and -terms. Cahiers du centre de logique, Universite Catholique de Louvain - Gallier - 1993