World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
70
Citations
17811
World Ranking
1888
National Ranking
959

Research.com Recognitions

  • 2015 - ACM Fellow For contributions to the logical foundations of automatic theorem proving and types for programming languages.
  • 2007 - ACM Senior Member

Overview

Frank Pfenning is affiliated with Carnegie Mellon University in the United States. Their research primarily spans the field of Computer Science, with significant contributions to Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications, Hardware and Architecture, and Software.

The main focus of their scientific work lies in logic, programming, and type systems, with extensive involvement in formal methods in verification. Additional research topics include logic, reasoning, and knowledge, distributed systems and fault tolerance, parallel computing and optimization techniques, model-driven software engineering techniques, and semantic web and ontologies.

Frequent coauthors in their research collaborations include Ankush Das, Henry DeYoung, Andreia Mordido, Klaas Pruiksma, and Zhibo Chen.

Frank Pfenning's recent publications include:

  • Circular Proofs as Session-Typed Processes: A Local Validity Condition, 2022, Logical Methods in Computer Science
  • A message-passing interpretation of adjoint logic, 2020, Journal of Logical and Algebraic Methods in Programming
  • Semi-Axiomatic Sequent Calculus, 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Session-typed concurrent contracts, 2021, Journal of Logical and Algebraic Methods in Programming
  • Rast: Resource-Aware Session Types with Arithmetic Refinements (System Description), 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Frequent venues where Frank Pfenning has published include:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Zenodo (CERN European Organization for Nuclear Research)
  • Logical Methods in Computer Science
  • Journal of Logical and Algebraic Methods in Programming

Frank Pfenning's contributions have been recognized through awards such as the ACM Fellow in 2015 for contributions to the logical foundations of automatic theorem proving and types for programming languages, and ACM Senior Member status awarded in 2007.

Best Publications

  • Higher-order abstract syntax

    F. Pfenning;C. Elliott

  • Uniform proofs as a foundation for logic programming

    D. Miller;G. Nadathur;F. Pfenning;A. Scedrov

  • System description : Twelf : A meta-logical framework for deductive systems

    F. Pfenning;C. Schürmann

  • Dependent types in practical programming

    Hongwei Xi;Frank Pfenning

  • A modal analysis of staged computation

    Rowan Davies;Frank Pfenning

  • Refinement types for ML

    Tim Freeman;Frank Pfenning

  • A judgmental reconstruction of modal logic

    Frank Pfenning;Rowan Davies

  • Session types as intuitionistic linear propositions

    Luís Caires;Frank Pfenning

  • A linear logical framework

    Iliano Cervesato;Frank Pfenning

  • Eliminating array bound checking through dependent types

    Hongwei Xi;Frank Pfenning

  • Contextual modal type theory

    Aleksandar Nanevski;Frank Pfenning;Brigitte Pientka

  • Logic programming in the LF logical framework

    Frank Pfenning

  • Logic Programming and Automated Reasoning

    Frank Pfenning

  • Logical Frameworks

    Unknown

  • Structural cut elimination

    Frank Pfenning

  • A concurrent logical framework I: Judgments and properties

    Kevin Watkins;Iliano Cervesato;Frank Pfenning;David Walker

  • Logical frameworks

    Frank Pfenning

  • Elf: a language for logic definition and verified metaprogramming

    F. Pfenning

  • Types in Logic Programming

    Frank Pfenning

  • Unification and anti-unification in the calculus of constructions

    F. Pfenning

  • A probabilistic language based upon sampling functions

    Sungwoo Park;Frank Pfenning;Sebastian Thrun

Frequent Co-Authors

Robert Harper
Robert Harper Carnegie Mellon University
Peter Lee
Peter Lee Carnegie Mellon University
David Walker
David Walker Princeton University
Michael K. Reiter
Michael K. Reiter Duke University
Lujo Bauer
Lujo Bauer Carnegie Mellon University
Dale Miller
Dale Miller French Institute for Research in Computer Science and Automation - INRIA
Sebastian Thrun
Sebastian Thrun Stanford University
Seth Copen Goldstein
Seth Copen Goldstein Carnegie Mellon University
Olivier Danvy
Olivier Danvy National University of Singapore
Yannis Smaragdakis
Yannis Smaragdakis National and Kapodistrian University of Athens

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens up a range of diverse online degree options and future careers. If you’re looking to align your studies with emerging job markets, consider reviewing the best degrees for the future. These majors offer strong career prospects and long-term stability.

For those seeking a smoother academic path, some programs are known as easy masters degrees. These online master’s degrees focus on flexibility and manageable coursework, making them more accessible for busy professionals or career changers.

Affordability is another essential factor to consider. Fortunately, there are high-quality options among the cheapest phd programs online, helping students earn an advanced credential without excessive debt.

If you’re interested in educational leadership or academic careers, you can also explore online edd programs. Some fast-track EdD programs allow graduates to earn their degree in less time, accelerating their entry into academia or leadership roles.

Best Scientists Citing Frank Pfenning

Trending Scientists

Recently Published Articles