 | 2010 |
|---|
| 94 |       | Matthias Felleisen:
Adding types to untyped languages.
TLDI 2010: 1-2 |
| 2009 |
|---|
| 93 | | T. Stephen Strickland,
Sam Tobin-Hochstadt,
Matthias Felleisen:
Practical Variable-Arity Polymorphism.
ESOP 2009: 32-46 |
| 92 | | Matthias Felleisen,
Robert Bruce Findler,
Matthew Flatt,
Shriram Krishnamurthi:
A functional I/O system or, fun for freshman kids.
ICFP 2009: 47-58 |
| 91 | | Carl Eastlund,
Matthias Felleisen:
Toward a Practical Module System for ACL2.
PADL 2009: 46-60 |
| 90 | | Carl Eastlund,
Matthias Felleisen:
Making induction manifest in modular ACL2.
PPDP 2009: 105-116 |
| 89 | | Christos Dimoulas,
Riccardo Pucella,
Matthias Felleisen:
Future contracts.
PPDP 2009: 195-206 |
| 88 | | Matthias Felleisen,
Shriram Krishnamurthi:
Viewpoint - Why computer science doesn't matter.
Commun. ACM 52(7): 37-40 (2009) |
| 87 | | Xavier Leroy,
Matthias Felleisen:
Editorial.
J. Funct. Program. 19(5): 489-490 (2009) |
| 2008 |
|---|
| 86 | | Sam Tobin-Hochstadt,
Matthias Felleisen:
The design and implementation of typed scheme.
POPL 2008: 395-406 |
| 85 | | Matthias Felleisen:
Why teach programming languages in this day and age and how to go about it.
SIGPLAN Notices 43(11): 59-61 (2008) |
| 2007 |
|---|
| 84 |  | Martin Hofmann,
Matthias Felleisen:
Proceedings of the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2007, Nice, France, January 17-19, 2007
ACM 2007 |
| 83 | | Ryan Culpepper,
Matthias Felleisen:
Debugging macros.
GPCE 2007: 135-144 |
| 82 | | Matthew Flatt,
Gang Yu,
Robert Bruce Findler,
Matthias Felleisen:
Adding delimited and composable control to a production programming environment.
ICFP 2007: 165-176 |
| 81 | | Shriram Krishnamurthi,
Peter Walton Hopkins,
Jay A. McCarthy,
Paul T. Graunke,
Greg Pettyjohn,
Matthias Felleisen:
Implementation and use of the PLT scheme Web server.
Higher-Order and Symbolic Computation 20(4): 431-460 (2007) |
| 2006 |
|---|
| 80 | | Dale Vaillancourt,
Rex L. Page,
Matthias Felleisen:
ACL2 in DrScheme.
ACL2 2006: 107-116 |
| 79 | | Matthew Flatt,
Robert Bruce Findler,
Matthias Felleisen:
Scheme with Classes, Mixins, and Traits.
APLAS 2006: 270-289 |
| 78 | | Sam Tobin-Hochstadt,
Matthias Felleisen:
Interlanguage migration: from scripts to programs.
OOPSLA Companion 2006: 964-974 |
| 77 | | Philippe Meunier,
Robert Bruce Findler,
Matthias Felleisen:
Modular set-based analysis from contracts.
POPL 2006: 218-231 |
| 2005 |
|---|
| 76 | | Greg Pettyjohn,
John Clements,
Joe Marshall,
Shriram Krishnamurthi,
Matthias Felleisen:
Continuations from generalized stack inspection.
ICFP 2005: 216-227 |
| 75 | | Richard Cobbe,
Matthias Felleisen:
Environmental acquisition revisited.
POPL 2005: 14-25 |
| 74 | | Matthias Felleisen,
Julia L. Lawall,
Manuel Serrano,
Olin Shivers:
Editorial.
Higher-Order and Symbolic Computation 18(3-4): 243-244 (2005) |
| 2004 |
|---|
| 73 | | Matthias Felleisen:
Functional Objects.
ECOOP 2004: 267 |
| 72 | | Robert Bruce Findler,
Matthew Flatt,
Matthias Felleisen:
Semantic Casts: Contracts and Structural Subtyping in a Nominal World.
ECOOP 2004: 364-388 |
| 71 | | Ryan Culpepper,
Matthias Felleisen:
Taming Macros.
GPCE 2004: 225-243 |
| 70 | | Tudor Antoniu,
Paul A. Steckler,
Shriram Krishnamurthi,
Erich Neuwirth,
Matthias Felleisen:
Validating the Unit Correctness of Spreadsheet Programs.
ICSE 2004: 439-448 |
| 69 | | Jacob Matthews,
Robert Bruce Findler,
Matthew Flatt,
Matthias Felleisen:
A Visual Environment for Developing Context-Sensitive Term Rewriting Systems.
RTA 2004: 301-311 |
| 68 | | John Clements,
Matthias Felleisen:
A tail-recursive machine with stack inspection.
ACM Trans. Program. Lang. Syst. 26(6): 1029-1052 (2004) |
| 67 | | Jacob Matthews,
Robert Bruce Findler,
Paul T. Graunke,
Shriram Krishnamurthi,
Matthias Felleisen:
Automatically Restructuring Programs for the Web.
Autom. Softw. Eng. 11(4): 337-364 (2004) |
| 66 | | Matthias Felleisen,
Robert Bruce Findler,
Matthew Flatt,
Shriram Krishnamurthi:
The structure and interpretation of the computer science curriculum.
J. Funct. Program. 14(4): 365-378 (2004) |
| 2003 |
|---|
| 65 | | John Clements,
Matthias Felleisen:
A Tail-Recursive Semantics for Stack Inspections.
ESOP 2003: 22-37 |
| 64 | | Paul T. Graunke,
Robert Bruce Findler,
Shriram Krishnamurthi,
Matthias Felleisen:
Modeling Web Interactions.
ESOP 2003: 238-252 |
| 63 | | Matthias Felleisen:
Welcome to the Educational Pearls Column.
J. Funct. Program. 13(5): 835-838 (2003) |
| 2002 |
|---|
| 62 | | Matthias Felleisen:
Developing Interactive Web Programs.
Advanced Functional Programming 2002: 100-128 |
| 61 | | Robert Bruce Findler,
Matthias Felleisen:
Contracts for higher-order functions.
ICFP 2002: 48-59 |
| 60 | | Mark Logan,
Matthias Felleisen,
David N. Blank-Edelman:
Environmental Acquisition in Network Management.
LISA 2002: 175-184 |
| 59 | | Matthias Felleisen:
From POPL to the classroom and back.
POPL 2002: 126-127 |
| 58 | | Robert Bruce Findler,
John Clements,
Cormac Flanagan,
Matthew Flatt,
Shriram Krishnamurthi,
Paul Steckler,
Matthias Felleisen:
DrScheme: a programming environment for Scheme.
J. Funct. Program. 12(2): 159-182 (2002) |
| 2001 |
|---|
| 57 | | Paul T. Graunke,
Robert Bruce Findler,
Shriram Krishnamurthi,
Matthias Felleisen:
Automatically Restructuring Programs for the We.
ASE 2001: 211-222 |
| 56 | | Robert Bruce Findler,
Mario Latendresse,
Matthias Felleisen:
Behavioral contracts and behavioral subtyping.
ESEC / SIGSOFT FSE 2001: 229-236 |
| 55 | | Paul T. Graunke,
Shriram Krishnamurthi,
Steve Van Der Hoeven,
Matthias Felleisen:
Programming the Web with High-Level Programming Languages.
ESOP 2001: 122-136 |
| 54 | | John Clements,
Matthew Flatt,
Matthias Felleisen:
Modeling an Algebraic Stepper.
ESOP 2001: 320-334 |
| 53 | | Robert Bruce Findler,
Matthias Felleisen:
Contract Soundness for Object-Oriented Languages.
OOPSLA 2001: 1-15 |
| 52 | | Ron Cytron,
Matthias Felleisen:
SIGPLAN Response to the Ironman Draft of the Computing Curricula 2001.
SIGPLAN Notices 36(4): 3-4 (2001) |
| 1999 |
|---|
| 51 | | Matthias Felleisen,
Robert Cartwright:
Safety as a Metric.
CSEE&T 1999: 129-131 |
| 50 | | Shriram Krishnamurthi,
Yan-David Erlich,
Matthias Felleisen:
Expressing Structural Properties as Language Constructs.
ESOP 1999: 258-272 |
| 49 | | Matthew Flatt,
Shriram Krishnamurthi,
Matthias Felleisen:
A Programmer's Reduction Semantics for Classes and Mixins.
Formal Syntax and Semantics of Java 1999: 241-269 |
| 48 | | Shriram Krishnamurthi,
Matthias Felleisen,
Bruce F. Duba:
From Macros to Reusable Generative Programming.
GCSE 1999: 105-120 |
| 47 | | Matthew Flatt,
Robert Bruce Findler,
Shriram Krishnamurthi,
Matthias Felleisen:
Programming Languages as Operating Systems (or Revenge of the Son of the Lisp Machine).
ICFP 1999: 138-147 |
| 46 | | Cormac Flanagan,
Matthias Felleisen:
Componential Set-Based Analysis.
ACM Trans. Program. Lang. Syst. 21(2): 370-416 (1999) |
| 45 | | Cormac Flanagan,
Matthias Felleisen:
The Semantics of Future and an Application.
J. Funct. Program. 9(1): 1-31 (1999) |
| 1998 |
|---|
| 44 | | Shriram Krishnamurthi,
Matthias Felleisen,
Daniel P. Friedman:
Synthesizing Object-Oriented and Functional Design to Promote Re-Use.
ECOOP 1998: 91-113 |
| 43 | | Matthew Flatt,
Matthias Felleisen:
Units: Cool Modules for HOT Languages.
PLDI 1998: 236-248 |
| 42 | | Matthew Flatt,
Shriram Krishnamurthi,
Matthias Felleisen:
Classes and Mixins.
POPL 1998: 171-183 |
| 41 | | Shriram Krishnamurthi,
Matthias Felleisen:
Toward a Formal Theory of Extensible Software.
SIGSOFT FSE 1998: 88-98 |
| 40 | | Matthias Felleisen,
Robert Bruce Findler,
Matthew Flatt,
Shriram Krishnamurthi:
The DrScheme Project: An Overview.
SIGPLAN Notices 33(6): 17-23 (1998) |
| 1997 |
|---|
| 39 | | Cormac Flanagan,
Matthias Felleisen:
Componential Set-Based Analysis.
PLDI 1997: 235-248 |
| 38 | | Robert Bruce Findler,
Cormac Flanagan,
Matthew Flatt,
Shriram Krishnamurthi,
Matthias Felleisen:
DrScheme: A Pedagogic Programming Environment for Scheme.
PLILP 1997: 369-388 |
| 37 | | Matthew Flatt,
Matthias Felleisen:
Program Units as Higher-Order Modules.
Electr. Notes Theor. Comput. Sci. 10: (1997) |
| 36 | | Zena M. Ariola,
Matthias Felleisen:
The Call-By-Need lambda Calculus.
J. Funct. Program. 7(3): 265-301 (1997) |
| 1996 |
|---|
| 35 | | Cormac Flanagan,
Matthew Flatt,
Shriram Krishnamurthi,
Stephanie Weirich,
Matthias Felleisen:
Static Debugging: Browsing the Web of Program Invariants.
PLDI 1996: 23-32 |
| 34 | | Robert Cartwright,
Matthias Felleisen:
Program Verification Through Soft Typing.
ACM Comput. Surv. 28(2): 349-351 (1996) |
| 1995 |
|---|
| 33 | | J. Gregory Morrisett,
Matthias Felleisen,
Robert Harper:
Abstract Models of Memory Management.
FPCA 1995: 66-77 |
| 32 | | Cormac Flanagan,
Matthias Felleisen:
The Semantics of Future and Its Use in Program Optimizations.
POPL 1995: 209-220 |
| 31 | | Zena M. Ariola,
Matthias Felleisen,
John Maraist,
Martin Odersky,
Philip Wadler:
The Call-by-Need Lambda Calculus.
POPL 1995: 233-246 |
| 1994 |
|---|
| 30 | | Amr Sabry,
Matthias Felleisen:
Is Continuation-Passing Useful for Data Flow Analysis?
PLDI 1994: 1-12 |
| 29 | | Robert Cartwright,
Matthias Felleisen:
Extensible Denotational Language Specifications.
TACS 1994: 244-272 |
| 28 | | Robert Cartwright,
Pierre-Louis Curien,
Matthias Felleisen:
Fully Abstract Semantics for Observably Sequential Languages
Inf. Comput. 111(2): 297-401 (1994) |
| 27 | | Andrew K. Wright,
Matthias Felleisen:
A Syntactic Approach to Type Soundness
Inf. Comput. 115(1): 38-94 (1994) |
| 1993 |
|---|
| 26 | | Cormac Flanagan,
Amr Sabry,
Bruce F. Duba,
Matthias Felleisen:
The essence of compiling with continuations (with retrospective)
Best of PLDI 1993: 502-514 |
| 25 | | Cormac Flanagan,
Amr Sabry,
Bruce F. Duba,
Matthias Felleisen:
The Essence of Compiling with Continuations.
PLDI 1993: 237-247 |
| 24 | | Stephen Weeks,
Matthias Felleisen:
On the Orthogonality of Assignments and Procedures in Algol.
POPL 1993: 57-70 |
| 23 | | Amr Sabry,
Matthias Felleisen:
Reasoning about Programs in Continuation-Passing Style.
Lisp and Symbolic Computation 6(3-4): 289-360 (1993) |
| 1992 |
|---|
| 22 | | Amr Sabry,
Matthias Felleisen:
Reasoning About Programs in Continuation-Passing Style.
LISP and Functional Programming 1992: 288-298 |
| 21 | | Robert Cartwright,
Matthias Felleisen:
Observable Sequentiality and Full Abstraction.
POPL 1992: 328-342 |
| 20 | | Ramarao Kanneganti,
Robert Cartwright,
Matthias Felleisen:
SPCF: Its Model, Calculus, and Computational Power (Preliminary Version).
REX Workshop 1992: 318-347 |
| 19 | | Matthias Felleisen,
Robert Hieb:
The Revised Report on the Syntactic Theories of Sequential Control and State.
Theor. Comput. Sci. 103(2): 235-271 (1992) |
| 1991 |
|---|
| 18 | | Dorai Sitaram,
Matthias Felleisen:
Modeling Continuations without Continuations.
POPL 1991: 185-196 |
| 17 | | Erik Crank,
Matthias Felleisen:
Parameter-Passing and the Lambda Calculus.
POPL 1991: 233-244 |
| 16 | | Matthias Felleisen:
On the Expressive Power of Programming Languages.
Sci. Comput. Program. 17(1-3): 35-75 (1991) |
| 1990 |
|---|
| 15 | | Matthias Felleisen:
On the Expressive Power of Programming Languages.
ESOP 1990: 134-151 |
| 14 | | Dorai Sitaram,
Matthias Felleisen:
Reasoning with Continuations II: Full Abstraction for Models of Control.
LISP and Functional Programming 1990: 161-175 |
| 13 | | Dorai Sitaram,
Matthias Felleisen:
Control Delimiters and Their Hierarchies.
Lisp and Symbolic Computation 3(1): 67-99 (1990) |
| 1989 |
|---|
| 12 | | Robert Cartwright,
Matthias Felleisen:
The Semantics of Program Dependence.
PLDI 1989: 13-27 |
| 11 | | Matthias Felleisen,
Daniel P. Friedman:
A Syntactic Theory of Sequential State.
Theor. Comput. Sci. 69(3): 243-287 (1989) |
| 1988 |
|---|
| 10 | | Matthias Felleisen,
Mitchell Wand,
Daniel P. Friedman,
Bruce F. Duba:
Abstract Continuations: A Mathematical Semantics for Handling Full Jumps.
LISP and Functional Programming 1988: 52-62 |
| 9 | | Matthias Felleisen:
lambda-V-CS: An Extended lambda-Calculus for Scheme.
LISP and Functional Programming 1988: 72-85 |
| 8 | | Matthias Felleisen:
The Theory and Practice of First-Class Prompts.
POPL 1988: 180-190 |
| 1987 |
|---|
| 7 | | Matthias Felleisen,
Daniel P. Friedman:
A Reduction Semantics for Imperative Higher-Order Languages.
PARLE (2) 1987: 206-223 |
| 6 | | Matthias Felleisen,
Daniel P. Friedman:
A Calculus for Assignments in Higher-Order Languages.
POPL 1987: 314-325 |
| 5 | | Matthias Felleisen:
Reflections on Landins's J-Operator: A Partly Historical Note.
Comput. Lang. 12(3/4): 197-207 (1987) |
| 4 | | Matthias Felleisen,
Daniel P. Friedman,
Eugene E. Kohlbecker,
Bruce F. Duba:
A Syntactic Theory of Sequential Control.
Theor. Comput. Sci. 52: 205-237 (1987) |
| 1986 |
|---|
| 3 | | Matthias Felleisen,
Daniel P. Friedman,
Eugene E. Kohlbecker,
Bruce F. Duba:
Reasoning with Continuations
LICS 1986: 131-141 |
| 2 | | Eugene E. Kohlbecker,
Daniel P. Friedman,
Matthias Felleisen,
Bruce F. Duba:
Hygienic Macro Expansion.
LISP and Functional Programming 1986: 151-161 |
| 1 | | Matthias Felleisen,
Daniel P. Friedman:
A Closer Look at Export and Import Statements.
Comput. Lang. 11(1): 29-37 (1986) |
