- Home
- Top Scientists - Computer Science
- Frank Pfenning

Discipline name
H-index
Citations
Publications
World Ranking
National Ranking

Computer Science
H-index
59
Citations
14,149
188
World Ranking
1610
National Ranking
896

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

2007 - ACM Senior Member

- Programming language
- Artificial intelligence
- Functional programming

The scientist’s investigation covers issues in Programming language, Theoretical computer science, Logic programming, Twelf and Discrete mathematics. Frank Pfenning works in the field of Theoretical computer science, namely Linear logic. His study focuses on the intersection of Linear logic and fields such as Session with connections in the field of Type, Linearity and Concurrency.

His work investigates the relationship between Logic programming and topics such as Logical framework that intersect with problems in Truth table, Logical NOR and Conservative extension. His Natural deduction study which covers Type theory that intersects with Operational semantics. His Horn clause research includes elements of Functional logic programming and Higher-order logic.

- Higher-order abstract syntax (598 citations)
- System Description: Twelf - A Meta-Logical Framework for Deductive Systems (567 citations)
- Uniform proofs as a foundation for logic programming (554 citations)

Frank Pfenning focuses on Programming language, Theoretical computer science, Linear logic, Logic programming and Algorithm. His Theoretical computer science research integrates issues from Modal logic, Session and Concurrency. His Linear logic research incorporates elements of Many-valued logic, Substructural logic, Sequent calculus, Mathematical proof and Intuitionistic logic.

His work deals with themes such as Functional logic programming, Computational logic and Prolog, which intersect with Logic programming. His Algorithm study incorporates themes from Calculus, Natural deduction and Unification. In his research on the topic of Logical framework, Interpretation is strongly related with Type theory.

- Programming language (39.45%)
- Theoretical computer science (29.76%)
- Linear logic (22.15%)

- Session (10.73%)
- Theoretical computer science (29.76%)
- Linear logic (22.15%)

Frank Pfenning mainly investigates Session, Theoretical computer science, Linear logic, Programming language and Concurrency. His research in Session intersects with topics in Type, Message passing and Asynchronous communication. His study in Theoretical computer science is interdisciplinary in nature, drawing from both Soundness, Metatheory and Deadlock.

His Linear logic research integrates issues from Sequent calculus, Mathematical proof, Concurrent computing, Substructural logic and Algorithm. His study in Semantics, Programming paradigm, Operational semantics, Logic programming and Imperative programming is done as part of Programming language. His Concurrency study also includes

- Functional programming that connect with fields like Monad and Type checking,
- Observational equivalence and Syntax most often made with reference to Normalization.

- Higher-Order processes, functions, and sessions: a monadic integration (84 citations)
- Linear Logic Propositions as Session Types (74 citations)
- Computation and Deduction (64 citations)

- Programming language
- Artificial intelligence
- Functional programming

His primary scientific interests are in Theoretical computer science, Session, Linear logic, Concurrency and Programming language. His research integrates issues of Interpretation, Type theory and Correctness in his study of Theoretical computer science. His Session study combines topics in areas such as Modal operator, Type, Resource, Semantics and Asynchronous communication.

The study incorporates disciplines such as Algorithm, Sequent calculus and Deadlock in addition to Linear logic. The Algorithm study which covers Mathematical proof that intersects with Sequent and Usability. Programming language is closely attributed to Boolean function in his work.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Higher-order abstract syntax

F. Pfenning;C. Elliott.

programming language design and implementation **(1988)**

904 Citations

Uniform proofs as a foundation for logic programming

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

Annals of Pure and Applied Logic **(1991)**

860 Citations

System Description: Twelf - A Meta-Logical Framework for Deductive Systems

F. Pfenning;C. Schürmann.

conference on automated deduction **(1999)**

831 Citations

Dependent types in practical programming

Hongwei Xi;Frank Pfenning.

symposium on principles of programming languages **(1999)**

759 Citations

Refinement types for ML

Tim Freeman;Frank Pfenning.

programming language design and implementation **(1991)**

534 Citations

A modal analysis of staged computation

Rowan Davies;Frank Pfenning.

Journal of the ACM **(2001)**

457 Citations

A judgmental reconstruction of modal logic

Frank Pfenning;Rowan Davies.

Mathematical Structures in Computer Science **(2001)**

422 Citations

Session types as intuitionistic linear propositions

Luís Caires;Frank Pfenning.

international conference on concurrency theory **(2010)**

377 Citations

Eliminating array bound checking through dependent types

Hongwei Xi;Frank Pfenning.

programming language design and implementation **(1998)**

375 Citations

Logic programming in the LF logical framework

Frank Pfenning.

Logical frameworks **(1991)**

360 Citations

Profile was last updated on December 6th, 2021.

Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).

The ranking h-index is inferred from publications deemed to belong to the considered discipline.

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

Contact us

Carnegie Mellon University

Carnegie Mellon University

Princeton University

Duke University

French Institute for Research in Computer Science and Automation - INRIA

Carnegie Mellon University

Stanford University

Yale-NUS College

Carnegie Mellon University

University of Pennsylvania

French Institute for Research in Computer Science and Automation - INRIA

Publications: 117

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:

Something went wrong. Please try again later.