(Enter summary)
Abstract: Proof search has been used to specify a wide range of computation systems. (Update)
Cited by: More
Nominal Logic Programming - Cheney (2004)
(Correct)
A Proof Search Specification of the π-Calculus - Tiu, Miller (2004)
(Correct)
Active bibliography (related documents): More All
1.1: A Logical Framework For Reasoning About Logical Specifications - Tiu (2004)
(Correct)
0.7: A Proof Theory for Generic Judgments: An Extended - Miller, Tiu (2003)
(Correct)
0.5: Appendix 1: Product Types in F ! - In This Section
(Correct)
Similar documents based on text: More All
0.3: A Proof Theory for Generic Judgments - Miller, Tiu (2003)
(Correct)
0.2: Higher-Order Pattern Complement and the Strict ...-Calculus - Momigliano, Pfenning
(Correct)
0.2: From Set-theoretic Coinduction to Coalgebraic Coinduction: some.. - Lenisa (1999)
(Correct)
Related documents from co-citation: More All
3: System description: Twelf --- a meta-logical framework for deductive systems
- Pfenning, Schurmann - 1999
3: Abstract syntax for variable binders: An overview (context) - Miller
3: A Logical Framework for Reasoning about Logical Specifications
- Tiu
BibTeX entry: (Update)
A. Momigliano and A. Tiu. Induction and co-induction in sequent calculus. In Post-proceedings of TYPES 2003 Workshop, pages 293 -- 308. Springer-Verlag LNCS, Vol.3085, 2003. http://citeseer.ist.psu.edu/momigliano03induction.html More
@misc{ momigliano03induction,
author = "A. Momigliano and A. Tiu",
title = "Induction and co-induction in sequent calculus",
text = "A. Momigliano and A. Tiu. Induction and co-induction in sequent calculus.
In Post-proceedings of TYPES 2003 Workshop, pages 293 -- 308. Springer-Verlag
LNCS, Vol.3085, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/momigliano03induction.html" }
Citations (may not include all citations):
434
A framework for defining logics
- Harper, Honsell et al. - 1993
97
An introduction to inductive definitions (context) - Aczel - 1977
47
Logical frameworks
- Pfenning - 2001
41
Inductive and coinductive types with iteration and recursion
- Geuvers - 1992
31
Inductive types and type constraints in the second order lam.. (context) - Mendler - 1991
25
Mechanizing coinduction and corecursion in higher-order logi..
- Paulson - 1997
20
Automating the Meta-Theory of Deductive Systems
- urmann - 2000
20
Compositionality via cut-elimination: Hennessy-Milner logic ..
- Simpson - 1995
19
Reasoning with higher-order abstract syntax in a logical fra.. (context) - McDowell, Miller - 2002
19
Inductive definitions in the system Coq: Rules and propertie.. (context) - Paulin-Mohring - 1993
17
An axiomatic approach to metareasoning on systems in higher-.. (context) - Honsell, Miculan et al. - 2076
17
A proof theory for generic judgments: An extended abstract (context) - Miller, Tiu - 2003
16
Encoding transition systems in sequent calculus
- McDowell, Miller et al. - 2003
15
Higher-order abstract syntax with induction in Coq (context) - Despeyroux, Hirschowitz - 1994
15
Cut-elimination for a logic with definitions and induction
- McDowell, Miller - 2000
10
A fixpoint theorem in linear logic (context) - Girard - 1992
8
Combining higher order abstract syntax with tactical theorem.. (context) - Ambler, Crole et al. - 2002
7
Multi-level meta-reasoning with higher order abstract syntax (context) - Momigliano, Ambler - 2003
7
A calculus of circular proofs and its categorical semantics
- Santocanale - 2002
6
Rules of definitional reflection (context) - Schroeder-Heister - 1993
6
Mode and termination analysis for higher-order logic program.. (context) - Rohwedder, Pfenning - 1996
4
Automatic synthesis of typed lambda programs on term algebra.. (context) - Bohm, Berarducci - 1985
3
the structure of inductive reasoning: Circular and tree-shap.. (context) - Spenger, Dams - 2003
2
Hauptsatz for the intuitionistic theory of iterated inductiv.. (context) - of - 1971
2
Cut-elimination in logics with definitional reflection (context) - Schroeder-Heister - 1992
1
Cut-elimination for a logic with induction and co-induction (context) - Tiu - 2003
1
Induction and [Co]Algebras (context) - Crole, Co - 1998
1
Definitional reflection and the completion (context) - Schroeder-Heister - 1993
1
A predicative strong normalisation proof for a l-calculus wi.. (context) - Abel, Altenkirch - 1956
1
Un Calcul de Constructions Infinies et son Application a la .. (context) - enez - 1996
Documents on the same site (http://homepages.inf.ed.ac.uk/amomigl1/): More
Towards Certificate Generation for Linear Heap.. - Beringer, Hofmann..
(Correct)
A Program Logic for Resource Verification - Aspinall, Beringer, Hofmann.. (2004)
(Correct)
Constructive Specifications for Compositional Units - Kung-Kiu Lau Alberto
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC