Conference Logical and meta-logical frameworks - (Abstract) 1999 • Lecture Notes in Computer Science • 1702:206-206 Pfenning F
Conference Natural deduction for intuitionistic non-commutative linear logic 1999 • Lecture Notes in Computer Science • 1581:295-309 Polakow J, Pfenning F
Conference On proving syntactic properties of CPS programs 1999 • Electronic Notes in Theoretical Computer Science • 26:21-33 Danvy O, Dzafic B, Pfennin F
Journal Article On the logical foundations of staged computation (Invited talk) 1999 • ACM Sigplan Notices • 34(11):33-33 Pfenning F
Conference Relating natural deduction and sequent calculus for intuitionistic non-commutative linear logic 1999 • Electronic Notes in Theoretical Computer Science • 20:449-466 Polakow J, Pfenning F
Conference System description: Twelf — a meta-logical framework for deductive systems 1999 • Lecture Notes in Computer Science • 1632:202-206 Pfenning F, Schürmann C
Conference The relative complement problem for higher-order patterns 1999 • LOGIC PROGRAMMING: PROCEEDINGS OF THE 1999 INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING • 380-394 Momigliano A, Pfenning F
Conference -Invited Talk- Reasoning about deductions in linear logic 1998 • Lecture Notes in Computer Science • 1421:1-2 Pfenning F
Journal Article A module system for a programming language based on the LF logical framework 1998 • Journal of Logic and Computation • 8(1):5-31 Harper R, Pfenning F
Journal Article Algorithms for Equality and Unification in the Presence of Notational Definitions 1998 • Electronic Notes in Theoretical Computer Science • 17:1-13 Pfenning F, Schürmann C
Conference Automated theorem proving in a simple meta-logic for LF 1998 • Lecture Notes in Computer Science • 1421:286-300 Schürmann C, Pfenning F
Conference Eliminating array bound checking through dependent types 1998 • Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) • 249-257 Xi H, Pfenning F
Journal Article Eliminating array bound checking through dependent types 1998 • ACM Sigplan Notices • 33(5):249-257 Xi HW, Pfenning F
Journal Article Modal Types as Staging Specications for Run-time Code Generation 1998 • ACM Computing Surveys • 30(3):1-7 Wickline P, Lee P, Pfenning F, Davies R
Journal Article Run-time code generation and Modal-ML 1998 • ACM Sigplan Notices • 33(5):224-235 Wickline P, Lee P, Pfenning F
Conference Run-time code generation and modal-ML 1998 • Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) • 224-235 Wickline P, Lee P, Pfenning F
Journal Article The Fox Project: Advanced Language Technology for Extensible Systems 1998 Harper R, Lee P, Pfenning F
Conference Linear higher-order pre-unification 1997 • Proceedings - Symposium on Logic in Computer Science • 422-433 Cervesato I, Pfenning F
Journal Article On the unification problem for Cartesian closed categories 1997 • Journal of Symbolic Logic (JSL) • 62(2):636-647 Narendran P, Pfenning F, Statman R
Journal Article On the unification problem for Cartesian closed categories 1997 • Journal of Symbolic Logic (JSL) • 62(2):636-647 Narendran P, Pfenning F, Statman R
Conference Primitive recursion for higher-order abstract syntax 1997 • Lecture Notes in Computer Science • 1210:147-163 Despeyroux J, Pfenning F, Schurmann C
