Matthias Felleisen - researchr alias

researchr

You are not signed in
Sign in
Sign up

2012

Run your research: on the effectiveness of lightweight mechanizationCasey Klein, John Clements, Christos Dimoulas, Carl Eastlund, Matthias Felleisen, Matthew Flatt, Jay A. McCarthy, Jon Rafkind, Sam Tobin-Hochstadt, Robby Findler. In Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2012, Philadelphia, Pennsylvania, USA, January 22-28, 2012. 2012: 285-296 [doi]

2011

Correct blame for contracts: no more scapegoatingChristos Dimoulas, Robert Bruce Findler, Cormac Flanagan, Matthias Felleisen. POPL 2011: 215-226 [doi]

Languages as librariesSam Tobin-Hochstadt, Vincent St-Amour, Ryan Culpepper, Matthew Flatt, Matthias Felleisen. PLDI 2011: 132-141 [doi]

2010

2009

Future contractsChristos Dimoulas, Riccardo Pucella, Matthias Felleisen. ppdp 2009: 195-206 [doi]

Toward a Practical Module System for ACL2Carl Eastlund, Matthias Felleisen. padl 2009: 46-60 [doi]

Making induction manifest in modular ACL2Carl Eastlund, Matthias Felleisen. ppdp 2009: 105-116 [doi]

A functional I/O system or, fun for freshman kidsMatthias Felleisen, Robby Findler, Matthew Flatt, Shriram Krishnamurthi. ICFP 2009: 47-58 [doi]

Semantics Engineering with PLT RedexMatthias Felleisen, Robert Bruce Findler, Matthew Flatt. MIT Press, 2009. [doi]

Semantics Engineering with PLT RedexMatthias Felleisen, Robby Findler, Matthew Flatt. MIT Press, 2009.

Viewpoint - Why computer science doesn t matterMatthias Felleisen, Shriram Krishnamurthi. CACM, 52(7):37-40, 2009. [doi]

EditorialXavier Leroy, Matthias Felleisen. JFP, 19(5):489-490, 2009. [doi]

Practical Variable-Arity PolymorphismT. Stephen Strickland, Sam Tobin-Hochstadt, Matthias Felleisen. ESOP 2009: 32-46 [doi]

Contracts for first-class modulesT. Stephen Strickland, Matthias Felleisen. DLS 2009: 27-38 [doi]

2008

Why teach programming languages in this day and age and how to go about itMatthias Felleisen. SIGPLAN, 43(11):59-61, 2008. [doi]

The design and implementation of typed schemeSam Tobin-Hochstadt, Matthias Felleisen. POPL 2008: 395-406 [doi]

2007

2006

2005

2004

Validating the Unit Correctness of Spreadsheet ProgramsTudor Antoniu, Paul A. Steckler, Shriram Krishnamurthi, Erich Neuwirth, Matthias Felleisen. ICSE 2004: 439-448 [doi]

A tail-recursive machine with stack inspectionJohn Clements, Matthias Felleisen. TOPLAS, 26(6):1029-1052, 2004. [doi]

Taming MacrosRyan Culpepper, Matthias Felleisen. GPCE 2004: 225-243 [doi]

Functional ObjectsMatthias Felleisen. ECOOP 2004: 267 [doi]

The structure and interpretation of the computer science curriculumMatthias Felleisen, Robby Findler, Matthew Flatt, Shriram Krishnamurthi. JFP, 14(4):365-378, 2004. [doi]

Semantic Casts: Contracts and Structural Subtyping in a Nominal WorldRobby Findler, Matthew Flatt, Matthias Felleisen. ECOOP 2004: 364-388 [doi]

Automatically Restructuring Programs for the WebJacob Matthews, Robby Findler, Paul T. Graunke, Shriram Krishnamurthi, Matthias Felleisen. ASE, 11(4):337-364, 2004. [doi]

A Visual Environment for Developing Context-Sensitive Term Rewriting SystemsJacob Matthews, Robby Findler, Matthew Flatt, Matthias Felleisen. RTA 2004: 301-311 [doi]

2003

A Tail-Recursive Semantics for Stack InspectionsJohn Clements, Matthias Felleisen. ESOP 2003: 22-37 [doi]

Welcome to the Educational Pearls ColumnMatthias Felleisen. JFP, 13(5):835-838, 2003. [doi]

Modeling Web InteractionsPaul T. Graunke, Robby Findler, Shriram Krishnamurthi, Matthias Felleisen. ESOP 2003: 238-252 [doi]

2002

2001

1999

Safety as a MetricMatthias Felleisen, Robert Cartwright. csee 1999: 129-131 [doi]

The Semantics of Future and an ApplicationCormac Flanagan, Matthias Felleisen. JFP, 9(1):1-31, 1999.

Componential Set-Based AnalysisCormac Flanagan, Matthias Felleisen. TOPLAS, 21(2):370-416, 1999. [doi]

Programming Languages as Operating Systems (or Revenge of the Son of the Lisp Machine)Matthew Flatt, Robby Findler, Shriram Krishnamurthi, Matthias Felleisen. ICFP 1999: 138-147 [doi]

A Programmer s Reduction Semantics for Classes and MixinsMatthew Flatt, Shriram Krishnamurthi, Matthias Felleisen. java 1999: 241-269 [doi]

Expressing Structural Properties as Language ConstructsShriram Krishnamurthi, Yan-David Erlich, Matthias Felleisen. ESOP 1999: 258-272 [doi]

From Macros to Reusable Generative ProgrammingShriram Krishnamurthi, Matthias Felleisen, Bruce F. Duba. gcse 2000: 105-120 [doi]

1998

1997

1996

Program Verification Through Soft TypingRobert Cartwright, Matthias Felleisen. ACM Comput. Surv., 28(2):349-351, 1996.

The little MLerMatthias Felleisen, Daniel P. Friedman. MIT Press, 1996.

A little Java, a few patternsMatthias Felleisen, Daniel P. Friedman. MIT Press, 1996.

Static Debugging: Browsing the Web of Program InvariantsCormac Flanagan, Matthew Flatt, Shriram Krishnamurthi, Stephanie Weirich, Matthias Felleisen. PLDI 1996: 23-32

The little schemer (4. ed.)Daniel P. Friedman, Matthias Felleisen. MIT Press, 1996.

The seasoned schemerDaniel P. Friedman, Matthias Felleisen. MIT Press, 1996.

1995

The Call-by-Need Lambda CalculusZena M. Ariola, Matthias Felleisen, John Maraist, Martin Odersky, Philip Wadler. POPL 1995: 233-246

The Semantics of Future and Its Use in Program OptimizationsCormac Flanagan, Matthias Felleisen. POPL 1995: 209-220

Abstract Models of Memory ManagementJ. Gregory Morrisett, Matthias Felleisen, Robert Harper. fpca 1995: 66-77

1994

Extensible Denotational Language SpecificationsRobert Cartwright, Matthias Felleisen. tacs 1994: 244-272

Fully Abstract Semantics for Observably Sequential LanguagesRobert Cartwright, Pierre-Louis Curien, Matthias Felleisen. iandc, 111(2):297-401, June 1994.

Is Continuation-Passing Useful for Data Flow Analysis?Amr Sabry, Matthias Felleisen. PLDI 1994: 1-12

A Syntactic Approach to Type SoundnessAndrew K. Wright, Matthias Felleisen. iandc, 115(1):38-94, November 1994.

1993

1992

Observable Sequentiality and Full AbstractionRobert Cartwright, Matthias Felleisen. POPL 1992: 328-342

The Revised Report on the Syntactic Theories of Sequential Control and StateMatthias Felleisen, Robert Hieb. TCS, 103(2):235-271, 1992.

SPCF: Its Model, Calculus, and Computational Power (Preliminary Version)Ramarao Kanneganti, Robert Cartwright, Matthias Felleisen. rex 1993: 318-347

Reasoning About Programs in Continuation-Passing StyleAmr Sabry, Matthias Felleisen. lfp 1992: 288-298 [doi]

1991

Parameter-Passing and the Lambda CalculusErik Crank, Matthias Felleisen. POPL 1991: 233-244

On the Expressive Power of Programming LanguagesMatthias Felleisen. SCP, 17(1-3):35-75, 1991.

Modeling Continuations without ContinuationsDorai Sitaram, Matthias Felleisen. POPL 1991: 185-196

1990

On the Expressive Power of Programming LanguagesMatthias Felleisen. ESOP 1990: 134-151

Control Delimiters and Their HierarchiesDorai Sitaram, Matthias Felleisen. lisp, 3(1):67-99, 1990.

Reasoning with Continuations II: Full Abstraction for Models of ControlDorai Sitaram, Matthias Felleisen. lfp 1990: 161-175 [doi]

PreviousNext