Cut-elimination for a logic with definitions and induction (1997)

by Raymond Mcdowell , Dale Miller
Venue:Theoretical Computer Science
Citations:61 - 19 self

Documents Related by Co-Citation

854 A formulation of the simple theory of types – Alonzo Church - 1940
57 Rules of definitional reflection – Peter Schroeder-heister, Universität Tübingen - 1993
90 Reasoning with higher-order abstract syntax in a logical framework – Raymond C. Mcdowell, Dale A. Miller - 2002
262 Investigations into logical deduction – G Gentzen - 1969
40 A fixpoint theorem in linear logic. An email posting to the mailing list linear@cs.stanford.edu – J-Y Girard - 1992
291 A logic programming language with lambda-abstraction, function variables, and simple unification – Dale Miller - 1990
33 A Logical Framework For Reasoning About Logical Specifications – Alwen F. Tiu, Padma Raghavan, Stephen Simpson, Frank Pfenning, Raj Acharya - 2004
696 A Framework for Defining Logics – Robert Harper , Furio Honsell, Gordon Plotkin - 1993
28 A Finitary Version of the Calculus of Partial Inductive Definitions – Lars-henrik Eriksson - 1992
374 Uniform proofs as a foundation for logic programming – Dale Miller, Gopalan Nadathur , Frank Pfenning , Andre Scedrov - 1991
124 Unification under a mixed prefix – Dale Miller - 1992
302 Higher-order abstract syntax – F Pfenning, C Elliott - 1988
217 A Linear Logical Framework – Iliano Cervesato, Frank Pfenning - 1996
81 Automating the Meta Theory of Deductive Systems – Carsten Schurmann, Dana Scott - 2000
1000 Bigraphs and Mobile Processes – Ole Høgh Jensen, Robin Milner - 2003
41 A proof theory for generic judgments: An extended abstract – Dale Miller, Alwen Tiu - 2003
207 A new approach to abstract syntax with variable binding – Murdoch J. Gabbay, Andrew M. Pitts - 2002
68 A proof-theoretic approach to logic programming. II. Programs as definitions – L Hallnäs, P Schroeder-Heister - 1991
61 Functional unification of higher-order patterns – T Nipkow - 1993