Search the dblp DataBase

Publications of Author

1. Roy Dyckhoff, Delia Kesner, Stephane Lengrand
   Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic. [Citation Graph (0, 0)][DBLP]
   IJCAR, 2006, pp:347-361 [Conf]
   
2. Roy Dyckhoff, Stephane Lengrand
   LJQ: A Strongly Focused Calculus for Intuitionistic Logic. [Citation Graph (0, 0)][DBLP]
   CiE, 2006, pp:173-185 [Conf]
   
3. Stephane Lengrand, Roy Dyckhoff, James McKinna
   A Sequent Calculus for Type Theory. [Citation Graph (0, 0)][DBLP]
   CSL, 2006, pp:441-455 [Conf]
   
4. Roy Dyckhoff
   Introduction to ELP'93. [Citation Graph (0, 0)][DBLP]
   ELP, 1993, pp:1-2 [Conf]
   
5. Roy Dyckhoff, Sara Negri
   Decision methods for linearly ordered Heyting algebras. [Citation Graph (0, 0)][DBLP]
   Arch. Math. Log., 2006, v:45, n:4, pp:411-422 [Journal]
   
6. Luis Pinto, Roy Dyckhoff
   Sequent Calculi for the Normal Terms of the - and - Calculi. [Citation Graph (0, 0)][DBLP]
   Electr. Notes Theor. Comput. Sci., 1998, v:17, n:, pp:- [Journal]
   
7. Roy Dyckhoff
   A Deterministic Terminating Sequent Calculus for Gödel-Dummett logic. [Citation Graph (0, 0)][DBLP]
   Logic Journal of the IGPL, 1999, v:7, n:3, pp:319-326 [Journal]
   
8. Roy Dyckhoff, Sara Negri
   Admissibility of Structural Rules for Extensions of Contraction-Free Sequent Calculi. [Citation Graph (0, 0)][DBLP]
   Logic Journal of the IGPL, 2001, v:9, n:4, pp:- [Journal]
   
9. Roy Dyckhoff
   Contraction-Free Sequent Calculi for Intuitionistic Logic. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1992, v:57, n:3, pp:795-807 [Journal]
   
10. Roy Dyckhoff, Sara Negri
    Admissibility of Structural Rules for Contraction-Free Systems of Intuitionistic Logic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2000, v:65, n:4, pp:1499-1518 [Journal]
    
11. Roy Dyckhoff, Christian Urban
    Strong Normalization of Herbelin's Explicit Substitution Calculus with Substitution Propagation. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2003, v:13, n:5, pp:689-706 [Journal]
    
12. Roy Dyckhoff, Luis Pinto
    Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 1998, v:60, n:1, pp:107-118 [Journal]
    
13. Roy Dyckhoff, Heinrich Wansing
    Editorial. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 2001, v:69, n:1, pp:3-4 [Journal]
    
14. Roy Dyckhoff, Heinrich Wansing
    Editorial. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 2001, v:69, n:2, pp:195-196 [Journal]
    
15. Roy Dyckhoff, Luis Pinto
    Permutability of Proofs in Intuitionistic Sequent Calculi. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:212, n:1-2, pp:141-155 [Journal]
    
16. 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). [Citation Graph (0, 0)][DBLP]
    Trends in Functional Programming, 2005, pp:195-210 [Conf]
    
17. 
    Towards Formally Verifiable WCET Analysis for a Functional Programming Language. [Citation Graph (, )][DBLP]
    
    
18. 
    Proof-Theoretic Semantics for a Natural Language Fragment. [Citation Graph (, )][DBLP]
    
    
19. 
    Positive Logic with Adjoint Modalities: Proof Theory, Semantics and Reasoning about Information [Citation Graph (, )][DBLP]
    
    
20. 
    Positive Logic with Adjoint Modalities: Proof Theory, Semantics and Reasoning about Information. [Citation Graph (, )][DBLP]