| 2009 |
|---|
| 30 | EE | Adam Poswolsky,
Carsten Schürmann:
System Description: Delphin - A Functional Programming Language for Deductive Systems.
Electr. Notes Theor. Comput. Sci. 228: 113-120 (2009) |
| 2008 |
|---|
| 29 | EE | Adam Poswolsky,
Carsten Schürmann:
Practical Programming with Higher-Order Encodings and Dependent Types.
ESOP 2008: 93-107 |
| 28 | EE | Anders Schack-Nielsen,
Carsten Schürmann:
Celf - A Logical Framework for Deductive and Concurrent Systems (System Description).
IJCAR 2008: 320-326 |
| 27 | EE | Carsten Schürmann,
Jeffrey Sarnat:
Structural Logical Relations.
LICS 2008: 69-80 |
| 26 | EE | Christoph Benzmüller,
Florian Rabe,
Carsten Schürmann,
Geoff Sutcliffe:
Evaluation of Systems for Higher-order Logic (ESHOL).
PAAR/ESHOL 2008 |
| 25 | EE | Brigitte Pientka,
Carsten Schürmann:
Preface.
Electr. Notes Theor. Comput. Sci. 196: 1 (2008) |
| 24 | EE | Carsten Schürmann:
Preface.
Electr. Notes Theor. Comput. Sci. 199: 1-2 (2008) |
| 23 | EE | Andrew McCreight,
Carsten Schürmann:
A Meta Linear Logical Framework.
Electr. Notes Theor. Comput. Sci. 199: 129-147 (2008) |
| 2006 |
|---|
| 22 | EE | Carsten Schürmann,
Mark-Oliver Stehr:
An Executable Formalization of the HOL/Nuprl Connection in the Metalogical Framework Twelf.
LPAR 2006: 150-166 |
| 21 | EE | Christoph Benzmüller,
John Harrison,
Carsten Schürmann:
LPAR-05 Workshop: Empirically Successfull Automated Reasoning in Higher-Order Logic (ESHOL)
CoRR abs/cs/0601042: (2006) |
| 2005 |
|---|
| 20 | EE | Carsten Schürmann,
Jatin Shah:
Identifying Polynomial-Time Recursive Functions.
CSL 2005: 525-540 |
| 19 | EE | Carsten Schürmann,
Adam Poswolsky,
Jeffrey Sarnat:
The [triangle]-Calculus. Functional Programming with Higher-Order Encodings.
TLCA 2005: 339-353 |
| 18 | EE | Carsten Schürmann:
Meta-Logical Frameworks and Formal Digital Libraries.
VSTTE 2005: 478-485 |
| 17 | EE | Aaron Stump,
Carsten Schürmann:
Logical Semantics for the Rewriting Calculus.
Electr. Notes Theor. Comput. Sci. 125(2): 149-164 (2005) |
| 2004 |
|---|
| 16 | EE | Carsten Schürmann:
Twelf and Delphin: Logic and Functional Programming in a Meta-logical Framework.
FLOPS 2004: 22-23 |
| 2003 |
|---|
| 15 | EE | Serge Autexier,
Carsten Schürmann:
Disproving False Conjectures.
LPAR 2003: 33-48 |
| 14 | EE | Carsten Schürmann,
Jatin Shah:
Representing reductions of NP-complete problems in logical frameworks: a case study.
MERLIN 2003 |
| 13 | EE | Carsten Schürmann,
Frank Pfenning:
A Coverage Checking Algorithm for LF.
TPHOLs 2003: 120-135 |
| 2002 |
|---|
| 12 | EE | Carsten Schürmann,
Serge Autexier:
Towards Proof Planning for M-omega-plus.
Electr. Notes Theor. Comput. Sci. 70(2): (2002) |
| 2001 |
|---|
| 11 | EE | Carsten Schürmann:
Recursion for Higher-Order Encodings.
CSL 2001: 585-599 |
| 10 | EE | Carsten Schürmann:
A Type-Theoretic Approach to Induction with Higher-Order Encodings.
LPAR 2001: 266-281 |
| 9 | EE | Carsten Schürmann,
Dachuan Yu,
Zhaozhong Ni:
A Representation of Fomega in LF.
Electr. Notes Theor. Comput. Sci. 58(1): (2001) |
| 8 | EE | Carsten Schürmann,
Joëlle Despeyroux,
Frank Pfenning:
Primitive recursion for higher-order abstract syntax.
Theor. Comput. Sci. 266(1-2): 1-57 (2001) |
| 2000 |
|---|
| 7 | | Carsten Schürmann:
Tutorial: Meta-logical Frameworks.
CADE 2000: 507-508 |
| 6 | | Carsten Schürmann:
Workshop: Automation of Proofs by Mathematical Induction.
CADE 2000: 514 |
| 1999 |
|---|
| 5 | EE | Frank Pfenning,
Carsten Schürmann:
System Description: Twelf - A Meta-Logical Framework for Deductive Systems.
CADE 1999: 202-206 |
| 1998 |
|---|
| 4 | EE | Carsten Schürmann,
Frank Pfenning:
Automated Theorem Proving in a Simple Meta-Logic for LF.
CADE 1998: 286-300 |
| 3 | EE | Frank Pfenning,
Carsten Schürmann:
Algorithms for Equality and Unification in the Presence of Notational Definitions.
TYPES 1998: 179-193 |
| 2 | EE | Frank Pfenning,
Carsten Schürmann:
Algorithms for Equality and Unification in the Presence of Notational Definitions.
Electr. Notes Theor. Comput. Sci. 17: (1998) |
| 1997 |
|---|
| 1 | | Joëlle Despeyroux,
Frank Pfenning,
Carsten Schürmann:
Primitive Recursion for Higher-Order Abstract Syntax.
TLCA 1997: 147-163 |
