Dyckhoff, Roy - School of Computer Science, University of St Andrews

• A Sequent Calculus for Type Theory Stphane Lengrand1,2
• Implementation of a loopfree method for construction of countermodels for intuitionistic propositional logic
• Comparing WCET and Resource Demands of Trigonometric Functions Implemented as Iterative Calculations vs. Table-Lookup
• Dragalin's proofs of cutadmissibility for the intuitionistic sequent calculi G3i and G3i 0
• Section 1: Proof Theory Contractionfree sequent calculi for GdelDummett logic
• Two Loop Detection Mechanisms: a Comparison Jacob M. Howe
• Strong cut-elimination systems for Hudelmaier's depth-bounded sequent calculus
• Herbelin presented (at CSL'94) a simple sequent calculus for minimal implicational logic, extensible to full rst-order intuitionistic logic, with a complete system of cut-reduction rules
• Theorem Proving and Partial Proof Search for Intuitionistic Propositional Logic Using a
• Dragalin's proofs of cut-admissibility for the intuitionistic sequent calculi G3i and G3i0
• SEQUEL Frameworks for the MetaTheory of Sequent Calculus and Natural Deduction Systems
• Metatheory in the HigherOrder Logic Framework Isabelle
• Cut-elimination and a permutation-free sequent calculus for intuitionistic Roy Dyckhoff$ & Luis Pinto
• CATEGORY THEORY as an extension of
• J. Functional Programming 11 (4): 433436, July 2001. Printed in the United Kingdom c 2001 Cambridge University Press
• Proof search in constructive logics \Lambda Roy Dyckhoff
• This thesis is a prooftheoretic investigation of logic programming based on hereditary Harrop logic (as in Prolog). After studying various proof systems for the firstorder hereditary Harrop
• Strong normalisation of Herbelin's explicit substitution calculus with substitution propagation
• Revised with minor corrections on September 17, 1996 A permutationfree sequent calculus for intuitionistic logic.
• Admissibility of Structural Rules for Extensions of Contraction-free
• Loopfree construction of countermodels for intuitionistic propositional logic
• Implementation of a loop-free method for construction of counter-models for intuitionistic propositional logic
• Uniform proofs and natural deductions Roy Dyckhoff & Luis Pinto
• A deterministic terminating sequent calculus for propositional Dummett logic
• A Permutationfree Calculus for Lax Logic Jacob M. Howe
• Permutability of proofs in intuitionistic sequent Roy Dyckhoff \Lambda
• Permutability of proofs in intuitionistic sequent calculi
• A Constructive Type System to Integrate Logic and Functional Programming
• Electronic Notes in Theoretical Computer Science 17 (1998) URL: http://www.elsevier.nl/locate/entcs/volume17.html 14 pages
• Cut Formulae and Logic Programming Luis Pinto ?
• Towards Formally Verifiable Resource Bounds for Real-Time Embedded Systems
• Admissibility of Structural Rules for Extensions of Contraction-free
• Admissibility of structural rules for contraction-free systems of intuitionistic logic
• Permutability of proofs in intuitionistic sequent calculi Permutability of proofs in intuitionistic sequent calculi.
• Implementation of a cut-free sequent calculus for logics with adjoint modalities
• Admissibility of structural rules for contraction-free systems of intuitionistic logic
• A Deterministic Terminating Sequent Calculus for
• A Deterministic Terminating Sequent Calculus for
• Herbelin presented (at CSL'94) a simple sequent calculus for minimal implicatio* *nal logic,
• Book Review 6941, for Bulletin of the LMS Roy Dyckhoff