Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Carsten Schürmann
2010 – today
- 2013
[c32]Bernhard Beckert, Rajeev Goré, Carsten Schürmann: Analysing Vote Counting Algorithms via Logic - And Its Application to the CADE Election Scheme. CADE 2013: 135-144- 2012
[c31]- 2011
[j10]
[c30]
[c29]- 2010
[c28]Anders Schack-Nielsen, Carsten Schürmann: Curry-Style Explicit Substitutions for the Linear and Affine Lambda Calculus. IJCAR 2010: 1-14
[c27]Matthias Schöpfer, Carsten Schürmann, Michael Pardowitz, Helge Ritter: Using a Piezo-Resistive Tactile Sensor for Detection of Incipient Slippage. ISR/ROBOTIK 2010: 1-7
[c26]
[c25]Anders Schack-Nielsen, Carsten Schürmann: Pattern Unification for the Lambda Calculus with Linear and Affine Types. LFMTP 2010: 101-116
2000 – 2009
- 2009
[j9]Adam Poswolsky, Carsten Schürmann: System Description: Delphin - A Functional Programming Language for Deductive Systems. Electr. Notes Theor. Comput. Sci. 228: 113-120 (2009)
[c24]
[c23]
[c22]
[c21]- 2008
[j8]
[j7]
[j6]Andrew McCreight, Carsten Schürmann: A Meta Linear Logical Framework. Electr. Notes Theor. Comput. Sci. 199: 129-147 (2008)
[c20]Christoph Benzmüller, Florian Rabe, Carsten Schürmann, Geoff Sutcliffe: Evaluation of Systems for Higher-order Logic (ESHOL). PAAR/ESHOL 2008
[c19]Anders Schack-Nielsen, Carsten Schürmann: Celf - A Logical Framework for Deductive and Concurrent Systems (System Description). IJCAR 2008: 320-326
[c18]Adam Poswolsky, Carsten Schürmann: Practical Programming with Higher-Order Encodings and Dependent Types. ESOP 2008: 93-107
[c17]- 2006
[c16]Carsten Schürmann, Mark-Oliver Stehr: An Executable Formalization of the HOL/Nuprl Connection in the Metalogical Framework Twelf. LPAR 2006: 150-166
[i1]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
[j5]Aaron Stump, Carsten Schürmann: Logical Semantics for the Rewriting Calculus. Electr. Notes Theor. Comput. Sci. 125(2): 149-164 (2005)
[c15]
[c14]Carsten Schürmann, Adam Poswolsky, Jeffrey Sarnat: The [triangle]-Calculus. Functional Programming with Higher-Order Encodings. TLCA 2005: 339-353
[c13]- 2004
[c12]Carsten Schürmann: Twelf and Delphin: Logic and Functional Programming in a Meta-logical Framework. FLOPS 2004: 22-23- 2003
[c11]Carsten Schürmann, Jatin Shah: Representing reductions of NP-complete problems in logical frameworks: a case study. MERLIN 2003
[c10]
[c9]- 2002
[j4]Carsten Schürmann, Serge Autexier: Towards Proof Planning for Mω+. Electr. Notes Theor. Comput. Sci. 70(2): 124-145 (2002)- 2001
[j3]Carsten Schürmann, Dachuan Yu, Zhaozhong Ni: A Representation of Fomega in LF. Electr. Notes Theor. Comput. Sci. 58(1): 79-96 (2001)
[j2]Carsten Schürmann, Joëlle Despeyroux, Frank Pfenning: Primitive recursion for higher-order abstract syntax. Theor. Comput. Sci. 266(1-2): 1-57 (2001)
[c8]
[c7]Carsten Schürmann: A Type-Theoretic Approach to Induction with Higher-Order Encodings. LPAR 2001: 266-281- 2000
[c6]
[c5]
1990 – 1999
- 1999
[c4]Frank Pfenning, Carsten Schürmann: System Description: Twelf - A Meta-Logical Framework for Deductive Systems. CADE 1999: 202-206- 1998
[j1]Frank Pfenning, Carsten Schürmann: Algorithms for Equality and Unification in the Presence of Notational Definitions. Electr. Notes Theor. Comput. Sci. 17: 1-13 (1998)
[c3]Carsten Schürmann, Frank Pfenning: Automated Theorem Proving in a Simple Meta-Logic for LF. CADE 1998: 286-300
[c2]Frank Pfenning, Carsten Schürmann: Algorithms for Equality and Unification in the Presence of Notational Definitions. TYPES 1998: 179-193- 1997
[c1]Joëlle Despeyroux, Frank Pfenning, Carsten Schürmann: Primitive Recursion for Higher-Order Abstract Syntax. TLCA 1997: 147-163
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18 22:42 CEST by the dblp team



