BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Belgium
1 × Czech Republic
1 × Denmark
1 × Italy
1 × Norway
1 × Poland
1 × Portugal
1 × The Netherlands
2 × Austria
2 × Canada
2 × Estonia
3 × France
35 × USA
4 × Germany
6 × United Kingdom
Collaborated with:
R.B.Findler S.Krishnamurthi M.Flatt S.Tobin-Hochstadt R.Culpepper C.Flanagan C.Dimoulas B.F.Duba D.P.Friedman R.Cartwright A.Sabry J.Clements S.Chang V.St-Amour C.Eastlund D.Sitaram T.Garnock-Jones P.T.Graunke T.S.Strickland A.Takikawa R.Cobbe S.Weeks E.Crank E.E.Kohlbecker B.Greenman L.Andersen R.Pucella P.Meunier M.Latendresse Y.Erlich J.G.Morrisett R.Harper D.Feltey E.Barzilay G.Yu J.Matthews S.V.D.Hoeven M.Wand G.Pettyjohn J.Marshall T.Antoniu P.A.Steckler E.Neuwirth S.Weirich Z.M.Ariola J.Maraist M.Odersky P.Wadler Max S. New J.Vitek E.Dean C.Klein J.A.McCarthy J.Rafkind
Talks about:
program (17) languag (11) continu (10) contract (9) type (7) macro (6) calculus (5) semant (5) scheme (5) model (5)

Person: Matthias Felleisen

DBLP DBLP: Felleisen:Matthias

Facilitated 3 volumes:

ESOP 2013Ed
POPL 2007Ed
ICFP 1998Ed

Contributed to:

CC 20152015
ECOOP 20152015
ESOP 20142014
POPL 20142014
OOPSLA 20132013
ESOP 20122012
OOPSLA 20122012
PADL 20122012
POPL 20122012
GPCE 20112011
IFL 20112011
PLDI 20112011
POPL 20112011
ICFP 20102010
ESOP 20092009
ICFP 20092009
PADL 20092009
PPDP 20092009
POPL 20082008
GPCE 20072007
SCP, 20102010
ICFP 20072007
POPL 20062006
ICFP 20052005
POPL 20052005
ECOOP 20042004
GPCE 20042004
ICSE 20042004
RTA 20042004
ESOP 20032003
AFP 20022002
ICFP 20022002
POPL 20022002
ASE 20012001
ESEC/FSE 20012001
ESOP 20012001
OOPSLA 20012001
CSEE&T 19991999
ESOP 19991999
GCSE 19991999
ICFP 19991999
ECOOP 19981998
FSE 19981998
PLDI 19981998
POPL 19981998
PLDI 19971997
PLILP 19971997
PLDI 19961996
FPCA 19951995
POPL 19951995
PLDI 19941994
Best of PLDI 20041993
PLDI 19931993
POPL 19931993
LFP 19921992
POPL 19921992
POPL 19911991
ESOP 19901990
ESOP 19901991
LFP 19901990
PLDI 19891989
LFP 19881988
POPL 19881988
POPL 19871987
LFP 19861986
LICS 19861986
ESOP 20162016
OOPSLA 20192019
POPL 20162016

Wrote 80 papers:

CC-2015-St-AmourAF #feature model #profiling
Feature-Specific Profiling (VSA, LA, MF), pp. 49–68.
ECOOP-2015-TakikawaFDFFTF #towards #type system
Towards Practical Gradual Typing (AT, DF, ED, MF, RBF, STH, MF), pp. 4–27.
ESOP-2014-Garnock-JonesTF #network
The Network as a Language Construct (TGJ, STH, MF), pp. 473–492.
POPL-2014-ChangF #lazy evaluation #profiling
Profiling for laziness (SC, MF), pp. 349–360.
OOPSLA-2013-DimoulasFF #contract
Option contracts (CD, RBF, MF), pp. 475–494.
ESOP-2012-ChangF #call-by #revisited #λ-calculus
The Call-by-Need λ Calculus, Revisited (SC, MF), pp. 128–147.
ESOP-2012-DimoulasTF #behaviour #contract #monitoring
Complete Monitors for Behavioral Contracts (CD, STH, MF), pp. 214–233.
OOPSLA-2012-St-AmourTF #communication #optimisation
Optimization coaching: optimizers learn to communicate with programmers (VSA, STH, MF), pp. 163–178.
OOPSLA-2012-TakikawaSDTF #type system
Gradual typing for first-class classes (AT, TSS, CD, STH, MF), pp. 793–810.
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.
GPCE-2011-Felleisen #component #multi #programming
Multilingual component programming in racket (MF), pp. 1–2.
IFL-2011-ChangBCF #lazy evaluation #sequence #stack
From Stack Traces to Lazy Rewriting Sequences (SC, EB, JC, MF), pp. 100–115.
PLDI-2011-Tobin-HochstadtSCFF #library
Languages as libraries (STH, VSA, RC, MF, MF), pp. 132–141.
POPL-2011-DimoulasFFF #contract
Correct blame for contracts: no more scapegoating (CD, RBF, CF, MF), pp. 215–226.
ICFP-2010-CulpepperF #metaprogramming
Fortifying macros (RC, MF), pp. 235–246.
ICFP-2010-Felleisen #exclamation
TeachScheme!: a checkpoint (MF), pp. 129–130.
ICFP-2010-Tobin-HochstadtF #logic
Logical types for untyped languages (STH, MF), pp. 117–128.
ESOP-2009-StricklandTF #morphism #polymorphism
Practical Variable-Arity Polymorphism (TSS, STH, MF), pp. 32–46.
ICFP-2009-FelleisenFFK #functional
A functional I/O system or, fun for freshman kids (MF, RBF, MF, SK), pp. 47–58.
PADL-2009-EastlundF #towards
Toward a Practical Module System for ACL2 (CE, MF), pp. 46–60.
PPDP-2009-DimoulasPF #contract
Future contracts (CD, RP, MF), pp. 195–206.
PPDP-2009-EastlundF #composition #induction
Making induction manifest in modular ACL2 (CE, MF), pp. 105–116.
POPL-2008-Tobin-HochstadtF #design #implementation
The design and implementation of typed scheme (STH, MF), pp. 395–406.
GPCE-2007-CulpepperF #debugging #metaprogramming
Debugging macros (RC, MF), pp. 135–144.
GPCE-J-2007-CulpepperF10 #debugging #metaprogramming
Debugging hygienic macros (RC, MF), pp. 496–515.
ICFP-2007-FlattYFF #composition #programming
Adding delimited and composable control to a production programming environment (MF, GY, RBF, MF), pp. 165–176.
POPL-2006-MeunierFF #analysis #composition #contract
Modular set-based analysis from contracts (PM, RBF, MF), pp. 218–231.
ICFP-2005-PettyjohnCMKF #continuation #stack
Continuations from generalized stack inspection (GP, JC, JM, SK, MF), pp. 216–227.
POPL-2005-CobbeF #revisited
Environmental acquisition revisited (RC, MF), pp. 14–25.
ECOOP-2004-Felleisen #functional
Functional Objects (MF), p. 267.
ECOOP-2004-FindlerFF #contract #semantics #type system
Semantic Casts: Contracts and Structural Subtyping in a Nominal World (RBF, MF, MF), pp. 364–388.
GPCE-2004-CulpepperF #metaprogramming
Taming Macros (RC, MF), pp. 225–243.
ICSE-2004-AntoniuSKNF #correctness #source code #spreadsheet #validation
Validating the Unit Correctness of Spreadsheet Programs (TA, PAS, SK, EN, MF), pp. 439–448.
RTA-2004-MatthewsFFF #term rewriting #visual notation
A Visual Environment for Developing Context-Sensitive Term Rewriting Systems (JM, RBF, MF, MF), pp. 301–311.
ESOP-2003-ClementsF #recursion #semantics #stack
A Tail-Recursive Semantics for Stack Inspections (JC, MF), pp. 22–37.
ESOP-2003-GraunkeFKF #interactive #modelling #web
Modeling Web Interactions (PTG, RBF, SK, MF), pp. 238–252.
AFP-2002-Felleisen02 #interactive #source code #web
Developing Interactive Web Programs (MF), pp. 100–128.
ICFP-2002-FindlerF #contract #higher-order
Contracts for higher-order functions (RBF, MF), pp. 48–59.
POPL-2002-Felleisen
From POPL to the classroom and back (MF), pp. 126–127.
ASE-2001-GraunkeFKF #automation #source code
Automatically Restructuring Programs for the We (PTG, RBF, SK, MF), pp. 211–222.
ESEC-FSE-2001-FindlerLF #behaviour #contract #type system
Behavioral contracts and behavioral subtyping (RBF, ML, MF), pp. 229–236.
ESOP-2001-ClementsFF #algebra #modelling
Modeling an Algebraic Stepper (JC, MF, MF), pp. 320–334.
ESOP-2001-GraunkeKHF #programming language #web
Programming the Web with High-Level Programming Languages (PTG, SK, SVDH, MF), pp. 122–136.
OOPSLA-2001-FindlerF #contract #object-oriented
Contract Soundness for Object-Oriented Languages (RBF, MF), pp. 1–15.
CSEET-1999-FelleisenC #metric #safety
Safety as a Metric (MF, RC), pp. 129–131.
ESOP-1999-KrishnamurthiEF
Expressing Structural Properties as Language Constructs (SK, YDE, MF), pp. 258–272.
GCSE-1999-KrishnamurthiFD #generative #metaprogramming #reuse
From Macros to Reusable Generative Programming (SK, MF, BFD), pp. 105–120.
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.
ECOOP-1998-KrishnamurthiFF #design #functional #object-oriented
Synthesizing Object-Oriented and Functional Design to Promote Re-Use (SK, MF, DPF), pp. 91–113.
FSE-1998-KrishnamurthiF #formal method #towards
Toward a Formal Theory of Extensible Software (SK, MF), pp. 88–98.
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.
PLDI-1997-FlanaganF #analysis #component
Componential Set-Based Analysis (CF, MF), pp. 235–248.
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.
FPCA-1995-MorrisettFH #memory management #modelling
Abstract Models of Memory Management (JGM, MF, RH), pp. 66–77.
POPL-1995-AriolaFMOW #call-by #λ-calculus
The Call-by-Need λ Calculus (ZMA, MF, JM, MO, PW), pp. 233–246.
POPL-1995-FlanaganF #optimisation #semantics
The Semantics of Future and Its Use in Program Optimizations (CF, MF), pp. 209–220.
PLDI-1994-SabryF #analysis #continuation #data flow #question
Is Continuation-Passing Useful for Data Flow Analysis? (AS, MF), pp. 1–12.
Best-of-PLDI-1993-FlanaganSDF93a #compilation #continuation
The essence of compiling with continuations (with retrospective) (CF, AS, BFD, MF), pp. 502–514.
PLDI-1993-FlanaganSDF #compilation #continuation
The Essence of Compiling with Continuations (CF, AS, BFD, MF), pp. 237–247.
POPL-1993-WeeksF #algol #on the #orthogonal
On the Orthogonality of Assignments and Procedures in Algol (SW, MF), pp. 57–70.
LFP-1992-SabryF #continuation #reasoning #source code
Reasoning About Programs in Continuation-Passing Style (AS, MF), pp. 288–298.
POPL-1992-CartwrightF #abstraction
Observable Sequentiality and Full Abstraction (RC, MF), pp. 328–342.
POPL-1991-CrankF #λ-calculus
Parameter-Passing and the λ Calculus (EC, MF), pp. 233–244.
POPL-1991-SitaramF #continuation #modelling
Modeling Continuations without Continuations (DS, MF), pp. 185–196.
ESOP-1990-Felleisen #on the #power of #programming language
On the Expressive Power of Programming Languages (MF), pp. 134–151.
ESOP-J-1990-Felleisen91 #on the #power of #programming language
On the Expressive Power of Programming Languages (MF), pp. 35–75.
LFP-1990-SitaramF #abstraction #continuation #modelling #reasoning
Reasoning with Continuations II: Full Abstraction for Models of Control (DS, MF), pp. 161–175.
PLDI-1989-CartwrightF #dependence #semantics
The Semantics of Program Dependence (RC, MF), pp. 13–27.
LFP-1988-Felleisen #named #λ-calculus
λ-V-CS: An Extended λ-Calculus for Scheme (MF), pp. 72–85.
LFP-1988-FelleisenWFD #continuation #semantics
Abstract Continuations: A Mathematical Semantics for Handling Full Jumps (MF, MW, DPF, BFD), pp. 52–62.
POPL-1988-Felleisen #theory and practice
The Theory and Practice of First-Class Prompts (MF), pp. 180–190.
POPL-1987-FelleisenF #calculus #higher-order
A Calculus for Assignments in Higher-Order Languages (MF, DPF), pp. 314–325.
LFP-1986-KohlbeckerFFD #metaprogramming
Hygienic Macro Expansion (EEK, DPF, MF, BFD), pp. 151–161.
LICS-1986-FelleisenFKD #continuation #reasoning
Reasoning with Continuations (MF, DPF, EEK, BFD), pp. 131–141.
ESOP-2016-Garnock-JonesF #concurrent #coordination #programming
Coordinated Concurrent Programming in Syndicate (TGJ, MF), pp. 310–336.
OOPSLA-2019-GreenmanFD #monitoring
Complete monitors for gradual types (BG, MF, CD), p. 29.
POPL-2016-TakikawaFGNVF #question #type system
Is sound gradual typing dead? (AT, DF, BG, MSN, JV, MF), pp. 456–468.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.