Analytic and Non-analytic Proofs. - Frank Pfenning (CADE, 1984)

The TPS Theorem Proving System. - Peter B. Andrews; Frank Pfenning; Sunil Issar; Carl P. Klapper (CADE, 1986)

Single Axioms in the Implicational Propositional Calculus. - Frank Pfenning (CADE, 1988)

Partial Polymorphic Type Inference and Higher-Order Unification. - Frank Pfenning (LISP and Functional Programming, 1988)

Higher-Order Abstract Syntax. - Frank Pfenning; Conal Elliott (PLDI, 1988)

The Ergo Support System: An Integrated Set of Tools for Prototyping Integrated Environments. - Peter Lee 001; Frank Pfenning; Gene Rollins; William L. Scherlis (Software Development Environments (SDE), 1988)

The Ergo Attribute System. - Robert L. Nord; Frank Pfenning (Software Development Environments (SDE), 1988)

Elf: A Language for Logic Definition and Verified Metaprogramming - Frank Pfenning (LICS, 1989)

Inductively Defined Types in the Calculus of Constructions. - Frank Pfenning; Christine Paulin-Mohring (Mathematical Foundations of Programming Semantics, 1989)

LEAP: A Language with Eval And Polymorphism. - Frank Pfenning; Peter Lee 001 (TAPSOFT, Vol.2, 1989)

The TPS Theorem Proving System. - Peter B. Andrews; Sunil Issar; Dan Nesmith; Frank Pfenning (CADE, 1990)

Tutorial on Lambda-Prolog. - Amy P. Felty; Elsa L. Gunter; Dale Miller 001; Frank Pfenning (CADE, 1990)

Presenting Intuitive Deductions via Symmetric Simplification. - Frank Pfenning; Dan Nesmith (CADE, 1990)

Types in Logic Programming. - Frank Pfenning (ICLP, 1990)

Natural Semantics and Some of Its Meta-Theory in Elf. - Spiro Michaylov; Frank Pfenning (ELP, 1991)

Unification and Anti-Unification in the Calculus of Constructions - Frank Pfenning (LICS, 1991)

Compiling the Polymorphic Lambda-Calculus. - Spiro Michaylov; Frank Pfenning (PEPM, 1991)

Refinement Types for ML. - Timothy S. Freeman; Frank Pfenning (PLDI, 1991)

A Declarative Alternative to "Assert" in Logic Programming. - Scott Dietzen; Frank Pfenning (ISLP, 1991)

Uniform Proofs as a Foundation for Logic Programming. - Dale Miller 001; Gopalan Nadathur; Frank Pfenning; Andre Scedrov (Ann. Pure Appl. Log., 1991)

Metacircularity in the Polymorphic lambda-Calculus. - Frank Pfenning; Peter Lee 001 (Theor. Comput. Sci., 1991)

The Type System of a Higher-Order Logic Programming Language. - Gopalan Nadathur; Frank Pfenning (Types in Logic Programming, 1992)

Dependent Types in Logic Programming. - Frank Pfenning (Types in Logic Programming, 1992)

Implementing the Meta-Theory of Deductive Systems. - Frank Pfenning; Ekkehard Rohwedder (CADE, 1992)

Compiler Verification in LF - John Hannan; Frank Pfenning (LICS, 1992)

Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization. - Scott Dietzen; Frank Pfenning (Mach. Learn., 1992)

Higher-Order Logic Programming as Constraint Logic Programming. - Spiro Michaylov; Frank Pfenning (PPCP, 1993)

Unification in a Lambda-Calculus with Intersection Types. - Michael Kohlhase; Frank Pfenning (ILPS, 1993)

TPS: An Interactive and Automatic Tool for Proving Theorems of Type Theory. - Peter B. Andrews; Matthew Bishop; Sunil Issar; Dan Nesmith; Frank Pfenning; Hongwei Xi 001 (HUG, 1993)

On the Undecidability of Partial Polymorphic Type Reconstruction. - Frank Pfenning (Fundam. Informaticae, 1993)

Elf: A Meta-Language for Deductive Systems (System Descrition). - Frank Pfenning (CADE, 1994)

Structural Cut Elimination - Frank Pfenning (LICS, 1995)

On a modal lambda calculus for S4. - Frank Pfenning; Hao-Chi Wong (MFPS, 1995)

The Practice of Logical Frameworks. - Frank Pfenning (CAAP, 1996)

Mode and Termination Checking for Higher-Order Logic Programs. - Ekkehard Rohwedder; Frank Pfenning (ESOP, 1996)

Unification via Explicit Substitutions: The Case of Higher-Order Patterns. - Gilles Dowek; Thérèse Hardin; Claude Kirchner; Frank Pfenning (JICSLP, 1996)

TPS: A Theorem-Proving System for Classical Type Theory. - Peter B. Andrews; Matthew Bishop; Sunil Issar; Dan Nesmith; Frank Pfenning; Hongwei Xi 001 (J. Autom. Reason., 1996)

Linear Higher-Order Pre-Unification. - Iliano Cervesato; Frank Pfenning (LICS, 1997)

On the Unification Problem for Cartesian Closed Categories. - Paliath Narendran; Frank Pfenning; Richard Statman (J. Symb. Log., 1997)

Reasoning About Deductions in Linear Logic (Abstract of Invited Talk). - Frank Pfenning (CADE, 1998)

Automated Theorem Proving in a Simple Meta-Logic for LF. - Carsten Schürmann; Frank Pfenning (CADE, 1998)

Run-time Code Generation and Modal-ML. - Philip Wickline; Peter Lee 001; Frank Pfenning (PLDI, 1998)

Eliminating Array Bound Checking Through Dependent Types. - Hongwei Xi 001; Frank Pfenning (PLDI, 1998)

Modal Types as Staging Specifications for Run-Time Code Generation. - Philip Wickline; Peter Lee 001; Frank Pfenning; Rowan Davies (ACM Comput. Surv., 1998)

Algorithms for Equality and Unification in the Presence of Notational Definitions. - Frank Pfenning; Carsten Schürmann (Proof Search in Type-Theoretic Languages@CADE, 1998)

A Module System for a Programming Language Based on the LF Logical Framework. - Robert Harper 001; Frank Pfenning (J. Log. Comput., 1998)

Note by the Guest Editors. - Wilfried Sieg; Frank Pfenning (Stud Logica, 1998)

System Description: Twelf - A Meta-Logical Framework for Deductive Systems. - Frank Pfenning; Carsten Schürmann (CADE, 1999)

The Relative Complement Problem for Higher-Order Patterns. - Alberto Momigliano; Frank Pfenning (ICLP, 1999)

Dependent Types in Practical Programming. - Hongwei Xi 001; Frank Pfenning (POPL, 1999)

Logical and Meta-Logical Frameworks (Abstract). - Frank Pfenning (PPDP, 1999)

Natural Deduction for Intuitionistic Non-communicative Linear Logic. - Jeff Polakow; Frank Pfenning (TLCA, 1999)

On proving syntactic properties of CPS programs. - Olivier Danvy; Belmina Dzafic; Frank Pfenning (HOOTS, 1999)

Relating Natural Deduction and Sequent Calculus for Intuitionistic Non-Commutative Linear Logic. - J. Polokow; Frank Pfenning (MFPS, 1999)

Intersection types and computational effects. - Rowan Davies; Frank Pfenning (ICFP, 2000)

On the Logical Foundations of Staged Computation (Abstract of Invited Talk). - Frank Pfenning (PEPM, 2000)

Reasoning about Staged Computation. - Frank Pfenning (SAIG, 2000)

Editorial: Strategies in Automated Deduction. - Bernhard Gramlich; Hélène Kirchner; Frank Pfenning (Ann. Math. Artif. Intell., 2000)

Structural Cut Elimination: I. Intuitionistic and Classical Logic. - Frank Pfenning (Inf. Comput., 2000)

Efficient resource management for linear logic proof search. - Iliano Cervesato; Joshua S. Hodas; Frank Pfenning (Theor. Comput. Sci., 2000)

Logical Frameworks. - Frank Pfenning (Handbook of Automated Reasoning, 2001)

Intensionality, Extensionality, and Proof Irrelevance in Modal Type Theory. - Frank Pfenning (LICS, 2001)

A modal analysis of staged computation. - Rowan Davies; Frank Pfenning (J. ACM, 2001)

A judgmental reconstruction of modal logic. - Frank Pfenning; Rowan Davies (Math. Struct. Comput. Sci., 2001)

Primitive recursion for higher-order abstract syntax. - Carsten Schürmann; Joëlle Despeyroux; Frank Pfenning (Theor. Comput. Sci., 2001)

Trustless Grid Computing in ConCert. - Bor-Yuh Evan Chang; Karl Crary; Margaret DeLap; Robert Harper 001; Jason Liszka; Tom Murphy VII; Frank Pfenning (GRID, 2002)

Preface. - Frank Pfenning (LFM, 2002)

Invited talk: Tri-Directional Type Checking. - Frank Pfenning (ITRS, 2002)

A Linear Logical Framework. - Iliano Cervesato; Frank Pfenning (Inf. Comput., 2002)

Editorial. - Martín Abadi; Leonid Libkin; Frank Pfenning (ACM Trans. Comput. Log., 2002)

Optimizing Higher-Order Pattern Unification. - Brigitte Pientka; Frank Pfenning (CADE, 2003)

Type Assignment for Intersections and Unions in Call-by-Value Languages. - Jana Dunfield; Frank Pfenning (FoSSaCS, 2003)

A modal foundation for meta-variables. - Aleksandar Nanevski; Brigitte Pientka; Frank Pfenning (MERLIN, 2003)

A Learning Algorithm for Localizing People Based on Wireless Signal Strength that Uses Labeled and Unlabeled Data. - Sebastian Thrun; Geoffrey J. Gordon; Frank Pfenning; Mary Berna; Brennan Sellner; Brad Lisien (IJCAI, 2003)

A type theory for memory allocation and data layout. - Leaf Petersen; Robert Harper 001; Karl Crary; Frank Pfenning (POPL, 2003)

A Coverage Checking Algorithm for LF. - Carsten Schürmann; Frank Pfenning (TPHOLs, 2003)

A Concurrent Logical Framework: The Propositional Fragment. - Kevin Watkins; Iliano Cervesato; Frank Pfenning; David Walker 001 (TYPES, 2003)

A Linear Spine Calculus. - Iliano Cervesato; Frank Pfenning (J. Log. Comput., 2003)

Automated techniques for provably safe mobile code. - Christopher Colby; Karl Crary; Robert Harper 001; Peter Lee 001; Frank Pfenning (Theor. Comput. Sci., 2003)

Higher-order pattern complement and the strict lambda-calculus. - Alberto Momigliano; Frank Pfenning (ACM Trans. Comput. Log., 2003)

Substructural Operational Semantics and Linear Destination-Passing Style (Invited Talk). - Frank Pfenning (APLAS, 2004)

A Symmetric Modal Lambda Calculus for Distributed Computing. - Tom Murphy VII; Karl Crary; Robert Harper 001; Frank Pfenning (LICS, 2004)

Tridirectional typechecking. - Jana Dunfield; Frank Pfenning (POPL, 2004)

Verifying Uniqueness in a Logical Framework. - Penny Anderson; Frank Pfenning (TPHOLs, 2004)

Specifying Properties of Concurrent Computations in CLF. - Kevin Watkins; Iliano Cervesato; Frank Pfenning; David Walker 001 (LFM@IJCAR, 2004)

ETPS: A System to Help Students Write Formal Proofs. - Peter B. Andrews; Chad E. Brown; Frank Pfenning; Matthew Bishop; Sunil Issar; Hongwei Xi 001 (J. Autom. Reason., 2004)

A Focusing Inverse Method Theorem Prover for First-Order Linear Logic. - Kaustuv Chaudhuri; Frank Pfenning (CADE, 2005)

Type-Directed Concurrency. - Deepak Garg 001; Frank Pfenning (CONCUR, 2005)

Focusing the Inverse Method for Linear Logic. - Kaustuv Chaudhuri; Frank Pfenning (CSL, 2005)

Towards a type theory of contexts. - Frank Pfenning (MERLIN, 2005)

A probabilistic language based upon sampling functions. - Sungwoo Park; Frank Pfenning; Sebastian Thrun (POPL, 2005)

Monadic concurrent linear logic programming. - Pablo López; Frank Pfenning; Jeff Polakow; Kevin Watkins (PPDP, 2005)

A monadic analysis of information flow security with mutable state. - Karl Crary; Aleksey Kliger; Frank Pfenning (J. Funct. Program., 2005)

Staged computation with names and necessity. - Aleksandar Nanevski; Frank Pfenning (J. Funct. Program., 2005)

On equivalence and canonical forms in the LF type theory. - Robert Harper 001; Frank Pfenning (ACM Trans. Comput. Log., 2005)

Non-Interference in Constructive Authorization Logic. - Deepak Garg 001; Frank Pfenning (CSFW, 2006)

A Linear Logic of Authorization and Knowledge. - Deepak Garg 001; Lujo Bauer; Kevin D. Bowers; Frank Pfenning; Michael K. Reiter (ESORICS, 2006)

Subtyping and intersection types revisited. - Frank Pfenning (ICFP, 2007)

Using Constrained Intuitionistic Linear Logic for Hybrid Robotic Planning Problems. - Uluc Saranli; Frank Pfenning (ICRA, 2007)

Consumable Credentials in Linear-Logic-Based Access-Control Systems. - Kevin D. Bowers; Lujo Bauer; Deepak Garg 001; Frank Pfenning; Michael K. Reiter (NDSS, 2007)

On a Logical Foundation for Explicit Substitutions. - Frank Pfenning (TLCA, 2007)

A Bidirectional Refinement Type System for LF. - William Lovas; Frank Pfenning (LFMTP@CADE, 2007)

Intuitionistic Letcc via Labelled Deduction. - Jason Reed 001; Frank Pfenning (M4M, 2007)

An Authorization Logic With Explicit Time. - Henry DeYoung; Deepak Garg 001; Frank Pfenning (CSF, 2008)

Linear Logical Algorithms. - Robert J. Simmons; Frank Pfenning (ICALP (2), 2008)

Imogen: Focusing the Polarized Inverse Method for Intuitionistic Propositional Logic. - Sean McLaughlin; Frank Pfenning (LPAR, 2008)

A Logical Characterization of Forward and Backward Chaining in the Inverse Method. - Kaustuv Chaudhuri; Frank Pfenning; Greg Price (J. Autom. Reason., 2008)

Contextual modal type theory. - Aleksandar Nanevski; Frank Pfenning; Brigitte Pientka (ACM Trans. Comput. Log., 2008)

A probabilistic language based on sampling functions. - Sungwoo Park; Frank Pfenning; Sebastian Thrun (ACM Trans. Program. Lang. Syst., 2008)

Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method. - Sean McLaughlin; Frank Pfenning (CADE, 2009)

Substructural Operational Semantics as Ordered Logic Programming. - Frank Pfenning; Robert J. Simmons (LICS, 2009)

Linear logical approximations. - Robert J. Simmons; Frank Pfenning (PEPM, 2009)

Refinement Types as Proof Irrelevance. - William Lovas; Frank Pfenning (TLCA, 2009)

Session Types as Intuitionistic Linear Propositions. - Luís Caires; Frank Pfenning (CONCUR, 2010)

Possession as Linear Knowledge. - Frank Pfenning (LAM@LICS, 2010)

A Proof-Carrying File System. - Deepak Garg 001; Frank Pfenning (IEEE Symposium on Security and Privacy, 2010)

Refinement Types for Logical Frameworks and Their Interpretation as Proof Irrelevance - William Lovas; Frank Pfenning (Log. Methods Comput. Sci., 2010)

Proof-Carrying Code in a Session-Typed Process Calculus. - Frank Pfenning; Luís Caires; Bernardo Toninho (CPP, 2011)

Dependent session types via intuitionistic linear type theory. - Bernardo Toninho; Luís Caires; Frank Pfenning (PPDP, 2011)

A Proof-Carrying File System with Revocable and Use-Once Certificates. - Jamie Morgenstern; Deepak Garg 001; Frank Pfenning (STM, 2011)

Logical approximation for program analysis. - Robert J. Simmons; Frank Pfenning (High. Order Symb. Comput., 2011)

Cut Reduction in Linear Logic as Asynchronous Session-Typed Communication. - Henry DeYoung; Luís Caires; Frank Pfenning; Bernardo Toninho (CSL, 2012)

Linear Logical Relations for Session-Based Concurrency. - Jorge A. Pérez 001; Luís Caires; Frank Pfenning; Bernardo Toninho (ESOP, 2012)

Functions as Session-Typed Processes. - Bernardo Toninho; Luís Caires; Frank Pfenning (FoSSaCS, 2012)

Towards concurrent type theory. - Luís Caires; Frank Pfenning; Bernardo Toninho (TLDI, 2012)

Stateful authorization logic - Proof theory and a case study. - Deepak Garg 001; Frank Pfenning (J. Comput. Secur., 2012)

Behavioral Polymorphism and Parametricity in Session-Based Communication. - Luís Caires; Jorge A. Pérez 001; Frank Pfenning; Bernardo Toninho (ESOP, 2013)

Higher-Order Processes, Functions, and Sessions: A Monadic Integration. - Bernardo Toninho; Luís Caires; Frank Pfenning (ESOP, 2013)

Corecursion and Non-divergence in Session-Typed Processes. - Bernardo Toninho; Luís Caires; Frank Pfenning (TGC, 2014)

Linear logical relations and observational equivalences for session-based concurrency. - Jorge A. Pérez 001; Luís Caires; Frank Pfenning; Bernardo Toninho (Inf. Comput., 2014)

A Linear Logic Programming Language for Concurrent Programming over Graph Structures. - Flávio Cruz; Ricardo Rocha 001; Seth Copen Goldstein; Frank Pfenning (Theory Pract. Log. Program., 2014)

Programming with Higher-Order Logic, by Dale Miller and Gopalan Nadathur, Cambridge University Press, 2012, Hardcover, ISBN-10: 052187940X, xiv + 306 pp. - Frank Pfenning (Theory Pract. Log. Program., 2014)

Objects as session-typed processes. - Stephanie Balzer; Frank Pfenning (AGERE!@SPLASH, 2015)

Polarized Substructural Session Types. - Frank Pfenning; Dennis Griffith (FoSSaCS, 2015)

Proof theory and its role in programming language research. - Frank Pfenning (PLMW@POPL, 2015)

Substructural Proofs as Automata. - Henry DeYoung; Frank Pfenning (APLAS, 2016)

Monitors and blame assignment for higher-order session types. - Limin Jia 001; Hannah Gommerstadt; Frank Pfenning (POPL, 2016)

Intersections and Unions of Session Types. - Cosku Acay; Frank Pfenning (ITRS, 2016)

Non-Blocking Concurrent Imperative Programming with Session Types. - Miguel E. P. Silva; Mário Florido; Frank Pfenning (LINEARITY, 2016)

Design and Implementation of Concurrent C0. - Max Willsey; Rokhini Prabhu; Frank Pfenning (LINEARITY, 2016)

Linear logic propositions as session types. - Luís Caires; Frank Pfenning; Bernardo Toninho (Math. Struct. Comput. Sci., 2016)

Manifest sharing with session types. - Stephanie Balzer; Frank Pfenning (Proc. ACM Program. Lang., 2017)

A Universal Session Type for Untyped Asynchronous Communication. - Stephanie Balzer; Frank Pfenning; Bernardo Toninho (CONCUR, 2018)

Work Analysis with Resource-Aware Session Types. - Ankush Das; Jan Hoffmann 002; Frank Pfenning (LICS, 2018)

Parallel complexity analysis with temporal session types. - Ankush Das; Jan Hoffmann 002; Frank Pfenning (Proc. ACM Program. Lang., 2018)

Domain-Aware Session Types. - Luís Caires; Jorge A. Pérez 001; Frank Pfenning; Bernardo Toninho (CONCUR, 2019)

Manifest Deadlock-Freedom for Shared Session Types. - Stephanie Balzer; Bernardo Toninho; Frank Pfenning (ESOP, 2019)

Resource-Aware Session Types for Digital Contracts. - Ankush Das; Stephanie Balzer; Jan Hoffmann 002; Frank Pfenning (CoRR, 2019)

Domain-Aware Session Types (Extended Version). - Luís Caires; Jorge A. Pérez 001; Frank Pfenning; Bernardo Toninho (CoRR, 2019)

Session Types with Arithmetic Refinements. - Ankush Das; Frank Pfenning (CONCUR, 2020)

Rast: Resource-Aware Session Types with Arithmetic Refinements (System Description). - Ankush Das; Frank Pfenning (FSCD, 2020)

Semi-Axiomatic Sequent Calculus. - Henry DeYoung; Frank Pfenning; Klaas Pruiksma (FSCD, 2020)

Verified Linear Session-Typed Concurrent Programming. - Ankush Das; Frank Pfenning (PPDP, 2020)

Session Types with Arithmetic Refinements and Their Application to Work Analysis. - Ankush Das; Frank Pfenning (CoRR, 2020)

Circular Proofs in First-Order Linear Logic with Least and Greatest Fixed Points. - Farzaneh Derakhshan; Frank Pfenning (CoRR, 2020)

Manifestly Phased Communication via Shared Session Types. - Chuta Sano; Stephanie Balzer; Frank Pfenning (COORDINATION, 2021)

Resource-Aware Session Types for Digital Contracts. - Ankush Das; Stephanie Balzer; Jan Hoffmann 002; Frank Pfenning; Ishani Santurkar (CSF, 2021)

A Decade of Dependent Session Types. - Bernardo Toninho; Luís Caires; Frank Pfenning (PPDP, 2021)

Subtyping on Nested Polymorphic Session Types. - Ankush Das; Henry DeYoung; Andreia Mordido; Frank Pfenning (CoRR, 2021)

Circular Proofs as Processes: Type-Based Termination via Arithmetic Refinements. - Siva Somayyajula; Frank Pfenning (CoRR, 2021)

A message-passing interpretation of adjoint logic. - Klaas Pruiksma; Frank Pfenning (J. Log. Algebraic Methods Program., 2021)

Polarized Subtyping. - Zeeshan Lakhani; Ankush Das; Henry DeYoung; Andreia Mordido; Frank Pfenning (ESOP, 2022)

Type-Based Termination for Futures. - Siva Somayyajula; Frank Pfenning (FSCD, 2022)

Data Layout from a Type-Theoretic Perspective (extended version). - Henry DeYoung; Frank Pfenning (MFPS, 2022)

Back to futures. - Klaas Pruiksma; Frank Pfenning (J. Funct. Program., 2022)

Session-typed concurrent contracts. - Hannah Gommerstadt; Limin Jia 001; Frank Pfenning (J. Log. Algebraic Methods Program., 2022)

Rast: A Language for Resource-Aware Session Types. - Ankush Das; Frank Pfenning (Log. Methods Comput. Sci., 2022)

Circular Proofs as Session-Typed Processes: A Local Validity Condition. - Farzaneh Derakhshan; Frank Pfenning (Log. Methods Comput. Sci., 2022)

Nested Session Types. - Ankush Das; Henry DeYoung; Andreia Mordido; Frank Pfenning (ACM Trans. Program. Lang. Syst., 2022)

Relating Message Passing and Shared Memory, Proof-Theoretically. - Frank Pfenning; Klaas Pruiksma (COORDINATION, 2023)

A Logical Framework with Higher-Order Rational (Circular) Terms. - Zhibo Chen 009; Frank Pfenning (FoSSaCS, 2023)

Intuitionistic Metric Temporal Logic. - Luiz De Sá; Bernardo Toninho; Frank Pfenning (PPDP, 2023)

Dependent Type Refinements for Futures. - Siva Somayyajula; Frank Pfenning (MFPS, 2023)

Implementing a Message-Passing Interpretation of the Semi-Axiomatic Sequent Calculus (Sax). - Adrian Francalanza; Gerard Tabone; Frank Pfenning (COORDINATION, 2024)

Adjoint Natural Deduction. - Junyoung Jang 001; Sophia Roshal; Frank Pfenning; Brigitte Pientka (FSCD, 2024)

Adjoint Natural Deduction (Extended Version). - Junyoung Jang 001; Sophia Roshal; Frank Pfenning; Brigitte Pientka (CoRR, 2024)

Parametric Subtyping for Structural Parametric Polymorphism. - Henry DeYoung; Andreia Mordido; Frank Pfenning; Ankush Das (Proc. ACM Program. Lang., 2024)

Substructural Parametricity. - C. B. Aberlé; Karl Crary; Chris Martens 001; Frank Pfenning (FSCD, 2025)

A Saturation-Based Unification Algorithm for Higher-Order Rational Patterns. - Zhibo Chen 009; Frank Pfenning (ACM Trans. Comput. Log., 2025)

Substructural Parametricity. - C. B. Aberlé; Chris Martens 001; Frank Pfenning (CoRR, 2025)

Grits: A message-passing programming language based on the semi-axiomatic sequent calculus. - Adrian Francalanza; Gerard Tabone; Frank Pfenning (Sci. Comput. Program., 2026)