( en | de | ru )

 

Disambiguation of "Pfenning, Frank"

Author of the publication

copydeleteadd this publication to your clipboard
Circular Proofs as Processes: Type-Based Termination via Arithmetic Refinements.

, and . CoRR, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Andreas Pfenning

Ruthard Pfenning

Carolin Pfenning

Edith Pfenning

Astrid Pfenning

 

Other publications of authors with the same name

Using Constrained Intuitionistic Linear Logic for Hybrid Robotic Planning Problems., and . ICRA, page 3705-3710. IEEE, (2007)A monadic analysis of information flow security with mutable state., , and . J. Funct. Program., 15 (2): 249-291 (2005)On the Unification Problem for Cartesian Closed Categories., , and . J. Symb. Log., 62 (2): 636-647 (1997)Verified Linear Session-Typed Concurrent Programming., and . PPDP, page 7:1-7:15. ACM, (2020)Automated techniques for provably safe mobile code., , , , and . Theor. Comput. Sci., 290 (2): 1175-1199 (2003)A Logical Framework with Higher-Order Rational (Circular) Terms., and . CoRR, (2022)The Practice of Logical Frameworks.. CAAP, volume 1059 of Lecture Notes in Computer Science, page 119-134. Springer, (1996)On a Logical Foundation for Explicit Substitutions.. TLCA, volume 4583 of Lecture Notes in Computer Science, page 1. Springer, (2007)Type-Directed Concurrency., and . CONCUR, volume 3653 of Lecture Notes in Computer Science, page 6-20. Springer, (2005)Session Types as Intuitionistic Linear Propositions., and . CONCUR, volume 6269 of Lecture Notes in Computer Science, page 222-236. Springer, (2010)