Matthew Flatt

发表

Migratory Typing: Ten Years Later

Sam Tobin-Hochstadt, Matthias Felleisen, Robert Bruce Findler, 2017, SNAPL.

Plt framework: gui application framework

Robert Bruce Findler, Matthew Flatt, 2000 .

Reachability-Based Memory Accounting

Matthew Flatt, Wilson C. Hsieh, Adam Wick, 2002 .

Lexer and Parser Generators in Scheme

Matthew Flatt, Olin Shivers, Scott Owens, 2004 .

Adding delimited and composable control to a production programming environment

Gang Yu, Matthias Felleisen, Robert Bruce Findler, 2007, ICFP '07.

Source-to-Source Compilation via Submodules

Matthew Flatt, Tero Hasu, 2016, ELS.

How to design programs: an introduction to programming and computing

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2001 .

Designing Abstractions from Examples

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2001 .

A programmable programming language

Sam Tobin-Hochstadt, Matthias Felleisen, Robert Bruce Findler, 2018, Commun. ACM.

Programming Languages and Lambda Calculi (Summer 2006 Revised Version)

Matthias Felleisen, Matthew Flatt, M. Felleisen, 2006 .

POP-PL: a patient-oriented prescription programming language

Paul R. Yarnold, Robert Bruce Findler, Matthew Flatt, 2015, GPCE.

Practical Aspects of Declarative Languages

Matthew Flatt, Hai-Feng Guo, 2014, Lecture Notes in Computer Science.

CpU: practical components for systems software

Matthew Flatt, Jay Lepreau, Alastair Reid, 2000, OPSR.

Debugging with domain-specific events via macros

Matthew Flatt, Xiangqi Li, 2017, SLE.

Catching bugs in the web of program invariants

Matthias Felleisen, Matthew Flatt, Shriram Krishnamurthi, 1996, PLDI '96.

Medic: metaprogramming and trace-oriented debugging

Matthew Flatt, Xiangqi Li, 2015, FPW@SPLASH.

Programming languages as operating systems (or revenge of the son of the lisp machine)

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 1999, ICFP '99.

PLT MzScheme: Language Manual

Matthew Flatt, M. Flatt, 2000 .

A Visual Environment for Developing Context-Sensitive Term Rewriting Systems

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2004, RTA.

Static Debugging: Browsing the Web of Program Invariants

Matthias Felleisen, Matthew Flatt, Shriram Krishnamurthi, 1996, PLDI.

Syntactic abstraction in component interfaces

Matthew Flatt, Scott Owens, Ryan Culpepper, 2005, GPCE'05.

Submodules in racket: you want it when, again?

Matthew Flatt, 2014 .

Languages as libraries

Sam Tobin-Hochstadt, Matthias Felleisen, Matthew Flatt, 2011, PLDI '11.

How to Design Programs

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2001 .

From structures and functors to modules and units

Matthew Flatt, Scott Owens, 2006, ICFP '06.

A functional I/O system or, fun for freshman kids

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2009, ICFP.

Changong Structures, Vectors, and Objects

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2001 .

Compound Data, Part 1: Structures

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2001 .

Fostering Little Languages

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2004 .

Chaperones and impersonators: run-time support for reasonable interposition

Sam Tobin-Hochstadt, Robert Bruce Findler, Matthew Flatt, 2012, OOPSLA '12.

Intermezzo 7: The Final Syntax and Semantics

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2001 .

Mixing COP and OOP

Matthew Flatt, Wilson C. Hsieh, Sean McDirmid, 2001 .

POP-PL

Paul R. Yarnold, Robert Bruce Findler, Matthew Flatt, 2018, ACM Trans. Program. Lang. Syst..

Super and inner: together at last!

Robert Bruce Findler, Matthew Flatt, David S. Goldberg, 2004, OOPSLA '04.

Binding as sets of scopes

Matthew Flatt, 2016, POPL.

The TeachScheme! Project: Computing and Programming for Every Student

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2004, Comput. Sci. Educ..

How to Design Programs, 2e

Matthias Felleisen, Matthew Flatt, Shriram Krishnamurthi, 2004 .

DrScheme: a programming environment for Scheme

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2002, J. Funct. Program..

Programming languages and lambda calculi

Matthias Felleisen, Matthew Flatt, M. Felleisen, 1989 .

Fine-grained interoperability through mirrors and contracts

Robert Bruce Findler, Matthew Flatt, Kathryn E. Gray, 2005, OOPSLA '05.

Journal of Functional Programming: Preface

Matthew Flatt, Benjamin C. Pierce, B. Pierce, 2007 .

Revised6 Report on the Algorithmic Language Scheme

R. Kent Dybvig, Matthew Flatt, Michael Sperber, 2009 .

Run your research: on the effectiveness of lightweight mechanization

Sam Tobin-Hochstadt, Matthias Felleisen, Robert Bruce Findler, 2012, POPL '12.

Memory accounting without partitions

Matthew Flatt, Adam Wick, 2004, ISMM '04.

Syntactic Extension for Languages with Implicitly Delimited and Infix Syntax

Matthew Flatt, Jon Rafkind, J. Rafkind, 2013 .

Advanced Macrology and the Implementation of Typed Scheme

Sam Tobin-Hochstadt, Matthew Flatt, Ryan Culpepper, 2007 .

Changing the State of Variables

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2001 .

The Racket virtual machine and randomized testing

Robert Bruce Findler, Matthew Flatt, Casey Klein, 2012, High. Order Symb. Comput..

Designing Functions with Memory

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2001 .

Front Matter, Table of Contents

Matthew Flatt, Camil Demetrescu, 2015, Dagstuhl Artifacts Ser..

Magpie: precise garbage collection for c

Matthew Flatt, Adam Wick, 2006 .

Expressive Modular Linking for Object-Oriented Languages

Matthew Flatt, Wilson C. Hsieh, Sean McDirmid, 2002 .

Semantic Casts: Contracts and Structural Subtyping in a Nominal World

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2004, ECOOP.

From Macros to DSLs: The Evolution of Racket

Matthias Felleisen, Matthew Flatt, Shriram Krishnamurthi, 2019, SNAPL.

Precise garbage collection for C

John Regehr, Matthew Flatt, Adam Wick, 2009, ISMM '09.

Programming languages for reusable software components

Matthias Felleisen, Matthew Flatt, M. Felleisen, 2000 .

Knit: component composition for systems software

Eric Eide, Matthew Flatt, Leigh Stoller, 2000, OSDI.

Modeling an Algebraic Stepper

Matthias Felleisen, Matthew Flatt, John Clements, 2001, ESOP.

POP-PL: a patient-oriented prescription programming language

Paul R. Yarnold, Robert Bruce Findler, Matthew Flatt, 2016 .

Processing Arbitrarily Large Data

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2001 .

Proceedings of the 16th International Symposium on Practical Aspects of Declarative Languages - Volume 8324

Matthew Flatt, Hai-Feng Guo, M. Flatt, 2014 .

Creating Languages in Racket

Matthew Flatt, 2011 .

Slideshow: functional presentations

Robert Bruce Findler, Matthew Flatt, M. Flatt, 2004, ICFP '04.

A Programmer's Reduction Semantics for Classes and Mixins

Matthias Felleisen, Matthew Flatt, Shriram Krishnamurthi, 1999, Formal Syntax and Semantics of Java.

How to Design Programs: An Introduction to Computing and Programming

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2006 .

Honu: syntactic extension for algebraic notation through enforestation

Matthew Flatt, Jon Rafkind, 2012, GPCE '12.

Memory for Functions

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2001 .

PLT MrEd: Graphical Toolbox Manual

Matthew Flatt, 2006 .

Distributed Places

Peter A. Dinda, Robert Bruce Findler, Matthew Flatt, 2013, Trends in Functional Programming.

Seeing the futures: profiling shared-memory parallel racket

Robert Bruce Findler, Matthew Flatt, Vincent St-Amour, 2012, FHPC '12.

ProfessorJ: a gradual introduction to Java through language levels

Matthew Flatt, Kathryn E. Gray, M. Flatt, 2003, OOPSLA '03.

Scheme with Classes, Mixins, and Traits

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2006, APLAS.

More on Processing Arbitrarily Large Data

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2001 .

Algorithms that Backtrack

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2001 .

Intermezzo 3: Local Definitions and Lexical Scope

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2001 .

Units: cool modules for HOT languages

Matthias Felleisen, Matthew Flatt, M. Felleisen, 1998, PLDI.

Places: adding message-passing parallelism to racket

Peter A. Dinda, Robert Bruce Findler, Matthew Flatt, 2011, DLS '11.

Kill-safe synchronization abstractions

Robert Bruce Findler, Matthew Flatt, M. Flatt, 2004, PLDI '04.

Designing Accumulator-Style Functions

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2001 .

Examples of Memory Usage

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2001 .

Slideshow: functional presentations

Robert Bruce Findler, Matthew Flatt, 2004, ICFP '04.

Random testing for higher-order, stateful programs

Robert Bruce Findler, Matthew Flatt, Casey Klein, 2010, OOPSLA.

ABI compatibility through a customizable language

Matthew Flatt, Gary Lindstrom, Kevin Atkinson, 2010, GPCE '10.

Software Variability Mechanisms for Improving Run-Time Performance

Eric Eide, Matthew Flatt, E. Eide, 2012 .

The role of language paradigms in teaching programming

Peter Van Roy, Matthew Flatt, Boris Magnusson, 2003, SIGCSE.

Changing Compound Values

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2001 .

The DrScheme project: an overview

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 1998, SIGP.

Back to the futures: incremental parallelization of existing sequential runtime systems

Peter A. Dinda, Robert Bruce Findler, Matthew Flatt, 2010, OOPSLA.

Modular object-oriented programming with units and mixins

Robert Bruce Findler, Matthew Flatt, M. Flatt, 1998, ICFP '98.

Designing Functions that Change Structures

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2001 .

Scribble: closing the book on ad hoc documentation tools

Robert Bruce Findler, Matthew Flatt, Eli Barzilay, 2009, ICFP.

Towards customizable pedagogic programming languages

Matthew Flatt, Kathryn E. Gray, 2006 .

Development through Iterative Refinement

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2001 .

Processing Simple Forms of Data

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2001 .

Slideshow: Racket Figure and Presentation Tools

Matthew Flatt, Robert Bruce Findler, 2005 .

Jiazzi: new-age components for old-fasioned Java

Matthew Flatt, Wilson C. Hsieh, Sean McDirmid, 2001, OOPSLA '01.

Proceedings of the 16th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences

Matthew Flatt, Sebastian Erdweg, 2017, GPCE.

Composable and compilable macros:: you want it when?

Matthew Flatt, 2002, ICFP '02.

Front Matter, Table of Contents, Preface, Artifact Evaluation Committee

Matthew Flatt, Tijs van der Storm, 2016, Dagstuhl Artifacts Ser..

Proceedings of the 2014 International Conference on Generative Programming: Concepts and Experiences

Matthew Flatt, Ulrik Pagh Schultz, 2014 .

Compiling Java to PLT Scheme

Matthew Flatt, Kathryn E. Gray, 2004 .

Aspect Weaving as Component Knitting: Separating Concerns with Knit

Eric Eide, Matthew Flatt, Jay Lepreau, 2001 .

Compile-time information in software components

Matthew Flatt, Konrad Slind, Scott Owens, 2007 .

The Racket Manifesto

Sam Tobin-Hochstadt, Matthias Felleisen, Robert Bruce Findler, 2015, SNAPL.

The structure and interpretation of the computer science curriculum

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2004, J. Funct. Program..

PsyScope: An interactive graphic system for designing and controlling experiments in the psychology laboratory using Macintosh computers

Matthew Flatt, Jonathan D. Cohen, Brian MacWhinney, 1993 .

Rebuilding racket on chez scheme (experience report)

R. Kent Dybvig, Sam Tobin-Hochstadt, Matthew Flatt, 2019, Proc. ACM Program. Lang..

Macros that Work Together - Compile-time bindings, partial expansion, and definition contexts

Robert Bruce Findler, Matthew Flatt, David Darais, 2012, J. Funct. Program..

Designing Abstractions with First-Class Functions

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2001 .

Compiler and runtime support for continuation marks

R. Kent Dybvig, Matthew Flatt, 2020, PLDI.

Submodules in racket: you want it when, again?

Matthew Flatt, 2013, GPCE.

Processing Two Complex Pieces of Data

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2001 .

Semantics Engineering with PLT Redex

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2009 .

Application binary interface compatibility through a customizable language

Matthew Flatt, Kevin Atkinson, 2011 .

Program Units as Higher-Order Modules

Matthias Felleisen, Matthew Flatt, 1997, Electron. Notes Theor. Comput. Sci..

A Framework for Modular Linking in OO Languages

Matthew Flatt, Wilson C. Hsieh, Sean McDirmid, 2006, JMLC.

Keeping it Clean with Syntax Parameters

Matthew Flatt, Ryan Culpepper, Eli Barzilay, 2011 .

Adapting Scheme-Like Macros to a C-Like Language

Matthew Flatt, Kevin Atkinson, 2011 .

Intermezzo 2: List Abbreviations

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 2001 .

Kill-Safe Synchronization Abstractions "Well, it just so happens that your friend here is only mostly dead. There's a big difference between mostly dead and all dead ." - Miracle Max in The Princess Bride

Robert Bruce Findler, Matthew Flatt, 2004 .

DrScheme: A Pedagogic Programming Environment for Scheme

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, 1997, PLILP.

Classes and mixins

Matthias Felleisen, Matthew Flatt, Shriram Krishnamurthi, 1998, POPL '98.