H-Index & Metrics Best Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science D-index 60 Citations 14,204 148 World Ranking 1535 National Ranking 858

Research.com Recognitions

Awards & Achievements

2009 - ACM Karl V. Karlstrom Outstanding Educator Award For his visionary and long-term contributions to K-12 outreach programs, innovative textbooks, and pedagogically motivated software.

2006 - ACM Fellow For contributions to programming languages and development environments.

Overview

What is he best known for?

The fields of study he is best known for:

  • Programming language
  • Operating system
  • Object-oriented programming

His primary areas of investigation include Programming language, Theoretical computer science, Control, Typed lambda calculus and Calculus. Matthias Felleisen regularly links together related areas like Proof theory in his Programming language studies. Matthias Felleisen interconnects Object-oriented programming and Semantics in the investigation of issues within Theoretical computer science.

His research in Control intersects with topics in Procedural programming, Denotational semantics, Semantics, Generalization and Program Dependence Graph. The concepts of his Typed lambda calculus study are interwoven with issues in Scripting language and Gradual typing. As part of one scientific family, Matthias Felleisen deals mainly with the area of Calculus, narrowing it down to issues related to the Algorithm, and often Delimited continuation, Continuation-passing style, System programming, First class and Equivalence.

His most cited work include:

  • A Syntactic Approach to Type Soundness (954 citations)
  • The essence of compiling with continuations (437 citations)
  • The revised report on the syntactic theories of sequential control and state (414 citations)

What are the main themes of his work throughout his whole career to date?

The scientist’s investigation covers issues in Programming language, Scheme, Theoretical computer science, Semantics and Functional programming. His study in Soundness, Macro, Third-generation programming language, Second-generation programming language and Debugging is carried out as part of his studies in Programming language. His Scheme research is multidisciplinary, incorporating elements of Debugger, Syntax and Control.

Matthias Felleisen combines subjects such as Program analysis and Typed lambda calculus with his study of Theoretical computer science. His study looks at the relationship between Semantics and fields such as Context, as well as how they intersect with chemical problems. His study in Artificial intelligence extends to Functional programming with its themes.

He most often published in these fields:

  • Programming language (57.87%)
  • Scheme (14.89%)
  • Theoretical computer science (14.04%)

What were the highlights of his more recent work (between 2012-2020)?

  • Programming language (57.87%)
  • Mathematical proof (4.68%)
  • Racket (5.11%)

In recent papers he was focusing on the following fields of study:

Programming language, Mathematical proof, Racket, Gas meter prover and Simple are his primary areas of study. Matthias Felleisen has researched Programming language in several fields, including Code and Type. His Gas meter prover research incorporates elements of Proof assistant and Style.

Matthias Felleisen usually deals with Fourth-generation programming language and limits it to topics linked to Video editing and Fifth-generation programming language and Functional programming. His Functional programming study contributes to a more complete understanding of Theoretical computer science. His studies deal with areas such as Object-oriented programming and Implementation as well as Gradual typing.

Between 2012 and 2020, his most popular works were:

  • Is sound gradual typing dead (62 citations)
  • Transferring Skills at Solving Word Problems from Computing to Algebra Through Bootstrap (48 citations)
  • A programmable programming language (30 citations)

In his most recent research, the most cited papers focused on:

  • Programming language
  • Operating system
  • Object-oriented programming

Matthias Felleisen mainly investigates Programming language, Gradual typing, Racket, Soundness and Software. His Programming language research is multidisciplinary, relying on both Chat room and Human–computer interaction. His Gradual typing research integrates issues from Class and Object-oriented programming.

His research integrates issues of Implementation, Type system and Benchmark in his study of Soundness. His Software study integrates concerns from other disciplines, such as PEARL and Meaning. His biological study deals with issues like Interface, which deal with fields such as Debugging, Software deployment and Computer security.

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.

Best Publications

A Syntactic Approach to Type Soundness

A.K. Wright;M. Felleisen.
Information & Computation (1994)

1451 Citations

The essence of compiling with continuations

Cormac Flanagan;Amr Sabry;Bruce F. Duba;Matthias Felleisen.
programming language design and implementation (1993)

678 Citations

The revised report on the syntactic theories of sequential control and state

Matthias Felleisen;Robert Hieb.
Theoretical Computer Science (1992)

642 Citations

Classes and mixins

Matthew Flatt;Shriram Krishnamurthi;Matthias Felleisen.
symposium on principles of programming languages (1998)

577 Citations

Contracts for higher-order functions

Robert Bruce Findler;Matthias Felleisen.
international conference on functional programming (2002)

527 Citations

Reasoning about programs in continuation-passing style

Amr Sabry;Matthias Felleisen.
Lisp and Symbolic Computation - Special issue on continuations—part I archive (1993)

488 Citations

A call-by-need lambda calculus

Zena M. Ariola;John Maraist;Martin Odersky;Matthias Felleisen.
symposium on principles of programming languages (1995)

472 Citations

The call-by-need lambda calculus

Zena M. Ariola;Matthias Felleisen.
Journal of Functional Programming (1997)

471 Citations

On the expressive power of programming languages

Matthias Felleisen.
european symposium on programming (1990)

439 Citations

The theory and practice of first-class prompts

Mattias Felleisen.
symposium on principles of programming languages (1988)

367 Citations

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

Contact us

Best Scientists Citing Matthias Felleisen

Shriram Krishnamurthi

Shriram Krishnamurthi

Brown University

Publications: 77

Olivier Danvy

Olivier Danvy

Yale-NUS College

Publications: 69

Matthew Flatt

Matthew Flatt

University of Utah

Publications: 46

Philip Wadler

Philip Wadler

University of Edinburgh

Publications: 45

Grigore Rosu

Grigore Rosu

University of Illinois at Urbana-Champaign

Publications: 42

Martin Odersky

Martin Odersky

École Polytechnique Fédérale de Lausanne

Publications: 37

Robert Bruce Findler

Robert Bruce Findler

Northwestern University

Publications: 37

Gary T. Leavens

Gary T. Leavens

University of Central Florida

Publications: 35

Zhong Shao

Zhong Shao

Yale University

Publications: 32

Jonathan Aldrich

Jonathan Aldrich

Carnegie Mellon University

Publications: 31

Simon Jones

Simon Jones

Microsoft (United States)

Publications: 30

Martin Erwig

Martin Erwig

Oregon State University

Publications: 30

Mitchell Wand

Mitchell Wand

Northeastern University

Publications: 30

Cormac Flanagan

Cormac Flanagan

University of California, Santa Cruz

Publications: 29

Robert Harper

Robert Harper

Carnegie Mellon University

Publications: 27

Suresh Jagannathan

Suresh Jagannathan

Purdue University West Lafayette

Publications: 25

Something went wrong. Please try again later.