A two-level logic approach to reasoning about computations

A two-level logic approach to reasoning about computations

Cached

Download Links

by Andrew Gacek , Dale Miller , Gopalan Nadathur

Citations:

BibTeX

@MISC{Gacek_atwo-level,
    author = {Andrew Gacek and Dale Miller and Gopalan Nadathur},
    title = {A two-level logic approach to reasoning about computations},
    year = {}
}

Bookmark

OpenURL

Abstract

Citations

1182	A structural approach to operational semantics - Plotkin - 1981
728	A formulation of the simple theory of types - Church - 1940
634	A framework for defining logics - Harper, Honsell, et al. - 1999
585	Isabelle/HOL: A Proof Assistant for Higher-Order Logic - Nipkow, Paulson, et al. - 2002
340	Interactive theorem proving and program development. Coq’Art: The calculus of inductive constructions - Bertot, Castéran - 2004
334	Uniform proofs as a foundation for logic programming - Miller, Nadathur, et al. - 1991
299	The mechanical evaluation of expressions - Landin - 1964
290	Functions as processes - Milner - 1992
281	System description: Twelf - a meta-logical framework for deductive systems - Pfenning, Schürmann - 1999
280	Natural semantics - Kahn - 1988
174	Call-by-name, call-by-value and the λ-calculus - Plotkin - 1976
142	Nominal logic, a first order theory of names and binding - PITTS
110	Mechanized metatheory for the masses: the POPLMark Challenge - Aydemir, Bohannon, et al. - 2005
109	Unification under a mixed prefix - Miller - 1992
99	Inductively defined types - Coquand, Paulin - 1988
84	Reasoning with higher-order abstract syntax in a logical framework - McDowell, Miller - 2002
84	An Overview of λProlog - Nadathur, Miller - 1988
78	Automating the meta theory of deductive systems - Schürmann - 2000
62	S.: Engineering formal metatheory - Aydemir, Charguéraud, et al. - 2008
56	Cut-elimination for a logic with definitions and induction - McDowell, Miller
50	The lazy lambda calculus in a concurrency scenario - Sangiorgi - 1994
46	A proof theory for generic judgments - Miller, Tiu - 2005
40	A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions - Pientka - 2008
37	Higher-order abstract syntax in Coq - Despeyroux, Felty, et al. - 1995
30	Definitional interpreters for higher order programming languages - Reynolds - 1972
29	A logical framework for reasoning about logical specifications - Tiu - 2004
23	LCF as a programming language - Plotkin - 1977
22	Abstract syntax for variable binders: An overview, in - Miller - 2000
20	Focusing on binding and computation - Licata, Zeilberger, et al. - 2008
17	The Abella interactive theorem prover (system description), in - Gacek
16	A linear approach to the proof-theory of least and greatest fixed points - Baelde - 2008
16	System description: Teyjus — a compiler and abstract machine based implementation of lambda prolog - NADATHUR, MITCHELL - 1999
12	Gopalan Nadathur, and Alwen Tiu. The Bedwyr system for model checking over syntactic expressions - Baelde, Gacek, et al. - 2007
11	Hybrid: A definitional two-level approach to reasoning with higher-order abstract syntax - Felty, Momigliano
6	System description: Delphin - A functional programming language for deductive systems - Poswolsky, Schürmann - 2009
6	Modal logic and self-reference - Smorynski - 2004
3	Reasoning with Hypothetical Judgments and Open Terms in Hybrid - Felty, Momigliano - 2009
3	A Framework for Specifying, Prototyping, and Reasoning about Computational Systems - GACEK - 2009
2	Gopalan Nadathur. Nominal abstraction - Gacek, Miller
2	Induction and co-induction in sequent calculus, available from http://arxiv.org/abs/0812.4727 - Tiu, Momigliano - 2009
1	The Abella system and homepage - Gacek
1	The Teyjus system – version 2 - Gacek, Holte, et al. - 2008
1	Extended version of paper in LICS 2008 - 1390
1	Extended version of paper - 1390