2009 |
22 | EE | Mehrnoosh Sadrzadeh,
Roy Dyckhoff:
Positive Logic with Adjoint Modalities: Proof Theory, Semantics and Reasoning about Information
CoRR abs/0903.2448: (2009) |
2007 |
21 | EE | Roy Dyckhoff,
Stéphane Lengrand:
Call-by-Value lambda-calculus and LJQ.
J. Log. Comput. 17(6): 1109-1134 (2007) |
2006 |
20 | EE | Stéphane Lengrand,
Roy Dyckhoff,
James McKinna:
A Sequent Calculus for Type Theory.
CSL 2006: 441-455 |
19 | EE | Roy Dyckhoff,
Stéphane Lengrand:
LJQ: A Strongly Focused Calculus for Intuitionistic Logic.
CiE 2006: 173-185 |
18 | EE | Roy Dyckhoff,
Delia Kesner,
Stéphane Lengrand:
Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic.
IJCAR 2006: 347-361 |
17 | EE | Kevin Hammond,
Christian Ferdinand,
Reinhold Heckmann,
Roy Dyckhoff,
Martin Hofmann,
Steffen Jost,
Hans-Wolfgang Loidl,
Greg Michaelson,
Robert F. Pointon,
Norman Scaife,
Jocelyn Sérot,
Andy Wallace:
Towards Formally Verifiable WCET Analysis for a Functional Programming Language.
WCET 2006 |
16 | EE | Roy Dyckhoff,
Sara Negri:
Decision methods for linearly ordered Heyting algebras.
Arch. Math. Log. 45(4): 411-422 (2006) |
2005 |
15 | | Kevin Hammond,
Roy Dyckhoff,
Christian Ferdinand,
Reinhold Heckmann,
Martin Hofmann,
Steffen Jost,
Hans-Wolfgang Loidl,
Greg Michaelson,
Robert F. Pointon,
Norman Scaife,
Jocelyn Sérot,
Andy Wallace:
The Embounded project (project start paper).
Trends in Functional Programming 2005: 195-210 |
2003 |
14 | EE | Roy Dyckhoff,
Christian Urban:
Strong Normalization of Herbelin's Explicit Substitution Calculus with Substitution Propagation.
J. Log. Comput. 13(5): 689-706 (2003) |
2001 |
13 | EE | Roy Dyckhoff,
Sara Negri:
Admissibility of Structural Rules for Extensions of Contraction-Free Sequent Calculi.
Logic Journal of the IGPL 9(4): (2001) |
12 | | Roy Dyckhoff,
Heinrich Wansing:
Editorial.
Studia Logica 69(1): 3-4 (2001) |
11 | | Roy Dyckhoff,
Heinrich Wansing:
Editorial.
Studia Logica 69(2): 195-196 (2001) |
2000 |
10 | | Roy Dyckhoff:
Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABLEAUX 2000, St Andrews, Scotland, UK, July 3-7, 2000, Proceedings
Springer 2000 |
9 | | Roy Dyckhoff,
Sara Negri:
Admissibility of Structural Rules for Contraction-Free Systems of Intuitionistic Logic.
J. Symb. Log. 65(4): 1499-1518 (2000) |
1999 |
8 | EE | Roy Dyckhoff:
A Deterministic Terminating Sequent Calculus for Gödel-Dummett logic.
Logic Journal of the IGPL 7(3): 319-326 (1999) |
7 | EE | Roy Dyckhoff,
Luis Pinto:
Permutability of Proofs in Intuitionistic Sequent Calculi.
Theor. Comput. Sci. 212(1-2): 141-155 (1999) |
1998 |
6 | EE | Luis Pinto,
Roy Dyckhoff:
Sequent Calculi for the Normal Terms of the - and - Calculi.
Electr. Notes Theor. Comput. Sci. 17: (1998) |
5 | | Roy Dyckhoff,
Luis Pinto:
Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic.
Studia Logica 60(1): 107-118 (1998) |
1996 |
4 | | Roy Dyckhoff,
Heinrich Herre,
Peter Schroeder-Heister:
Extensions of Logic Programming, 5th International Workshop, ELP'96, Leipzig, Germany, March 28-30, 1996, Proceedings
Springer 1996 |
1994 |
3 | | Roy Dyckhoff:
Extensions of Logic Programming, 4th International Workshop, ELP'93, St. Andrews, U.K., March 29 - April 1, 1993, Proceedings
Springer 1994 |
1993 |
2 | | Roy Dyckhoff:
Introduction to ELP'93.
ELP 1993: 1-2 |
1992 |
1 | | Roy Dyckhoff:
Contraction-Free Sequent Calculi for Intuitionistic Logic.
J. Symb. Log. 57(3): 795-807 (1992) |