| System description: Twelf—a meta-logical framework for deductive systems H Ganzinger, F Pfenning, C Schürmann Automated Deduction—CADE-16: 16th International Conference on Automated …, 1999 | 898 | 1999 |
| Automating the meta theory of deductive systems CE Schurmann Carnegie Mellon University, 2000 | 158 | 2000 |
| Primitive recursion for higher-order abstract syntax J Despeyroux, F Pfenning, C Schürmann International Conference on Typed Lambda Calculi and Applications, 147-163, 1997 | 141 | 1997 |
| Multiparty session types as coherence proofs M Carbone, F Montesi, C Schürmann, N Yoshida Acta Informatica 54, 243-269, 2017 | 97 | 2017 |
| Primitive recursion for higher-order abstract syntax C Schürmann, J Despeyroux, F Pfenning Theoretical Computer Science 266 (1-2), 1-57, 2001 | 92 | 2001 |
| Automated theorem proving in a simple meta-logic for LF C Schürmann, F Pfenning International Conference on Automated Deduction, 286-300, 1998 | 86 | 1998 |
| Coherence generalises duality: A logical explanation of multiparty session types M Carbone, S Lindley, F Montesi, C Schürmann, P Wadler Proceedings of the 27th International Conference on Concurrency Theory, 1-15, 2016 | 85 | 2016 |
| A coverage checking algorithm for LF C Schürmann, F Pfenning International Conference on Theorem Proving in Higher Order Logics, 120-135, 2003 | 82 | 2003 |
| System description: Delphin–a functional programming language for deductive systems A Poswolsky, C Schürmann Electronic Notes in Theoretical Computer Science 228, 113-120, 2009 | 72 | 2009 |
| Practical programming with higher-order encodings and dependent types A Poswolsky, C Schürmann European Symposium on Programming, 93-107, 2008 | 67 | 2008 |
| A practical module system for LF F Rabe, C Schürmann Proceedings of the Fourth International Workshop on Logical Frameworks and …, 2009 | 62 | 2009 |
| Celf–A logical framework for deductive and concurrent systems (System description) A Schack-Nielsen, C Schürmann Automated Reasoning: 4th International Joint Conference, IJCAR 2008 Sydney …, 2008 | 55 | 2008 |
| The-calculus. Functional programming with higher-order encodings C Schürmann, A Poswolsky, J Sarnat International Conference on Typed Lambda Calculi and Applications, 339-353, 2005 | 44 | 2005 |
| Choreographies, logically M Carbone, F Montesi, C Schürmann Distributed Computing 31, 51-67, 2018 | 43 | 2018 |
| The Twelf proof assistant C Schürmann International Conference on Theorem Proving in Higher Order Logics, 79-83, 2009 | 36 | 2009 |
| Twelf user’s guide F Pfenning, C Schuermann version 1.2. Technical Report CMU-CS-98-173, Carnegie Mellon University, 1998 | 36 | 1998 |
| Algorithms for equality and unification in the presence of notational definitions F Pfenning, C Schürmann International Workshop on Types for Proofs and Programs, 179-193, 1998 | 36 | 1998 |
| Towards a mechanized proof of selene receipt-freeness and vote-privacy A Bruni, E Drewsen, C Schürmann Electronic Voting: Second International Joint Conference, E-Vote-ID 2017 …, 2017 | 33 | 2017 |
| Structural logical relations C Schürmann, J Sarnat 2008 23rd Annual IEEE Symposium on Logic in Computer Science, 69-80, 2008 | 33 | 2008 |
| Recursion for higher-order encodings C Schürmann International Workshop on Computer Science Logic, 585-599, 2001 | 32 | 2001 |
Frank PfenningProfessor of Computer Science, Carnegie Mellon UniversityVerified email at cs.cmu.edu
