Travelled to:
1 × Czech Republic
1 × Estonia
1 × France
1 × Ireland
1 × Italy
1 × Norway
1 × The Netherlands
17 × USA
2 × United Kingdom
3 × Germany
4 × Canada
Collaborated with:
R.B.Findler M.Felleisen ∅ S.Krishnamurthi S.Tobin-Hochstadt J.Rafkind S.Owens A.Wick R.Culpepper X.Li W.G.Hatch V.St-Amour C.Klein J.Clements C.Flanagan K.Atkinson G.Lindstrom E.Barzilay K.E.Gray D.S.Goldberg S.McDirmid W.C.Hsieh C.Dimoulas T.S.Strickland J.Regehr G.Yu J.Matthews J.Swaine K.Tew P.A.Dinda A.Reid L.Stoller J.Lepreau E.Eide S.Weirich S.Moore S.Chong A.Takikawa D.Feltey E.Dean S.P.Florence B.Fetscher W.H.Temps T.Kiguradze D.P.West C.Niznik P.R.Yarnold S.M.Belknap C.Eastlund J.A.McCarthy
Talks about:
program (8) languag (5) system (5) contract (3) environ (3) compon (3) unit (3) structur (2) function (2) abstract (2)
Person: Matthew Flatt
DBLP: Flatt:Matthew
Facilitated 3 volumes:
Contributed to:
Wrote 38 papers:
- ECOOP-2015-TakikawaFDFFTF #towards #type system
- Towards Practical Gradual Typing (AT, DF, ED, MF, RBF, STH, MF), pp. 4–27.
- GPCE-2015-FlorenceFFTKWNY #named #programming language
- POP-PL: a patient-oriented prescription programming language (SPF, BF, MF, WHT, TK, DPW, CN, PRY, RBF, SMB), pp. 131–140.
- GPCE-2013-Flatt #question
- Submodules in racket: you want it when, again? (MF), pp. 13–22.
- GPCE-2012-RafkindF #algebra #named
- Honu: syntactic extension for algebraic notation through enforestation (JR, MF), pp. 122–131.
- OOPSLA-2012-StricklandTFF #runtime
- Chaperones and impersonators: run-time support for reasonable interposition (TSS, STH, RBF, MF), pp. 943–962.
- PADL-2012-St-AmourTFF #type system
- Typing the Numeric Tower (VSA, STH, MF, MF), pp. 289–303.
- POPL-2012-KleinCDEFFMRTF #effectiveness #lightweight #research
- Run your research: on the effectiveness of lightweight mechanization (CK, JC, CD, CE, MF, MF, JAM, JR, STH, RBF), pp. 285–296.
- PLDI-2011-Tobin-HochstadtSCFF #library
- Languages as libraries (STH, VSA, RC, MF, MF), pp. 132–141.
- GPCE-2010-AtkinsonFL
- ABI compatibility through a customizable language (KA, MF, GL), pp. 147–156.
- OOPSLA-2010-KleinFF #higher-order #random testing #source code #testing
- Random testing for higher-order, stateful programs (CK, MF, RBF), pp. 555–566.
- OOPSLA-2010-SwaineTDFF #incremental #parallel #runtime
- Back to the futures: incremental parallelization of existing sequential runtime systems (JS, KT, PAD, RBF, MF), pp. 583–597.
- ICFP-2009-FelleisenFFK #functional
- A functional I/O system or, fun for freshman kids (MF, RBF, MF, SK), pp. 47–58.
- ICFP-2009-FlattBF #ad hoc #documentation #named #tool support
- Scribble: closing the book on ad hoc documentation tools (MF, EB, RBF), pp. 109–120.
- ISMM-2009-RafkindWRF #c #garbage collection #precise
- Precise garbage collection for C (JR, AW, JR, MF), pp. 39–48.
- ICFP-2007-FlattYFF #composition #programming
- Adding delimited and composable control to a production programming environment (MF, GY, RBF, MF), pp. 165–176.
- ICFP-2006-OwensF
- From structures and functors to modules and units (SO, MF), pp. 87–98.
- GPCE-2005-CulpepperOF #abstraction #component #interface
- Syntactic Abstraction in Component Interfaces (RC, SO, MF), pp. 373–388.
- OOPSLA-2005-GrayFF #contract #fine-grained
- Fine-grained interoperability through mirrors and contracts (KEG, RBF, MF), pp. 231–245.
- ECOOP-2004-FindlerFF #contract #semantics #type system
- Semantic Casts: Contracts and Structural Subtyping in a Nominal World (RBF, MF, MF), pp. 364–388.
- ICFP-2004-FindlerF #functional #named
- Slideshow: functional presentations (RBF, MF), pp. 224–235.
- ISMM-2004-WickF #memory management
- Memory accounting without partitions (AW, MF), pp. 120–130.
- OOPSLA-2004-GoldbergFF #exclamation
- Super and inner: together at last! (DSG, RBF, MF), pp. 116–129.
- PLDI-2004-FlattF #abstraction
- Kill-safe synchronization abstractions (MF, RBF), pp. 47–58.
- RTA-2004-MatthewsFFF #term rewriting #visual notation
- A Visual Environment for Developing Context-Sensitive Term Rewriting Systems (JM, RBF, MF, MF), pp. 301–311.
- ICFP-2002-Flatt #composition #metaprogramming #question
- Composable and compilable macros: : you want it when? (MF), pp. 72–83.
- ESOP-2001-ClementsFF #algebra #modelling
- Modeling an Algebraic Stepper (JC, MF, MF), pp. 320–334.
- OOPSLA-2001-McDirmidFH #component #java #named
- Jiazzi: New-Age Components for Old-Fashioned Java (SM, MF, WCH), pp. 211–222.
- OSDI-2000-ReidFSLE #component #composition #named
- Knit: Component Composition for Systems Software (AR, MF, LS, JL, EE), pp. 347–360.
- ICFP-1999-FlattFKF #lisp #operating system #programming language
- Programming Languages as Operating Systems (or Revenge of the Son of the Lisp Machine) (MF, RBF, SK, MF), pp. 138–147.
- ICFP-1998-FindlerF #composition #mixin #object-oriented #programming
- Modular Object-Oriented Programming with Units and Mixins (RBF, MF), pp. 94–104.
- PLDI-1998-FlattF #named
- Units: Cool Modules for HOT Languages (MF, MF), pp. 236–248.
- POPL-1998-FlattKF #mixin
- Classes and Mixins (MF, SK, MF), pp. 171–183.
- PLILP-1997-FindlerFFKF #named #programming
- DrScheme: A Pedagogic Programming Environment for Scheme (RBF, CF, MF, SK, MF), pp. 369–388.
- PLDI-1996-FlanaganFKWF #debugging #invariant #web
- Static Debugging: Browsing the Web of Program Invariants (CF, MF, SK, SW, MF), pp. 23–32.
- SLE-2017-LiF #debugging #metaprogramming
- Debugging with domain-specific events via macros (XL, MF), pp. 91–102.
- GPCE-2018-HatchF #interactive #named #reliability #source code
- Rash: from reckless interactions to reliable programs (WGH, MF), pp. 28–39.
- OOPSLA-2016-MooreDFFC #contract #data access
- Extensible access control with authorization contracts (SM, CD, RBF, MF, SC), pp. 214–233.
- POPL-2016-Flatt #set
- Binding as sets of scopes (MF), pp. 705–717.