Carsten Schürmann
Department of Computer Science
Carnegie Mellon University
5000 Forbes Avenue
Pittsburgh, PA 15213-3891
U.S.A.
carsten@cs.cmu.edu
+1.412.268.3069
+1.412.268.5576 (FAX)
|
|
Home |
|
|
Job Search |
|
|
Publications |
|
|
Conferences |
|
|
Projects |
Job Search
My application package contains| Curriculum Vitae | |
| Research Statement | |
| Teaching Statement | |
| [PS99] |
Frank Pfenning and Carsten Schürmann.
System description: Twelf --- a meta-logical framework for deductive
systems. In H. Ganzinger, editor, Proceedings of the 16th International
Conference on Automated Deduction (CADE-16), pages 202--206, Trento, Italy,
July 1999. Springer-Verlag LNAI 1632. |
| [SP98] |
Carsten Schürmann and Frank Pfenning.
Automated theorem proving in a simple meta-logic for LF.
In Claude Kirchner and Hélène Kirchner, editors,
Proceedings of the 15th International Conference on Automated Deduction
(CADE-15), pages 286--300, Lindau, Germany, July 1998. Springer-Verlag LNCS
1421. |
| [PS98b] | Frank Pfenning and Carsten Schürmann. Algorithms for equality and unification in the presence of notational definitions. In T. Altenkirch, W. Naraschewski, and B. Reus, editors, Types for Proofs and Programs. Springer-Verlag LNCS 1657, 1998. |
| [DPS97] |
Joëlle Despeyroux, Frank Pfenning, and Carsten Schürmann.
Primitive recursion for higher-order abstract syntax.
In R.~Hindley, editor, Proceedings of the Third International
Conference on Typed Lambda Calculus and Applications (TLCA'97), pages
147--163, Nancy, France, April 1997. Springer-Verlag LNCS.
An extended version is available as Technical Report CMU-CS-96-172,
Carnegie Mellon University. |