default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrank Pfenning
Person information
- affiliation: Carnegie Mellon University, Pittsburgh, PA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j43]Henry DeYoung
, Andreia Mordido, Frank Pfenning, Ankush Das:
Parametric Subtyping for Structural Parametric Polymorphism. Proc. ACM Program. Lang. 8(POPL): 2700-2730 (2024)- [c138]Adrian Francalanza, Gerard Tabone, Frank Pfenning:
Implementing a Message-Passing Interpretation of the Semi-Axiomatic Sequent Calculus (Sax). COORDINATION 2024: 295-313 - [c137]Junyoung Jang, Sophia Roshal, Frank Pfenning, Brigitte Pientka:
Adjoint Natural Deduction. FSCD 2024: 15:1-15:23 - [i23]Junyoung Jang, Sophia Roshal, Frank Pfenning, Brigitte Pientka:
Adjoint Natural Deduction (Extended Version). CoRR abs/2402.01428 (2024) - 2023
- [c136]Frank Pfenning, Klaas Pruiksma:
Relating Message Passing and Shared Memory, Proof-Theoretically. COORDINATION 2023: 3-27 - [c135]Zhibo Chen, Frank Pfenning:
A Logical Framework with Higher-Order Rational (Circular) Terms. FoSSaCS 2023: 68-88 - [c134]Luiz De Sá, Bernardo Toninho, Frank Pfenning:
Intuitionistic Metric Temporal Logic. PPDP 2023: 9:1-9:13 - [c133]Siva Somayyajula, Frank Pfenning:
Dependent Type Refinements for Futures. MFPS 2023 - [i22]Henry DeYoung, Andreia Mordido, Frank Pfenning, Ankush Das:
Parametric Subtyping for Structural Parametric Polymorphism. CoRR abs/2307.13661 (2023) - [i21]Zhibo Chen, Frank Pfenning:
A Saturation-Based Unification Algorithm for Higher-Order Rational Patterns. CoRR abs/2312.07263 (2023) - 2022
- [j42]Klaas Pruiksma, Frank Pfenning:
Back to futures. J. Funct. Program. 32: e6 (2022) - [j41]Hannah Gommerstadt, Limin Jia, Frank Pfenning:
Session-typed concurrent contracts. J. Log. Algebraic Methods Program. 124: 100731 (2022) - [j40]Ankush Das, Frank Pfenning:
Rast: A Language for Resource-Aware Session Types. Log. Methods Comput. Sci. 18(1) (2022) - [j39]Farzaneh Derakhshan, Frank Pfenning:
Circular Proofs as Session-Typed Processes: A Local Validity Condition. Log. Methods Comput. Sci. 18(2) (2022) - [j38]Ankush Das, Henry DeYoung, Andreia Mordido, Frank Pfenning:
Nested Session Types. ACM Trans. Program. Lang. Syst. 44(3): 19:1-19:45 (2022) - [c132]Zeeshan Lakhani, Ankush Das, Henry DeYoung, Andreia Mordido, Frank Pfenning:
Polarized Subtyping. ESOP 2022: 431-461 - [c131]Siva Somayyajula, Frank Pfenning:
Type-Based Termination for Futures. FSCD 2022: 12:1-12:21 - [c130]Henry DeYoung, Frank Pfenning:
Data Layout from a Type-Theoretic Perspective (extended version). MFPS 2022 - [i20]Zeeshan Lakhani, Ankush Das, Henry DeYoung, Andreia Mordido, Frank Pfenning:
Polarized Subtyping. CoRR abs/2201.10998 (2022) - [i19]Zhibo Chen, Frank Pfenning:
A Logical Framework with Higher-Order Rational (Circular) Terms. CoRR abs/2210.06663 (2022) - 2021
- [j37]Klaas Pruiksma, Frank Pfenning:
A message-passing interpretation of adjoint logic. J. Log. Algebraic Methods Program. 120: 100637 (2021) - [c129]Chuta Sano, Stephanie Balzer, Frank Pfenning:
Manifestly Phased Communication via Shared Session Types. COORDINATION 2021: 23-40 - [c128]Ankush Das, Stephanie Balzer, Jan Hoffmann, Frank Pfenning, Ishani Santurkar:
Resource-Aware Session Types for Digital Contracts. CSF 2021: 1-16 - [c127]Ankush Das, Henry DeYoung, Andreia Mordido, Frank Pfenning:
Nested Session Types. ESOP 2021: 178-206 - [c126]Bernardo Toninho, Luís Caires, Frank Pfenning:
A Decade of Dependent Session Types. PPDP 2021: 3:1-3:3 - [i18]Chuta Sano, Stephanie Balzer, Frank Pfenning:
Manifestly Phased Communication via Shared Session Types. CoRR abs/2101.06249 (2021) - [i17]Ankush Das, Henry DeYoung, Andreia Mordido, Frank Pfenning:
Subtyping on Nested Polymorphic Session Types. CoRR abs/2103.15193 (2021) - [i16]Siva Somayyajula, Frank Pfenning:
Circular Proofs as Processes: Type-Based Termination via Arithmetic Refinements. CoRR abs/2105.06024 (2021) - 2020
- [c125]Ankush Das, Frank Pfenning:
Session Types with Arithmetic Refinements. CONCUR 2020: 13:1-13:18 - [c124]Henry DeYoung, Frank Pfenning, Klaas Pruiksma:
Semi-Axiomatic Sequent Calculus. FSCD 2020: 29:1-29:22 - [c123]Ankush Das, Frank Pfenning:
Rast: Resource-Aware Session Types with Arithmetic Refinements (System Description). FSCD 2020: 33:1-33:17 - [c122]Ankush Das, Frank Pfenning:
Verified Linear Session-Typed Concurrent Programming. PPDP 2020: 7:1-7:15 - [i15]Ankush Das, Frank Pfenning:
Session Types with Arithmetic Refinements and Their Application to Work Analysis. CoRR abs/2001.04439 (2020) - [i14]Farzaneh Derakhshan, Frank Pfenning:
Circular Proofs in First-Order Linear Logic with Least and Greatest Fixed Points. CoRR abs/2001.05132 (2020) - [i13]Klaas Pruiksma, Frank Pfenning:
Back to Futures. CoRR abs/2002.04607 (2020) - [i12]Ankush Das, Frank Pfenning:
Session Types with Arithmetic Refinements. CoRR abs/2005.05970 (2020) - [i11]Ankush Das, Henry DeYoung, Andreia Mordido, Frank Pfenning:
Nested Session Types. CoRR abs/2010.06482 (2020) - [i10]Ankush Das, Frank Pfenning:
Rast: A Language for Resource-Aware Session Types. CoRR abs/2012.13129 (2020)
2010 – 2019
- 2019
- [c121]Luís Caires, Jorge A. Pérez, Frank Pfenning, Bernardo Toninho:
Domain-Aware Session Types. CONCUR 2019: 39:1-39:17 - [c120]Stephanie Balzer, Bernardo Toninho, Frank Pfenning:
Manifest Deadlock-Freedom for Shared Session Types. ESOP 2019: 611-639 - [c119]Klaas Pruiksma, Frank Pfenning:
A Message-Passing Interpretation of Adjoint Logic. PLACES@ETAPS 2019: 60-79 - [i9]Ankush Das, Stephanie Balzer, Jan Hoffmann, Frank Pfenning:
Resource-Aware Session Types for Digital Contracts. CoRR abs/1902.06056 (2019) - [i8]Luís Caires, Jorge A. Pérez, Frank Pfenning, Bernardo Toninho:
Domain-Aware Session Types (Extended Version). CoRR abs/1907.01318 (2019) - [i7]Farzaneh Derakhshan, Frank Pfenning:
Circular Proofs as Session-Typed Processes: A Local Validity Condition. CoRR abs/1908.01909 (2019) - 2018
- [j36]Ankush Das, Jan Hoffmann, Frank Pfenning:
Parallel complexity analysis with temporal session types. Proc. ACM Program. Lang. 2(ICFP): 91:1-91:30 (2018) - [c118]Stephanie Balzer, Frank Pfenning, Bernardo Toninho:
A Universal Session Type for Untyped Asynchronous Communication. CONCUR 2018: 30:1-30:18 - [c117]Hannah Gommerstadt, Limin Jia, Frank Pfenning:
Session-Typed Concurrent Contracts. ESOP 2018: 771-798 - [c116]Ankush Das, Jan Hoffmann, Frank Pfenning:
Work Analysis with Resource-Aware Session Types. LICS 2018: 305-314 - [i6]Ankush Das, Jan Hoffmann, Frank Pfenning:
Parallel Complexity Analysis with Temporal Session Types. CoRR abs/1804.06013 (2018) - 2017
- [j35]Stephanie Balzer, Frank Pfenning:
Manifest sharing with session types. Proc. ACM Program. Lang. 1(ICFP): 37:1-37:29 (2017) - [i5]Ankush Das, Jan Hoffmann, Frank Pfenning:
Work Analysis with Resource-Aware Session Types. CoRR abs/1712.08310 (2017) - 2016
- [j34]Luís Caires, Frank Pfenning, Bernardo Toninho:
Linear logic propositions as session types. Math. Struct. Comput. Sci. 26(3): 367-423 (2016) - [c115]Henry DeYoung, Frank Pfenning:
Substructural Proofs as Automata. APLAS 2016: 3-22 - [c114]Limin Jia, Hannah Gommerstadt, Frank Pfenning:
Monitors and blame assignment for higher-order session types. POPL 2016: 582-594 - [c113]Cosku Acay, Frank Pfenning:
Intersections and Unions of Session Types. ITRS 2016: 4-19 - [c112]Miguel E. P. Silva, Mário Florido, Frank Pfenning:
Non-Blocking Concurrent Imperative Programming with Session Types. LINEARITY 2016: 64-72 - [c111]Max Willsey, Rokhini Prabhu, Frank Pfenning:
Design and Implementation of Concurrent C0. LINEARITY 2016: 73-82 - 2015
- [c110]Stephanie Balzer, Frank Pfenning:
Objects as session-typed processes. AGERE!@SPLASH 2015: 13-24 - [c109]Frank Pfenning, Dennis Griffith:
Polarized Substructural Session Types. FoSSaCS 2015: 3-22 - [i4]Frank Pfenning:
Proof theory and its role in programming language research. PLMW@POPL 2015: 4:1 - 2014
- [j33]Jorge A. Pérez, Luís Caires, Frank Pfenning, Bernardo Toninho:
Linear logical relations and observational equivalences for session-based concurrency. Inf. Comput. 239: 254-302 (2014) - [j32]Frank Pfenning:
Programming with Higher-Order Logic, by Dale Miller and Gopalan Nadathur, Cambridge University Press, 2012, Hardcover, ISBN-10: 052187940X, xiv + 306 pp. Theory Pract. Log. Program. 14(2): 265-267 (2014) - [j31]Flávio Cruz, Ricardo Rocha, Seth Copen Goldstein, Frank Pfenning:
A Linear Logic Programming Language for Concurrent Programming over Graph Structures. Theory Pract. Log. Program. 14(4-5): 493-507 (2014) - [c108]Bernardo Toninho, Luís Caires, Frank Pfenning:
Corecursion and Non-divergence in Session-Typed Processes. TGC 2014: 159-175 - [i3]Flávio Cruz, Ricardo Rocha, Seth Copen Goldstein, Frank Pfenning:
A Linear Logic Programming Language for Concurrent Programming over Graph Structures. CoRR abs/1405.3556 (2014) - 2013
- [c107]Luís Caires, Jorge A. Pérez, Frank Pfenning, Bernardo Toninho:
Behavioral Polymorphism and Parametricity in Session-Based Communication. ESOP 2013: 330-349 - [c106]Bernardo Toninho, Luís Caires, Frank Pfenning:
Higher-Order Processes, Functions, and Sessions: A Monadic Integration. ESOP 2013: 350-369 - [e8]Frank Pfenning:
Foundations of Software Science and Computation Structures - 16th International Conference, FOSSACS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings. Lecture Notes in Computer Science 7794, Springer 2013, ISBN 978-3-642-37074-8 [contents] - 2012
- [j30]Deepak Garg, Frank Pfenning:
Stateful authorization logic - Proof theory and a case study. J. Comput. Secur. 20(4): 353-391 (2012) - [c105]Henry DeYoung, Luís Caires, Frank Pfenning, Bernardo Toninho:
Cut Reduction in Linear Logic as Asynchronous Session-Typed Communication. CSL 2012: 228-242 - [c104]Jorge A. Pérez, Luís Caires, Frank Pfenning, Bernardo Toninho:
Linear Logical Relations for Session-Based Concurrency. ESOP 2012: 539-558 - [c103]Bernardo Toninho, Luís Caires, Frank Pfenning:
Functions as Session-Typed Processes. FoSSaCS 2012: 346-360 - [c102]Luís Caires, Frank Pfenning, Bernardo Toninho:
Towards concurrent type theory. TLDI 2012: 1-12 - 2011
- [j29]Robert J. Simmons, Frank Pfenning:
Logical approximation for program analysis. High. Order Symb. Comput. 24(1-2): 41-80 (2011) - [c101]Frank Pfenning, Luís Caires, Bernardo Toninho:
Proof-Carrying Code in a Session-Typed Process Calculus. CPP 2011: 21-36 - [c100]Bernardo Toninho, Luís Caires, Frank Pfenning:
Dependent session types via intuitionistic linear type theory. PPDP 2011: 161-172 - [c99]Jamie Morgenstern, Deepak Garg, Frank Pfenning:
A Proof-Carrying File System with Revocable and Use-Once Certificates. STM 2011: 40-55 - 2010
- [j28]William Lovas, Frank Pfenning:
Refinement Types for Logical Frameworks and Their Interpretation as Proof Irrelevance. Log. Methods Comput. Sci. 6(4) (2010) - [c98]Luís Caires, Frank Pfenning:
Session Types as Intuitionistic Linear Propositions. CONCUR 2010: 222-236 - [c97]Frank Pfenning:
Possession as Linear Knowledge. LAM@LICS 2010: 1 - [c96]Deepak Garg, Frank Pfenning:
A Proof-Carrying File System. IEEE Symposium on Security and Privacy 2010: 349-364 - [c95]Deepak Garg, Frank Pfenning:
Stateful Authorization Logic: - Proof Theory and a Case Study. STM 2010: 210-225
2000 – 2009
- 2009
- [c94]Sean McLaughlin, Frank Pfenning:
Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method. CADE 2009: 230-244 - [c93]Frank Pfenning, Robert J. Simmons:
Substructural Operational Semantics as Ordered Logic Programming. LICS 2009: 101-110 - [c92]Robert J. Simmons, Frank Pfenning:
Linear logical approximations. PEPM 2009: 9-20 - [c91]William Lovas, Frank Pfenning:
Refinement Types as Proof Irrelevance. TLCA 2009: 157-171 - 2008
- [j27]Kaustuv Chaudhuri, Frank Pfenning, Greg Price:
A Logical Characterization of Forward and Backward Chaining in the Inverse Method. J. Autom. Reason. 40(2-3): 133-177 (2008) - [j26]Aleksandar Nanevski, Frank Pfenning, Brigitte Pientka:
Contextual modal type theory. ACM Trans. Comput. Log. 9(3): 23:1-23:49 (2008) - [j25]Sungwoo Park, Frank Pfenning, Sebastian Thrun:
A probabilistic language based on sampling functions. ACM Trans. Program. Lang. Syst. 31(1): 4:1-4:46 (2008) - [c90]Henry DeYoung, Deepak Garg, Frank Pfenning:
An Authorization Logic With Explicit Time. CSF 2008: 133-145 - [c89]Robert J. Simmons, Frank Pfenning:
Linear Logical Algorithms. ICALP (2) 2008: 336-347 - [c88]Sean McLaughlin, Frank Pfenning:
Imogen: Focusing the Polarized Inverse Method for Intuitionistic Propositional Logic. LPAR 2008: 174-181 - 2007
- [c87]Frank Pfenning:
Subtyping and intersection types revisited. ICFP 2007: 219 - [c86]Uluc Saranli, Frank Pfenning:
Using Constrained Intuitionistic Linear Logic for Hybrid Robotic Planning Problems. ICRA 2007: 3705-3710 - [c85]Kevin D. Bowers, Lujo Bauer, Deepak Garg, Frank Pfenning, Michael K. Reiter:
Consumable Credentials in Linear-Logic-Based Access-Control Systems. NDSS 2007 - [c84]Frank Pfenning:
On a Logical Foundation for Explicit Substitutions. RTA 2007: 19 - [c83]Frank Pfenning:
On a Logical Foundation for Explicit Substitutions. TLCA 2007: 1 - [c82]Jason Reed, Frank Pfenning:
Intuitionistic Letcc via Labelled Deduction. M4M 2007: 91-111 - [c81]William Lovas, Frank Pfenning:
A Bidirectional Refinement Type System for LF. LFMTP@CADE 2007: 113-128 - [e7]Frank Pfenning:
Automated Deduction - CADE-21, 21st International Conference on Automated Deduction, Bremen, Germany, July 17-20, 2007, Proceedings. Lecture Notes in Computer Science 4603, Springer 2007, ISBN 978-3-540-73594-6 [contents] - 2006
- [c80]Kaustuv Chaudhuri, Frank Pfenning, Greg Price:
A Logical Characterization of Forward and Backward Chaining in the Inverse Method. IJCAR 2006: 97-111 - [c79]Deepak Garg, Frank Pfenning:
Non-Interference in Constructive Authorization Logic. CSFW 2006: 283-296 - [c78]Deepak Garg, Lujo Bauer, Kevin D. Bowers, Frank Pfenning, Michael K. Reiter:
A Linear Logic of Authorization and Knowledge. ESORICS 2006: 297-312 - [e6]Frank Pfenning:
Term Rewriting and Applications, 17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings. Lecture Notes in Computer Science 4098, Springer 2006, ISBN 3-540-36834-5 [contents] - 2005
- [j24]Karl Crary, Aleksey Kliger, Frank Pfenning:
A monadic analysis of information flow security with mutable state. J. Funct. Program. 15(2): 249-291 (2005) - [j23]Aleksandar Nanevski, Frank Pfenning:
Staged computation with names and necessity. J. Funct. Program. 15(5): 893-939 (2005) - [j22]Robert Harper, Frank Pfenning:
On equivalence and canonical forms in the LF type theory. ACM Trans. Comput. Log. 6(1): 61-101 (2005) - [c77]Kaustuv Chaudhuri, Frank Pfenning:
A Focusing Inverse Method Theorem Prover for First-Order Linear Logic. CADE 2005: 69-83 - [c76]Deepak Garg, Frank Pfenning:
Type-Directed Concurrency. CONCUR 2005: 6-20 - [c75]Kaustuv Chaudhuri, Frank Pfenning:
Focusing the Inverse Method for Linear Logic. CSL 2005: 200-215 - [c74]Frank Pfenning:
Towards a type theory of contexts. MERLIN 2005: 1 - [c73]Sungwoo Park, Frank Pfenning, Sebastian Thrun:
A probabilistic language based upon sampling functions. POPL 2005: 171-182 - [c72]Pablo López, Frank Pfenning, Jeff Polakow, Kevin Watkins:
Monadic concurrent linear logic programming. PPDP 2005: 35-46 - 2004
- [j21]Peter B. Andrews, Chad E. Brown, Frank Pfenning, Matthew Bishop, Sunil Issar, Hongwei Xi:
ETPS: A System to Help Students Write Formal Proofs. J. Autom. Reason. 32(1): 75-92 (2004) - [c71]Frank Pfenning:
Substructural Operational Semantics and Linear Destination-Passing Style (Invited Talk). APLAS 2004: 196 - [c70]Tom Murphy VII, Karl Crary, Robert Harper, Frank Pfenning:
A Symmetric Modal Lambda Calculus for Distributed Computing. LICS 2004: 286-295 - [c69]Jana Dunfield, Frank Pfenning:
Tridirectional typechecking. POPL 2004: 281-292 - [c68]Penny Anderson, Frank Pfenning:
Verifying Uniqueness in a Logical Framework. TPHOLs 2004: 18-33 - [c67]Kevin Watkins, Iliano Cervesato, Frank Pfenning, David Walker:
Specifying Properties of Concurrent Computations in CLF. LFM@IJCAR 2004: 67-87 - 2003
- [j20]Iliano Cervesato, Frank Pfenning:
A Linear Spine Calculus. J. Log. Comput. 13(5): 639-688 (2003) - [j19]Christopher Colby, Karl Crary, Robert Harper, Peter Lee, Frank Pfenning:
Automated techniques for provably safe mobile code. Theor. Comput. Sci. 290(2): 1175-1199 (2003) - [j18]Alberto Momigliano, Frank Pfenning:
Higher-order pattern complement and the strict lambda-calculus. ACM Trans. Comput. Log. 4(4): 493-529 (2003) - [c66]Brigitte Pientka, Frank Pfenning:
Optimizing Higher-Order Pattern Unification. CADE 2003: 473-487 - [c65]Jana Dunfield, Frank Pfenning:
Type Assignment for Intersections and Unions in Call-by-Value Languages. FoSSaCS 2003: 250-266 - [c64]Aleksandar Nanevski, Brigitte Pientka, Frank Pfenning:
A modal foundation for meta-variables. MERLIN 2003 - [c63]Sebastian Thrun, Geoffrey J. Gordon, Frank Pfenning, Mary Berna, Brennan Sellner, Brad Lisien:
A Learning Algorithm for Localizing People Based on Wireless Signal Strength that Uses Labeled and Unlabeled Data. IJCAI 2003: 1427-1428 - [c62]Leaf Petersen, Robert Harper, Karl Crary, Frank Pfenning:
A type theory for memory allocation and data layout. POPL 2003: 172-184 - [c61]Carsten Schürmann, Frank Pfenning:
A Coverage Checking Algorithm for LF.