Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Matthias Felleisen
2010 – today
- 2013
[e3]Matthias Felleisen, Philippa Gardner (Eds.): Programming Languages and Systems - 22nd European Symposium on Programming, ESOP 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings. Lecture Notes in Computer Science 7792, Springer 2013, ISBN 978-3-642-37035-9- 2012
- [j31]
- [c84]
- [c83]Christos Dimoulas, Sam Tobin-Hochstadt, Matthias Felleisen: Complete Monitors for Behavioral Contracts. ESOP 2012: 214-233
- [c82]Vincent St-Amour, Sam Tobin-Hochstadt, Matthias Felleisen: Optimization coaching: optimizers learn to communicate with programmers. OOPSLA 2012: 163-178
- [c81]Asumu Takikawa, T. Stephen Strickland, Christos Dimoulas, Sam Tobin-Hochstadt, Matthias Felleisen: Gradual typing for first-class classes. OOPSLA 2012: 793-810
- [c80]Vincent St-Amour, Sam Tobin-Hochstadt, Matthew Flatt, Matthias Felleisen: Typing the Numeric Tower. PADL 2012: 289-303
- [c79]Casey Klein, John Clements, Christos Dimoulas, Carl Eastlund, Matthias Felleisen, Matthew Flatt, Jay A. McCarthy, Jon Rafkind, Sam Tobin-Hochstadt, Robert Bruce Findler: Run your research: on the effectiveness of lightweight mechanization. POPL 2012: 285-296
- [i4]Stephen Chang, Matthias Felleisen: The Call-by-need Lambda Calculus, Revisited. CoRR abs/1201.3907 (2012)
- 2011
- [j30]Christos Dimoulas, Matthias Felleisen: On contract satisfaction in a higher-order world. ACM Trans. Program. Lang. Syst. 33(5): 16 (2011)
- [c78]
- [c77]Stephen Chang, Eli Barzilay, John Clements, Matthias Felleisen: From Stack Traces to Lazy Rewriting Sequences. IFL 2011: 100-115
- [c76]Sam Tobin-Hochstadt, Vincent St-Amour, Ryan Culpepper, Matthew Flatt, Matthias Felleisen: Languages as libraries. PLDI 2011: 132-141
- [c75]Christos Dimoulas, Robert Bruce Findler, Cormac Flanagan, Matthias Felleisen: Correct blame for contracts: no more scapegoating. POPL 2011: 215-226
- [c74]
- [i3]Sam Tobin-Hochstadt, Matthias Felleisen: The Design and Implementation of Typed Scheme: From Scripts to Programs. CoRR abs/1106.2575 (2011)
- [i2]Stephen Chang, John Clements, Eli Barzilay, Matthias Felleisen: Stepping Lazy Programs. CoRR abs/1108.4706 (2011)
- 2010
- [j29]Ryan Culpepper, Matthias Felleisen: Debugging hygienic macros. Sci. Comput. Program. 75(7): 496-515 (2010)
- [c73]
- [c72]
- [c71]
- [c70]
- [c69]Stephen Chang, David Van Horn, Matthias Felleisen: Evaluating Call-by-Need on the Control Stack. Trends in Functional Programming 2010: 1-15
- [c68]Carl Eastlund, Matthias Felleisen: Hygienic Macros for ACL2. Trends in Functional Programming 2010: 84-101
- [c67]
- [i1]Stephen Chang, David Van Horn, Matthias Felleisen: Evaluating Call-By-Need on the Control Stack. CoRR abs/1009.3174 (2010)
2000 – 2009
- 2009
- [b5]Matthias Felleisen, Robert Bruce Findler, Matthew Flatt: Semantics Engineering with PLT Redex. MIT Press 2009, ISBN 978-0-262-06275-6, pp. I-XII, 1-502
- [j28]Matthias Felleisen, Shriram Krishnamurthi: Viewpoint - Why computer science doesn't matter. Commun. ACM 52(7): 37-40 (2009)
- [j27]
- [c66]
- [c65]T. Stephen Strickland, Sam Tobin-Hochstadt, Matthias Felleisen: Practical Variable-Arity Polymorphism. ESOP 2009: 32-46
- [c64]Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, Shriram Krishnamurthi: A functional I/O system or, fun for freshman kids. ICFP 2009: 47-58
- [c63]
- [c62]
- [c61]
- 2008
- [j26]Matthias Felleisen: Why teach programming languages in this day and age and how to go about it. SIGPLAN Notices 43(11): 59-61 (2008)
- [c60]Sam Tobin-Hochstadt, Matthias Felleisen: The design and implementation of typed scheme. POPL 2008: 395-406
- 2007
- [j25]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)
- [c59]
- [c58]Matthew Flatt, Gang Yu, Robert Bruce Findler, Matthias Felleisen: Adding delimited and composable control to a production programming environment. ICFP 2007: 165-176
- [e2]Martin Hofmann, Matthias Felleisen (Eds.): Proceedings of the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2007, Nice, France, January 17-19, 2007. ACM 2007, ISBN 1-59593-575-4
- 2006
- [c57]
- [c56]Matthew Flatt, Robert Bruce Findler, Matthias Felleisen: Scheme with Classes, Mixins, and Traits. APLAS 2006: 270-289
- [c55]Sam Tobin-Hochstadt, Matthias Felleisen: Interlanguage migration: from scripts to programs. OOPSLA Companion 2006: 964-974
- [c54]Philippe Meunier, Robert Bruce Findler, Matthias Felleisen: Modular set-based analysis from contracts. POPL 2006: 218-231
- 2005
- [j24]Matthias Felleisen, Julia L. Lawall, Manuel Serrano, Olin Shivers: Editorial. Higher-Order and Symbolic Computation 18(3-4): 243-244 (2005)
- [c53]Greg Pettyjohn, John Clements, Joe Marshall, Shriram Krishnamurthi, Matthias Felleisen: Continuations from generalized stack inspection. ICFP 2005: 216-227
- [c52]
- 2004
- [j23]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)
- [j22]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)
- [j21]John Clements, Matthias Felleisen: A tail-recursive machine with stack inspection. ACM Trans. Program. Lang. Syst. 26(6): 1029-1052 (2004)
- [c51]
- [c50]Robert Bruce Findler, Matthew Flatt, Matthias Felleisen: Semantic Casts: Contracts and Structural Subtyping in a Nominal World. ECOOP 2004: 364-388
- [c49]
- [c48]Tudor Antoniu, Paul A. Steckler, Shriram Krishnamurthi, Erich Neuwirth, Matthias Felleisen: Validating the Unit Correctness of Spreadsheet Programs. ICSE 2004: 439-448
- [c47]Jacob Matthews, Robert Bruce Findler, Matthew Flatt, Matthias Felleisen: A Visual Environment for Developing Context-Sensitive Term Rewriting Systems. RTA 2004: 301-311
- 2003
- [j20]Matthias Felleisen: Welcome to the Educational Pearls Column. J. Funct. Program. 13(5): 835-838 (2003)
- [c46]John Clements, Matthias Felleisen: A Tail-Recursive Semantics for Stack Inspections. ESOP 2003: 22-37
- [c45]Paul T. Graunke, Robert Bruce Findler, Shriram Krishnamurthi, Matthias Felleisen: Modeling Web Interactions. ESOP 2003: 238-252
- 2002
- [j19]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)
- [c44]Matthias Felleisen: Developing Interactive Web Programs. Advanced Functional Programming 2002: 100-128
- [c43]
- [c42]Mark Logan, Matthias Felleisen, David N. Blank-Edelman: Environmental Acquisition in Network Management. LISA 2002: 175-184
- [c41]
- 2001
- [j18]Ron Cytron, Matthias Felleisen: SIGPLAN Response to the Ironman Draft of the Computing Curricula 2001. SIGPLAN Notices 36(4): 3-4 (2001)
- [c40]Paul T. Graunke, Shriram Krishnamurthi, Steve Van Der Hoeven, Matthias Felleisen: Programming the Web with High-Level Programming Languages. ESOP 2001: 122-136
- [c39]
- [c38]Paul T. Graunke, Robert Bruce Findler, Shriram Krishnamurthi, Matthias Felleisen: Automatically Restructuring Programs for the We. ASE 2001: 211-222
- [c37]Robert Bruce Findler, Matthias Felleisen: Contract Soundness for Object-Oriented Languages. OOPSLA 2001: 1-15
- [c36]Robert Bruce Findler, Mario Latendresse, Matthias Felleisen: Behavioral contracts and behavioral subtyping. ESEC / SIGSOFT FSE 2001: 229-236
- 2000
- [j17]Matthias Felleisen: Components and program analyses. ACM SIGSOFT Software Engineering Notes 25(1): 49-50 (2000)
1990 – 1999
- 1999
- [j16]Cormac Flanagan, Matthias Felleisen: The Semantics of Future and an Application. J. Funct. Program. 9(1): 1-31 (1999)
- [j15]Cormac Flanagan, Matthias Felleisen: Componential Set-Based Analysis. ACM Trans. Program. Lang. Syst. 21(2): 370-416 (1999)
- [c35]
- [c34]Shriram Krishnamurthi, Yan-David Erlich, Matthias Felleisen: Expressing Structural Properties as Language Constructs. ESOP 1999: 258-272
- [c33]Shriram Krishnamurthi, Matthias Felleisen, Bruce F. Duba: From Macros to Reusable Generative Programming. GCSE 1999: 105-120
- [c32]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
- [c31]Matthew Flatt, Shriram Krishnamurthi, Matthias Felleisen: A Programmer's Reduction Semantics for Classes and Mixins. Formal Syntax and Semantics of Java 1999: 241-269
- 1998
- [j14]Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, Shriram Krishnamurthi: The DrScheme Project: An Overview. SIGPLAN Notices 33(6): 17-23 (1998)
- [c30]Shriram Krishnamurthi, Matthias Felleisen, Daniel P. Friedman: Synthesizing Object-Oriented and Functional Design to Promote Re-Use. ECOOP 1998: 91-113
- [c29]
- [c28]
- [c27]Shriram Krishnamurthi, Matthias Felleisen: Toward a Formal Theory of Extensible Software. SIGSOFT FSE 1998: 88-98
- [e1]Matthias Felleisen, Paul Hudak, Christian Queinnec (Eds.): Proceedings of the third ACM SIGPLAN International Conference on Functional Programming (ICFP '98), Baltimore, Maryland, USA, September 27-29, 1998. ACM 1998, ISBN 0-58113-024-4
- 1997
- [j13]Matthew Flatt, Matthias Felleisen: Program Units as Higher-Order Modules. Electr. Notes Theor. Comput. Sci. 10: 204-229 (1997)
- [j12]Zena M. Ariola, Matthias Felleisen: The Call-By-Need lambda Calculus. J. Funct. Program. 7(3): 265-301 (1997)
- [c26]
- [c25]Robert Bruce Findler, Cormac Flanagan, Matthew Flatt, Shriram Krishnamurthi, Matthias Felleisen: DrScheme: A Pedagogic Programming Environment for Scheme. PLILP 1997: 369-388
- 1996
- [b4]Daniel P. Friedman, Matthias Felleisen: The little schemer (4. ed.). MIT Press 1996, ISBN 978-0-262-56099-3, pp. I-XIII, 1-196
- [b3]Daniel P. Friedman, Matthias Felleisen: The seasoned schemer. MIT Press 1996, ISBN 978-0-262-56100-6, pp. I-XIII, 1-210
- [b2]Matthias Felleisen, Daniel P. Friedman: A little Java, a few patterns. MIT Press 1996, ISBN 978-0-262-56115-0, pp. I-XIV, 1-179
- [b1]Matthias Felleisen, Daniel P. Friedman: The little MLer. MIT Press 1996, ISBN 978-0-262-56114-3, pp. I-XVI, 1-181
- [j11]Robert Cartwright, Matthias Felleisen: Program Verification Through Soft Typing. ACM Comput. Surv. 28(2): 349-351 (1996)
- [c24]Cormac Flanagan, Matthew Flatt, Shriram Krishnamurthi, Stephanie Weirich, Matthias Felleisen: Static Debugging: Browsing the Web of Program Invariants. PLDI 1996: 23-32
- 1995
- [c23]J. Gregory Morrisett, Matthias Felleisen, Robert Harper: Abstract Models of Memory Management. FPCA 1995: 66-77
- [c22]Cormac Flanagan, Matthias Felleisen: The Semantics of Future and Its Use in Program Optimizations. POPL 1995: 209-220
- [c21]Zena M. Ariola, Matthias Felleisen, John Maraist, Martin Odersky, Philip Wadler: The Call-by-Need Lambda Calculus. POPL 1995: 233-246
- 1994
- [j10]Robert Cartwright, Pierre-Louis Curien, Matthias Felleisen: Fully Abstract Semantics for Observably Sequential Languages. Inf. Comput. 111(2): 297-401 (1994)
- [j9]Andrew K. Wright, Matthias Felleisen: A Syntactic Approach to Type Soundness. Inf. Comput. 115(1): 38-94 (1994)
- [c20]
- [c19]Robert Cartwright, Matthias Felleisen: Extensible Denotational Language Specifications. TACS 1994: 244-272
- 1993
- [j8]Amr Sabry, Matthias Felleisen: Reasoning about Programs in Continuation-Passing Style. Lisp and Symbolic Computation 6(3-4): 289-360 (1993)
- [c18]Cormac Flanagan, Amr Sabry, Bruce F. Duba, Matthias Felleisen: The Essence of Compiling with Continuations. PLDI 1993: 237-247
- [c17]Cormac Flanagan, Amr Sabry, Bruce F. Duba, Matthias Felleisen: The essence of compiling with continuations (with retrospective). Best of PLDI 1993: 502-514
- [c16]Stephen Weeks, Matthias Felleisen: On the Orthogonality of Assignments and Procedures in Algol. POPL 1993: 57-70
- 1992
- [j7]Matthias Felleisen, Robert Hieb: The Revised Report on the Syntactic Theories of Sequential Control and State. Theor. Comput. Sci. 103(2): 235-271 (1992)
- [c15]Amr Sabry, Matthias Felleisen: Reasoning About Programs in Continuation-Passing Style. LISP and Functional Programming 1992: 288-298
- [c14]Robert Cartwright, Matthias Felleisen: Observable Sequentiality and Full Abstraction. POPL 1992: 328-342
- [c13]Ramarao Kanneganti, Robert Cartwright, Matthias Felleisen: SPCF: Its Model, Calculus, and Computational Power (Preliminary Version). REX Workshop 1992: 318-347
- 1991
- [j6]Matthias Felleisen: On the Expressive Power of Programming Languages. Sci. Comput. Program. 17(1-3): 35-75 (1991)
- [c12]
- [c11]
- 1990
- [j5]Dorai Sitaram, Matthias Felleisen: Control Delimiters and Their Hierarchies. Lisp and Symbolic Computation 3(1): 67-99 (1990)
- [c10]
- [c9]Dorai Sitaram, Matthias Felleisen: Reasoning with Continuations II: Full Abstraction for Models of Control. LISP and Functional Programming 1990: 161-175
1980 – 1989
- 1989
- [j4]Matthias Felleisen, Daniel P. Friedman: A Syntactic Theory of Sequential State. Theor. Comput. Sci. 69(3): 243-287 (1989)
- [c8]
- 1988
- [c7]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
- [c6]Matthias Felleisen: lambda-V-CS: An Extended lambda-Calculus for Scheme. LISP and Functional Programming 1988: 72-85
- [c5]
- 1987
- [j3]Matthias Felleisen: Reflections on Landins's J-Operator: A Partly Historical Note. Comput. Lang. 12(3/4): 197-207 (1987)
- [j2]Matthias Felleisen, Daniel P. Friedman, Eugene E. Kohlbecker, Bruce F. Duba: A Syntactic Theory of Sequential Control. Theor. Comput. Sci. 52: 205-237 (1987)
- [c4]Matthias Felleisen, Daniel P. Friedman: A Reduction Semantics for Imperative Higher-Order Languages. PARLE (2) 1987: 206-223
- [c3]Matthias Felleisen, Daniel P. Friedman: A Calculus for Assignments in Higher-Order Languages. POPL 1987: 314-325
- 1986
- [j1]Matthias Felleisen, Daniel P. Friedman: A Closer Look at Export and Import Statements. Comput. Lang. 11(1): 29-37 (1986)
- [c2]Eugene E. Kohlbecker, Daniel P. Friedman, Matthias Felleisen, Bruce F. Duba: Hygienic Macro Expansion. LISP and Functional Programming 1986: 151-161
- [c1]Matthias Felleisen, Daniel P. Friedman, Eugene E. Kohlbecker, Bruce F. Duba: Reasoning with Continuations. LICS 1986: 131-141
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-12 21:33 CEST by the dblp team