A Proof Theory for Generic Judgments

A Proof Theory for Generic Judgments (2003)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Dale Miller , Alwen Tiu

Citations:

46 - 11 self

BibTeX

@MISC{Miller03aproof,
    author = {Dale Miller and Alwen Tiu},
    title = {A Proof Theory for Generic Judgments},
    year = {2003}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

this paper, we do this by adding the #-quantifier: its role will be to declare variables to be new and of local scope. The syntax of the formula # x.B is like that for the universal and existential quantifiers. Following Church's Simple Theory of Types [Church 1940], formulas are given the type o, and for all types # not containing o, # is a constant of type (# o) o. The expression # #x.B is ACM Transactions on Computational Logic, Vol. V, No. N, October 2003. 4 usually abbreviated as simply # x.B or as if the type information is either simple to infer or not important

Citations

933	A calculus of mobile processes - Milner, Parrow, et al. - 1992
728	A formulation of the simple theory of types - Church - 1940
386	Isabelle: A generic theorem prover - Paulson - 1994
271	A logic programming language with lambda-abstraction, function variables, and simple unification - Miller - 1991
269	Higher-order abstract syntax - Pfenning, Elliott - 1988
209	Investigations into logical deduction - Gentzen - 1969
203	A Linear Logical Framework - CERVESATO, PFENNING - 2002
174	A new approach to abstract syntax with variable binding. Formal Aspects of Computing 13 - GABBAY, PITTS - 2001
142	Nominal logic, a first order theory of names and binding - PITTS
134	A.: A metanotation for protocol analysis - Cervesato, Durgin, et al. - 1999
109	Unification under a mixed prefix - Miller - 1992
99	The #-calculus as a theory in linear logic: Preliminary results - Miller - 1993
97	A unification algorithm for typed λ-calculus - Huet - 1975
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
62	Specifying theorem provers in a higher-order logic programming language - Felty, Miller - 1988
62	Lexical scoping as universal quantification - Miller - 1989
61	A proof-theoretic approach to logic programming. II. Programs as definitions - Hallnäs, Schroeder-Heister - 1991
57	Functional unification of higher-order patterns - Nipkow - 1993
56	Cut-elimination for a logic with definitions and induction - McDowell, Miller
39	Proof Theoretic Approach To Specification Languages - Chirimar - 1995
38	A proof theory for generic judgments: An extended abstract - Miller, Tiu
36	A fixpoint theorem in linear logic, an email posting to the mailing list linear@cs.stanford.edu - Girard - 1992
32	Implementing the meta-theory of deductive systems - Pfenning, Rohwedder - 1992
29	A logical framework for reasoning about logical specifications - Tiu - 2004
28	Encoding transition systems in sequent calculus - McDowell, Miller, et al. - 2003
23	A finitary version of the calculus of partial inductive definitions - Eriksson - 1991
22	Abstract syntax for variable binders: An overview, in - Miller - 2000
20	Forum: A multiple-conclusion specification language - Miller - 1996
20	Cut-elimination in logics with definitional reflection - Schroeder-Heister - 1992
19	A proof search specification of the π-calculus - Tiu, Miller - 2004
18	Induction and co-induction in sequent calculus - Momigliano, Tiu
10	Foundational aspects of syntax - Miller, Palamidessi - 1999
8	A Hybrid encoding of Howe’s method for establishing congruence of bisimilarity - Momigliano, Ambler, et al.
3	Encoding generic judgments - Miller, Tiu - 2002
2	Solution to a problem of Ono and Komori - Slaney - 1989
1	A proof theory for generic judgments · 33 - Gabbay, Cheney - 2004
1	Level 0/1 prover: A tutorial. Available via the web and from Tiu - Tiu