- Higher-Order Logic Programming Constraint Logic Programming
- Unification via Explicit Substitutions: The Case of Higher-Order Patterns
- Computation and Deduction Frank Pfenning
- Extensions and Applications of Higherorder Unification
- Efficient Resource Management Submitted to Theoretical Computer Science. Comments are welcome!
- Refinement Types as Proof Irrelevance William Lovas and Frank Pfenning
- Avoiding Spurious Causal Dependencies via Proof Irrelevance
- A Linear Logic of Authorization and Knowledge Deepak Garg, Lujo Bauer, Kevin D. Bowers,
- A Learning Algorithm for Localizing People Based on Wireless Signal Strength that Uses Labeled and Unlabeled Data
- A Linear Spine Calculus Iliano Cervesato and Frank Pfenning1
- Verifying Uniqueness in a Logical Framework Penny Anderson1
- Primitive Recursion for Higher-Order Abstract Syntax
- System Description: Twelf --A Meta-Logical Framework for Deductive Systems
- Non-Interference in Constructive Authorization Logic Deepak Garg
- Higher-Order Pattern Complement and the Strict ALBERTO MOMIGLIANO
- Contemporary 1tfathematics Volume 29, 1984
- A Logical Characterization of Forward and Backward Chaining in the Inverse Method
- Using Constrained Intuitionistic Linear Logic for Hybrid Robotic Planning Problems
- Type-Directed Concurrency Deepak Garg and Frank Pfenning
- Implementing the Meta-Theory of Deductive Frank Pfenning and Ekkehard Rohwedder
- The Practice of Logical Frameworks To appear in the proceedings of CAAP'96, Linkoping, Sweden, April 1996
- Partial Polymorphic Type Inference and Higher-Order Unification Frank Pfenning'
- Mode and Termination Checking for Higher-Order Logic Programs
- Problems in Rewriting Applied to Categorical Concepts
- Twelf User's Guide Version 1.3
- Modularity Matters Most Robert Harper
- LEAP: A Language with Eval And Polymorphism Frank Pfenning and Peter Lee
- Optimizing Higher-Order Pattern Unification Brigitte Pientka and Frank Pfenning
- The Occurrence of Continuation Parameters in CPS Terms
- On Equivalence and Canonical Forms in the LF Type Theory
- Modal Types as Staging Specifications for Run-time Code Generation
- On the Unification Problem for Cartesian Closed Categories (Extended Abstract)
- Research on Semantically Based Program-Design Environments
- A Logical Characterization of Forward and Backward Chaining in the Inverse Method
- ARTICLE NO. A Linear Logical Framework1
- Structural Cut Elimination Frank Pfenning
- Unification in a -Calculus with Intersection Types
- A Probabilistic Language based upon Sampling Functions
- de recherche INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE
- Run-time Code Generation and Modal-ML Philip Wickline Peter Lee Frank Pfenning
- Tutorial on Amy Felty Elsa Gunter
- Decidability Results For Categorical Notions Related To Monads
- Higherorder Unification with Dependent Function Types \Lambda
- HOOTS99 Preliminary Version On proving syntactic properties of CPS programs
- Linear Higher-Order Pre-Unification Iliano Cervesato and Frank Pfenning
- Refinement Types for Logical Frameworks Frank Pfenning
- A concurrent logical framework I: Judgments and properties
- Bibliography on Logical Frameworks Frank Pfenning
- Linear Logical Approximations Robert J. Simmons Frank Pfenning
- [1] Gregor V. Bochmann. Semantics evaluation from left to right. Communications of the ACM,
- Unification and Anti-Unification in the Calculus of Constructions Frank Pfenning
- Automated Techniques for Provably Safe Mobile Code
- Types in Logic Programming Frank Pfenning
- Automated Theorem Proving in a Simple Meta-Logic for LF
- MFPS XV Preliminary Version Relating Natural Deduction and Sequent
- Higher-Order Abstract Syntax Frank Pfenning
- On the Undecidability of Partial Polymorphic Type Reconstruction
- Under consideration for publication in Math. Struct. in Comp. Science A Judgmental Reconstruction of Modal
- Elf: A Language for Logic Definition and Verified Metaprogramming
- Algorithms for Equality and Unification in the Presence of Notational Definitions
- Reasoning About Deductions in Linear Logic (Invited Talk)
- Inductively De ned Types in the Calculus of Constructions
- Dependent Types in Practical Programming (Extended Abstract)
- Electronic Notes in Computer Science 1 (1995) On a Modal -Calculus for S4
- Twelf User's Guide Version 1.3
- Resource Management for the Inverse Method in Linear Logic
- A Focusing Inverse Method Theorem Prover for First-Order Linear Logic
- Systems of Polymorphic Type Assignment in LF Robert Harper
- The MiniML Language Unfortunately one often pays a price for [languages which impose
- Natural Semantics and Some of its Meta-Theory in Elf
- The TPS Theorem Proving System Peter B. Andrews Sunil Issar Dan Nesmith Frank Pfenning
- Efficient Resource Management This paper will appear in the proceedings of the 1996 International Workshop on
- A Framework for Defining Logics Robert Harper* Furio Honselly Gordon Plotkinz
- Problems in Rewriting applied to Categorical Concepts
- Extensions and Applications of Higher-order Unification
- Proof of the Decidability of the Uniform Word Problem for Monads
- Ordered Linear Logic Programming Jeff Polakow and Frank Pfenning 1
- Elf: A Meta-Language for Deductive Systems (System Description)
- A Coverage Checking Algorithm for LF Carsten Schurmann1
- A Bidirectional Refinement Type System for LF William Lovas1
- Natural Deduction for Intuitionistic Non-Commutative Linear Logic
- REFINEMENT TYPES FOR LOGICAL FRAMEWORKS AND THEIR INTERPRETATION AS PROOF IRRELEVANCE
- Focus-preserving Embeddings of Substructural Logics in Intuitionistic Logic University of Pennsylvania
- Reasoning about the Consequences of Authorization Policies in a
- Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method
- Imogen: Focusing the Polarized Inverse Method for Intuitionistic Propositional Logic
- Church and Curry: Combining Intrin-sic and Extrinsic Typing
- Linear Logical Algorithms Robert J. Simmons and Frank Pfenning
- Intuitionistic Letcc via Labelled Deduction Jason Reed 1,2
- Focusing the Inverse Method for Linear Logic Kaustuv Chaudhuri and Frank Pfenning
- Under consideration for publication in J. Functional Programming 1 A Monadic Analysis of Information Flow
- Monadic Concurrent Linear Logic Programming Pablo Lopez
- Under consideration for publication in J. Functional Programming 1 Staged Computation with Names and Necessity
- A Probabilistic Language based upon Sampling Functions Sungwoo Park Frank Pfenning
- Tridirectional Typechecking Joshua Dunfield
- Benjamin C. Pierce. Types and Programming Languages, The MIT Press, Cambridge, Massachusetts, xxi + 623 pp.
- A Symmetric Modal Lambda Calculus for Distributed Computing Tom Murphy VII
- LFM 2004 Preliminary Version Specifying Properties of Concurrent
- Type Assignment for Intersections and Unions in Call-by-Value Languages
- A Type Theory for Memory Allocation and Data Layout Leaf Petersen Robert Harper Karl Crary Frank Pfenning
- LOGICAL FRAMEWORKS--A BRIEF INTRODUCTION FRANK PFENNING (fp+@cs.cmu.edu)
- Human-Readable Machine-Verifiable Proofs for Teaching Constructive Logic
- A Modal Analysis of Staged Computation Rowan Davies
- Intensionality, Extensionality, and Proof Irrelevance in Modal Type Theory
- Intersection Types and Computational Effects Rowan Davies
- Termination and Reduction Checking in the Logical Framework
- Properties of Terms in Continuation-Passing Style in an Ordered Logical Framework
- The Relative Complement Problem for Higher-Order Patterns
- A Formalization of the Proof-Carrying Code Architecture in a Linear Logical Framework
- Eliminating Array Bound Checking Through Dependent Types Department of Mathematical Sciences
- A Linear Logical Framework Iliano Cervesato and Frank Pfenning
- A Modal Analysis of Staged Computation Rowan Davies
- Structural Cut Elimination in Linear Logic Frank Pfenning
- Compiler Verification in LF John Hannan
- An Empirical Study of the Runtime Behavior of Higher-Order Logic Programs 1
- A Declarative Alternative to "assert" in Logic Programming
- Refinement Types for ML Tim Freeman
- Logic Programming in the LF Logical Framework Frank Pfenning
- PROGRAM DEVELOPMENT THROUGH PROOF TRANSFORMATION
- Presenting Intuitive Deductions via Symmetric Simplification
- Towards a Practical Programming Language Based on the Polymorphic Lambda Calculus
- The Ergo Support System: An Integrated Set of Tools for Prototyping
- Single Axioms in the Implicational Propositional Frank Pfenning
- Proof Transformations in Higher-Order Logic
- Analytic and Non-analytic Proofs Frank Pfenning
- A Proof-Carrying File System Deepak Garg
- Proof Theory for Authorization Logic and Its Application to a Practical File System
- Bibliography on Logical Frameworks Frank Pfenning
- Proof-Carrying Code in a Session-Typed Process Calculus
- Functions as Session-Typed Processes Bernardo Toninho1,2
- Invited talk at TLDI'12 Towards Concurrent Type Theory
- Teaching Imperative Programming With Contracts at the Freshmen Level
- Termination in Session-Based Concurrency via Linear Logical Relations (Extended Version)
- Bottom-Up Logic Programming for Multicores Flavio Cruz, Michael P. Ashley-Rollman, Seth Copen Goldstein, Ricardo Rocha, Frank Pfenning
- Under consideration for publication in Math. Struct. in Comp. Science Linear Logic Propositions as Session Types