| System description: Twelf—a meta-logical framework for deductive systems F Pfenning, C Schürmann International Conference on Automated Deduction, 202-206, 1999 | 846 | 1999 |
| Automating the meta theory of deductive systems CE Schurmann Carnegie Mellon University, 2000 | 146 | 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 | 139 | 1997 |
| Automated theorem proving in a simple meta-logic for LF C Schürmann, F Pfenning International Conference on Automated Deduction, 286-300, 1998 | 88 | 1998 |
| Primitive recursion for higher-order abstract syntax C Schürmann, J Despeyroux, F Pfenning Theoretical Computer Science 266 (1-2), 1-57, 2001 | 82 | 2001 |
| A coverage checking algorithm for LF C Schürmann, F Pfenning International Conference on Theorem Proving in Higher Order Logics, 120-135, 2003 | 80 | 2003 |
| Multiparty session types as coherence proofs M Carbone, F Montesi, C Schürmann, N Yoshida Acta Informatica 54 (3), 243-269, 2017 | 71 | 2017 |
| 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 | 70 | 2009 |
| Practical programming with higher-order encodings and dependent types A Poswolsky, C Schürmann European Symposium on Programming, 93-107, 2008 | 66 | 2008 |
| Coherence generalises duality: A logical explanation of multiparty session types M Carbone, S Lindley, F Montesi, C Schürmann, P Wadler 27th International Conference on Concurrency Theory (CONCUR 2016), 2016 | 61 | 2016 |
| A practical module system for LF F Rabe, C Schürmann Proceedings of the Fourth International Workshop on Logical Frameworks and …, 2009 | 54 | 2009 |
| Choreographies, logically M Carbone, F Montesi, C Schürmann Distributed Computing 31 (1), 51-67, 2018 | 51 | 2018 |
| Celf–A logical framework for deductive and concurrent systems (System description) A Schack-Nielsen, C Schürmann International Joint Conference on Automated Reasoning, 320-326, 2008 | 46 | 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 | 43 | 2005 |
| 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 |
| The Twelf proof assistant C Schürmann International Conference on Theorem Proving in Higher Order Logics, 79-83, 2009 | 34 | 2009 |
| Structural logical relations C Schürmann, J Sarnat 2008 23rd Annual IEEE Symposium on Logic in Computer Science, 69-80, 2008 | 31 | 2008 |
| Recursion for higher-order encodings C Schürmann International Workshop on Computer Science Logic, 585-599, 2001 | 31 | 2001 |
| An executable formalization of the HOL/Nuprl connection in the metalogical framework Twelf C Schürmann, MO Stehr International Conference on Logic for Programming Artificial Intelligence …, 2006 | 30 | 2006 |
| Twelf user’s guide F Pfenning, C Schuermann version 1.2. Technical Report CMU-CS-98-173, Carnegie Mellon University, 1998 | 30 | 1998 |
Frank PfenningProfessor of Computer Science, Carnegie Mellon UniversityVerified email at cs.cmu.edu
