Chapter Algorithms for Equality and Unification in the Presence of Notational Definitions 1999 • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 1657:179-193 Pfenning F, Schürmann C
Conference Automated techniques for provably safe mobile code 1999 406-419 vol.1 Crary K, Harper R, Lee P, Pfenning F
Journal Article Dependent types in practical programming 1999 • Conference Record of the Annual ACM Symposium on Principles of Programming Languages • 214-227 Xi H, Pfenning F
Conference Logical and Meta-Logical Frameworks 1999 • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 1702:206-206 Pfenning F
Conference Logical and meta-logical frameworks - (Abstract) 1999 • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 1702:206-206 Pfenning F
Conference Natural deduction for intuitionistic non-commutative linear logic 1999 • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 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 (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 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
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 (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 1421:286-300 Schürmann C, 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 specifications for run-time code generation 1998 • ACM Computing Surveys • 30(3es):8 Wickline P, Lee P, Pfenning F, Davies R
Conference Reasoning about deductions in linear logic 1998 • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 1421:1-2 Pfenning F
Journal Article Run-time code generation and Modal-ML 1998 • ACM Sigplan Notices • 33(5):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
