The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Carsten Schürmann: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Frank Pfenning, Carsten Schürmann
    System Description: Twelf - A Meta-Logical Framework for Deductive Systems. [Citation Graph (0, 0)][DBLP]
    CADE, 1999, pp:202-206 [Conf]
  2. Carsten Schürmann
    Tutorial: Meta-logical Frameworks. [Citation Graph (0, 0)][DBLP]
    CADE, 2000, pp:507-508 [Conf]
  3. Carsten Schürmann
    Workshop: Automation of Proofs by Mathematical Induction. [Citation Graph (0, 0)][DBLP]
    CADE, 2000, pp:514- [Conf]
  4. Carsten Schürmann, Frank Pfenning
    Automated Theorem Proving in a Simple Meta-Logic for LF. [Citation Graph (0, 0)][DBLP]
    CADE, 1998, pp:286-300 [Conf]
  5. Carsten Schürmann
    Recursion for Higher-Order Encodings. [Citation Graph (0, 0)][DBLP]
    CSL, 2001, pp:585-599 [Conf]
  6. Carsten Schürmann, Jatin Shah
    Identifying Polynomial-Time Recursive Functions. [Citation Graph (0, 0)][DBLP]
    CSL, 2005, pp:525-540 [Conf]
  7. Carsten Schürmann
    Twelf and Delphin: Logic and Functional Programming in a Meta-logical Framework. [Citation Graph (0, 0)][DBLP]
    FLOPS, 2004, pp:22-23 [Conf]
  8. Carsten Schürmann, Jatin Shah
    Representing reductions of NP-complete problems in logical frameworks: a case study. [Citation Graph (0, 0)][DBLP]
    MERLIN, 2003, pp:- [Conf]
  9. Serge Autexier, Carsten Schürmann
    Disproving False Conjectures. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:33-48 [Conf]
  10. Carsten Schürmann
    A Type-Theoretic Approach to Induction with Higher-Order Encodings. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:266-281 [Conf]
  11. Carsten Schürmann, Mark-Oliver Stehr
    An Executable Formalization of the HOL/Nuprl Connection in the Metalogical Framework Twelf. [Citation Graph (0, 0)][DBLP]
    LPAR, 2006, pp:150-166 [Conf]
  12. Joëlle Despeyroux, Frank Pfenning, Carsten Schürmann
    Primitive Recursion for Higher-Order Abstract Syntax. [Citation Graph (0, 0)][DBLP]
    TLCA, 1997, pp:147-163 [Conf]
  13. Carsten Schürmann, Adam Poswolsky, Jeffrey Sarnat
    The [triangle]-Calculus. Functional Programming with Higher-Order Encodings. [Citation Graph (0, 0)][DBLP]
    TLCA, 2005, pp:339-353 [Conf]
  14. Carsten Schürmann, Frank Pfenning
    A Coverage Checking Algorithm for LF. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2003, pp:120-135 [Conf]
  15. Frank Pfenning, Carsten Schürmann
    Algorithms for Equality and Unification in the Presence of Notational Definitions. [Citation Graph (0, 0)][DBLP]
    TYPES, 1998, pp:179-193 [Conf]
  16. Frank Pfenning, Carsten Schürmann
    Algorithms for Equality and Unification in the Presence of Notational Definitions. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1998, v:17, n:, pp:- [Journal]
  17. Carsten Schürmann, Serge Autexier
    Towards Proof Planning for M-omega-plus. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:70, n:2, pp:- [Journal]
  18. Aaron Stump, Carsten Schürmann
    Logical Semantics for the Rewriting Calculus. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:125, n:2, pp:149-164 [Journal]
  19. Carsten Schürmann, Joëlle Despeyroux, Frank Pfenning
    Primitive recursion for higher-order abstract syntax. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:1-57 [Journal]
  20. Carsten Schürmann, Dachuan Yu, Zhaozhong Ni
    A Representation of Fomega in LF. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:58, n:1, pp:- [Journal]
  21. Christoph Benzmüller, John Harrison, Carsten Schürmann
    LPAR-05 Workshop: Empirically Successfull Automated Reasoning in Higher-Order Logic (ESHOL) [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  22. Celf - A Logical Framework for Deductive and Concurrent Systems (System Description). [Citation Graph (, )][DBLP]


  23. Evaluation of Systems for Higher-order Logic (ESHOL). [Citation Graph (, )][DBLP]


  24. Curry-Style Explicit Substitutions for the Linear and Affine Lambda Calculus. [Citation Graph (, )][DBLP]


  25. Practical Programming with Higher-Order Encodings and Dependent Types. [Citation Graph (, )][DBLP]


  26. Structural Logical Relations. [Citation Graph (, )][DBLP]


  27. Lexicographic Path Induction. [Citation Graph (, )][DBLP]


  28. The Twelf Proof Assistant. [Citation Graph (, )][DBLP]


  29. Meta-Logical Frameworks and Formal Digital Libraries. [Citation Graph (, )][DBLP]


  30. Preface. [Citation Graph (, )][DBLP]


  31. Preface. [Citation Graph (, )][DBLP]


  32. A Meta Linear Logical Framework. [Citation Graph (, )][DBLP]


  33. System Description: Delphin - A Functional Programming Language for Deductive Systems. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002