Matthias Felleisen

Matthias Felleisen's AcademicInfluence.com Rankings

Matthias Felleisen

Computer Science

#261

World Rank

#273

Historical Rank

Programming

World Rank

Historical Rank

Database

#1638

World Rank

#1718

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Matthias Felleisen Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Matthias Felleisen is a German-American computer science professor and author. He grew up in Germany and immigrated to the US in his twenties. He received his PhD from Indiana University under the direction of Daniel P. Friedman.

(See a Problem?)

Matthias Felleisen's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A Syntactic Approach to Type Soundness (1994) (1255)
The essence of compiling with continuations (1993) (593)
The Revised Report on the Syntactic Theories of Sequential Control and State (1992) (580)
Classes and mixins (1998) (505)
Contracts for higher-order functions (2002) (486)
On the Expressive Power of Programming Languages (1990) (363)
on the Principles of Programming Languages (1997) (352)
DrScheme: a programming environment for Scheme (2002) (333)
The theory and practice of first-class prompts (1988) (313)
Semantics Engineering with PLT Redex (2009) (311)
The design and implementation of typed scheme (2008) (308)
Hygienic macro expansion (1986) (293)
Control operators, the SECD-machine, and the λ-calculus (1987) (290)
Reasoning about programs in continuation-passing style. (1992) (271)
Units: cool modules for HOT languages (1998) (266)
A Syntactic Theory of Sequential Control (1987) (245)
Interlanguage migration: from scripts to programs (2006) (203)
Languages as libraries (2011) (196)
How to design programs: an introduction to programming and computing (2001) (191)
A Programmer's Reduction Semantics for Classes and Mixins (1999) (185)
The calculi of lambda-nu-cs conversion: a syntactic theory of control and state in imperative higher-order programming languages (1987) (181)
Reasoning about programs in continuation-passing style (1993) (175)
Componential set-based analysis (1997) (147)
How to Design Programs (2001) (139)
Abstract models of memory management (1995) (139)
Logical types for untyped languages (2010) (126)
The semantics of program dependence (1989) (121)
The Semantics of Future (1994) (120)
Contract Soundness for object-oriented languages (2001) (117)
Synthesizing Object-Oriented and Functional Design to Promote Re-Use (1998) (115)
Run your research: on the effectiveness of lightweight mechanization (2012) (114)
Reasoning with Continuations (1986) (106)
Transferring Skills at Solving Word Problems from Computing to Algebra Through Bootstrap (2015) (106)
DrScheme: A Pedagogic Programming Environment for Scheme (1997) (105)
The TeachScheme! Project: Computing and Programming for Every Student (2004) (104)
Is sound gradual typing dead? (2016) (103)
Catching bugs in the web of program invariants (1996) (103)
Automatically restructuring programs for the Web (2001) (102)
The semantics of future and its use in program optimization (1995) (98)
Validating the unit correctness of spreadsheet programs (2004) (93)
The call-by-need lambda calculus (1997) (93)
Behavioral contracts and behavioral subtyping (2001) (91)
Control delimiters and their hierarchies (1990) (88)
Fully Abstract Semantics for Observably Sequential Languages (1994) (87)
Correct blame for contracts: no more scapegoating (2011) (86)
A functional I/O system or, fun for freshman kids (2009) (82)
A Syntactic Theory of Sequential State (1989) (81)
Abstract continuations: a mathematical semantics for handling full jumps (1988) (81)
A calculus for assignments in higher-order languages (1987) (80)
Modeling an Algebraic Stepper (2001) (77)
The DrScheme project: an overview (1998) (73)
Programming the Web with High-Level Programming Languages (2001) (73)
Observable sequentiality and full abstraction (1992) (71)
The semantics of future and an application (1999) (70)
Gradual typing for first-class classes (2012) (68)
Programming languages as operating systems (or revenge of the son of the lisp machine) (1999) (66)
Modeling Web Interactions (2003) (66)
The Racket Manifesto (2015) (65)
Complete Monitors for Behavioral Contracts (2012) (65)
Implementation and use of the PLT scheme Web server (2007) (65)
Reasoning with continuations II: full abstraction for models of control (1990) (62)
Extensible Denotational Language Specifications (1994) (62)
Scheme with Classes, Mixins, and Traits (2006) (60)
The structure and interpretation of the computer science curriculum (2004) (59)
A Visual Environment for Developing Context-Sensitive Term Rewriting Systems (2004) (58)
A programmable programming language (2018) (57)
ViewpointWhy computer science doesn't matter (2009) (55)
Continuations from generalized stack inspection (2005) (51)
Parameter-passing and the lambda calculus (1991) (51)
Programming languages and lambda calculi (1989) (48)
On contract satisfaction in a higher-order world (2011) (47)
A tail-recursive machine with stack inspection (2004) (46)
Is continuation-passing useful for data flow analysis? (1994) (46)
Adding delimited and composable control to a production programming environment (2007) (42)
Modular set-based analysis from contracts (2006) (40)
The Call-by-need Lambda Calculus, Revisited (2012) (39)
Towards Practical Gradual Typing (2015) (37)
A Reduction Semantics for Imperative Higher-Order Languages (1987) (36)
Programming languages for reusable software components (2000) (36)
Optimization coaching: optimizers learn to communicate with programmers (2012) (34)
Semantic Casts: Contracts and Structural Subtyping in a Nominal World (2004) (33)
A spectrum of type soundness and performance (2018) (33)
A little Java, a few patterns (1997) (32)
Expressing Structural Properties as Language Constructs (1999) (29)
From Macros to Reusable Generative Programming (1999) (26)
Linguistic reuse (2001) (26)
Set-Based Analysis for Full Scheme and Its Use in Soft-Typing (1995) (25)
The essence of compiling with continuations (with retrospective) (1993) (25)
Migratory Typing: Ten Years Later (2017) (25)
How to Design Programs: An Introduction to Computing and Programming (2006) (24)
A Tail-Recursive Semantics for Stack Inspections (2003) (24)
&lgr;-V-CS: an extended &lgr;-calculus for scheme (1988) (23)
An Investigation of Contracts as Projections (2004) (23)
Toward a formal theory of extensible software (1998) (23)
Reflections on Landins's J-Operator: A Partly Historical Note (1987) (23)
Typing the Numeric Tower (2012) (22)
Future contracts (2009) (21)
Practical Variable-Arity Polymorphism (2009) (21)
On the orthogonality of assignments and procedures in Algol (1993) (21)
How to evaluate the performance of gradual type systems (2019) (21)
ACL2 in DrScheme (2006) (20)
Little Languages and Their Programming Environments (2001) (19)
The Little Schemer (1986) (18)
Contracts for First-Class Classes (2013) (17)
Modeling web interactions and errors (2006) (17)
Programming in Standard ML (2002) (16)
A Closer Look at Export and Import Statements (1986) (16)
ACL 2 for Freshmen : First Experiences (2007) (16)
Automatically restructuring software for the web (2004) (16)
Program verification through soft typing (1996) (16)
Componential set-based analysis (1999) (16)
SPCF: Its Model, Calculus, and Computational Power (Preliminary Version) (1992) (15)
Feature-Specific Profiling (2015) (15)
Fostering Little Languages (2004) (15)
Functional programming and theorem proving for undergraduates: a progress report (2008) (14)
Modular and Polymorphic Set-Based Analysis: Theory and Practice (1996) (14)
Option contracts (2013) (14)
Contracts for first-class classes (2010) (14)
Memory for Functions (2001) (13)
The seasoned schemer (1995) (12)
Behavioral Interface Contracts for Java (2000) (12)
Contracts for first-class modules (2009) (12)
Environmental Acquisition in Network Management (2002) (12)
Debugging hygienic macros (2010) (12)
The little MLer (1997) (11)
Debugging macros (2007) (11)
Oh Lord, please don't let contracts be misunderstood (functional pearl) (2016) (10)
Nested and Dynamic Contract Boundaries (2009) (9)
Taming Macros (2004) (9)
Super 8 languages for making movies (functional pearl) (2017) (9)
Object-oriented Programming Languages Need Well-founded Contracts (2001) (8)
Profiling for laziness (2014) (8)
The Semantics of Futures (1994) (8)
Programming Languages and Systems (2013) (8)
ICFP 2002: Contracts for higher-order functions (2013) (8)
The Network as a Language Construct (2014) (8)
Realm of Racket - Learn to Program, One Game at a Time! (2013) (7)
Building Little Languages With Macros (2004) (7)
Adding interactive visual syntax to textual code (2020) (7)
Well-Founded Touch Optimization for Futures (1994) (7)
Complete monitors for gradual types (2019) (7)
Static Debugging: Browsing the Web of Program Invariants (1996) (7)
Toward a Practical Module System for ACL2 (2009) (6)
Computing curricula 2001 draft (2001) (6)
Models of continuations without continuations (1991) (6)
How to design class hierarchies (2005) (6)
Environmental acquisition revisited (2005) (6)
Coordinated Concurrent Programming in Syndicate (2016) (6)
Methods to Our Madness (1997) (5)
Automatic verification for interactive graphical programs (2009) (5)
lambda-V-CS: An Extended lambda-Calculus for Scheme. (1988) (5)
Hygienic Macros for ACL2 (2010) (5)
Refining syntactic sugar: tools for supporting macro development (2010) (5)
Macros for domain-specific languages (2020) (4)
A Transient Semantics for Typed Racket (2021) (4)
Programming Languages and Lambda Calculi (Summer 2006 Revised Version) (2006) (4)
Developing Interactive Web Programs (2002) (4)
How to evaluate blame for gradual types (2021) (4)
Evaluating Call-by-Need on the Control Stack (2010) (4)
Proceedings of the third ACM SIGPLAN international conference on Functional programming (1998) (4)
A New Way of Debugging Lisp Programs (2007) (3)
TeachScheme!: a checkpoint (2010) (3)
The little LISPer (2nd ed.) (1986) (2)
Extensible Denotational Language Speciications Extensible Denotational Language Specifications ? 2 Extensible Operational Semantics Are Expressions, with X Possibly Free in E, 4 (1994) (2)
Making induction manifest in modular ACL2 (2009) (2)
From Macros to DSLs: The Evolution of Racket (2019) (2)
A Stepper for Scheme Macros (2006) (2)
The Design and Implementation of Typed Scheme: From Scripts to Programs (2011) (2)
Safety as a metric (1999) (2)
Well-Shaped Macros (2003) (2)
The little Schemer (4th ed.) (1996) (2)
The Technology that Computer Science Education Overlooked (1999) (2)
Think It Through (2015) (2)
Reasoning with Continuations Iii: a Complete Calculus of Control (1992) (2)
Modular proof development in acl2 (2012) (2)
Foundations for behavioral higher-order contracts (2012) (2)
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2007) (2)
Learning the Rules (2011) (1)
The State of Things to Come (1997) (1)
Functional Objects (2004) (1)
Stepping Lazy Programs (2011) (1)
From Stack Traces to Lazy Rewriting Sequences (2011) (1)
The Loss of Knowledge (2001) (1)
Sequence Traces for Object-Oriented Executions (2006) (1)
Why teach programming languages in this day and age and how to go about it (2008) (1)
Proceedings of the 1999 Workshop on Functional and Declarative Programming in Education (1999) (1)
From POPL to the classroom and back (2002) (1)
Software for Article (2018) (1)
How to Design Programs, 2e (2004) (1)
Adding types to untyped languages (2010) (1)
On the Effectiveness of Lightweight Mechanization (2012) (1)
Intermezzo 3: Local Definitions and Lexical Scope (2001) (0)
Flow-Dire ted Lightweight Closure ConversionJEFFREY (1999) (0)
Position Paper : Performance Evaluation for Gradual Typing (2015) (0)
Even Older Games (2015) (0)
Welcome to the Educational Pearls Column (2003) (0)
Development through Iterative Refinement (2001) (0)
Proceedings of the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2007, Nice, France, January 17-19, 2007 (2007) (0)
Changing Compound Values (2001) (0)
Designing Abstractions with First-Class Functions (2001) (0)
Computer Science Does Matter (2009) (0)
Variations on a Theme (2001) (0)
Students, Teachers, and Computers (2001) (0)
JFP volume 6 issue 5 Cover and Front matter (1996) (0)
Editorial (2009) (0)
Appendix A : DiSTiL Realms and Components (0)
Program Units as Higher-Order Modules (1998) (0)
Well-founded Touch Optimization for Futures Well-founded Touch Optimization for Futures (1994) (0)
Debugging Hygienic Macros 1 (2009) (0)
Editorial (2005) (0)
Software Contracts in a Higher-order World (2012) (0)
Typed dataspace actors (2020) (0)
Changong Structures, Vectors, and Objects (2001) (0)
The Stars Are Aligned (2015) (0)
Mutually Referential Data Definitions (2001) (0)
Changing the Rules (2015) (0)
More on Processing Lists (2001) (0)
Typed–Untyped Interactions: A Comparative Analysis (2023) (0)
Linguistic Support for Unit Testing UUCS-07-013 (2007) (0)
Designing Accumulator-Style Functions (2001) (0)
Components and program analyses (2000) (0)
Tutorial on Static Inference of Numeric (2017) (0)
Injecting Language Workbench Technology into Mainstream Languages (2023) (0)
Session details: Relating and integrating static and dynamic checks (2010) (0)
Contracts for First-Class Classes Technical Report NU-CCIS-1004 T (2010) (0)
JFP volume 5 issue 3 Cover and Front matter (1995) (0)
Intermezzo 6: The Nature of Inexact Numbers (2001) (0)
The Varieties of Data (2001) (0)
More Uses of Accumulation (2001) (0)
A New Form of Recursion (2001) (0)
Conditional Expressions and Functions (2001) (0)
Objects Are People, Too (1997) (0)
Functional Programming 1 EDUCATIONAL PEARL The Structure and Interpretation of the Computer Science Curriculum (2003) (0)
The little schemer (4. ed.) (1996) (0)
TeachScheme! (2011) (0)
Oh My, Stars! (2015) (0)
The Essence of Compiling with ContinuationsCormac Flanagan (2007) (0)
More on Processing Arbitrarily Large Data (2001) (0)
Multilingual component programming in racket (2011) (0)
A Transient Semantics for Typed Racket The Art, Science, and Engineering of Programming (2022) (0)
Scaling contracts to realistic languages (2012) (0)
Designing Functions with Memory (2001) (0)
Specifying Finite-State Actors ? (2015) (0)
SIGPLAN Response to the Ironman Draft of the Computing Curricula 2001 (2001) (0)
Be a Good Visitor (1997) (0)
Proceedings of the 22nd European conference on Programming Languages and Systems (2013) (0)
NLE volume 22 issue 4 Cover and Back matter (2016) (0)
Intermezzo 4: Defining Functions on the Fly (2001) (0)
The Proof of the Pudding (2015) (0)
Intermezzo 7: The Final Syntax and Semantics (2001) (0)
Variable-Arity Polymorphism T (2008) (0)
Examples of Memory Usage (2001) (0)
The First Year (2005) (0)
Algorithms that Backtrack (2001) (0)
JFP volume 5 issue 1 Cover and Front matter (1995) (0)
CPC volume 21 issue 1-2 Cover and Back matter (2012) (0)
Intermezzo 2: List Abbreviations (2001) (0)
Assignments to Variables (2001) (0)
Programs are Function Plus Variable Definitions (2001) (0)
A design-based introductory computer science course (1997) (0)
Little Languages and their Programming Environments Rice University Technical Report TR 99-350 (1999) (0)
Intermezzo 5: The Cost of Computing and Vectors (2001) (0)
Session details: Keynote session (2007) (0)
Modular ACL2 (2009) (0)
Behavioral Interface Contracts for Java ( Rice University CS TR 00-366 ) (2000) (0)
Designing Functions that Change Structures (2001) (0)
E D U C A T I O N A L P E A R L The structure and interpretation of the computer science curriculum (2004) (0)
Numbers, Expressions, Simple Programs (2001) (0)
Changing the State of Variables (2001) (0)
Automatically Restructuring Programs for the We (2001) (0)
Designing Abstractions from Examples (2001) (0)
Come to Our Carousel (1997) (0)
Parameter-Passing and the Lambda CalculusErik Crank (1991) (0)
The Semantics of Future the Semantics of Future (1994) (0)
Compound Data, Part 1: Structures (2001) (0)
Old Games, New Rules (2015) (0)
CPC volume 23 issue 4 Cover and Back matter (2014) (0)
Processing Two Complex Pieces of Data (2001) (0)
Think It Over, and Over, and Over (2015) (0)
The Lambda Calculus and Operational Semantics (2010) (0)
More Self-referential Data Definitions (2001) (0)
Hygenic Macro Expansion History of Programming Languages (2010) (0)
Implementing a Static Debugger for a First-Order Functional Programming Language (2001) (0)
Functions are Values (2001) (0)
Processing Simple Forms of Data (2001) (0)
Intermezzo 1: Syntax and Semantics (2001) (0)
Similarities in Definitions (2001) (0)
Editorial (2012) (0)
The essence of compiling with continuations (2004) (0)
Prehistory of Programming Languages (2010) (0)
The Little Assistant (2015) (0)
Editorial (2014) (0)
Composing Functions, Revisited Again (2001) (0)
Part of This Total Breakfast (2015) (0)
Restless for More (2015) (0)
Observable Sequentiality and Full AbstractionRobert (1992) (0)
Processing Arbitrarily Large Data (2001) (0)

This paper list is powered by the following services:

Other Resources About Matthias Felleisen

en.wikipedia.org

What Schools Are Affiliated With Matthias Felleisen?

Matthias Felleisen is affiliated with the following schools:

Matthias Felleisen's Academic­Influence.com Rankings

Why Is Matthias Felleisen Influential?

Matthias Felleisen's Published Works

Published Works

Other Resources About Matthias Felleisen

What Schools Are Affiliated With Matthias Felleisen?

Image Attributions

Matthias Felleisen's AcademicInfluence.com Rankings