default search action
Matthias Felleisen
Person information
- affiliation: Northeastern University, Boston, USA
- award (2012): Programming Languages Achievement Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j52]Ashton Wiersdorf, Stephen Chang, Matthias Felleisen, Ben Greenman:
Type Tailoring (Artifact). Dagstuhl Artifacts Ser. 10(2): 24:1-24:2 (2024) - [j51]Samuel Caldwell, Tony Garnock-Jones, Matthias Felleisen:
Programming and reasoning about actors that share state. J. Funct. Program. 34 (2024) - [j50]Cameron Moy
, Christos Dimoulas
Effectful Software Contracts. Proc. ACM Program. Lang. 8(POPL): 2639-2666 (2024) - [c103]Ashton Wiersdorf, Stephen Chang, Matthias Felleisen, Ben Greenman:
Type Tailoring. ECOOP 2024: 44:1-44:27 - [i8]Leif Andersen, Cameron Moy, Stephen Chang, Matthias Felleisen:
Making Hybrid Languages: A Recipe. CoRR abs/2403.01335 (2024) - 2023
- [j49]Cameron Moy
Trace contracts. J. Funct. Program. 33 (2023) - [j48]Lukas Lazarek
How to Evaluate Blame for Gradual Types, Part 2. Proc. ACM Program. Lang. 7(ICFP): 159-186 (2023) - [j47]Ben Greenman
How Profilers Can Help Navigate Type Migration. Proc. ACM Program. Lang. 7(OOPSLA2): 544-573 (2023) - [j46]Ben Greenman
Typed-Untyped Interactions: A Comparative Analysis. ACM Trans. Program. Lang. Syst. 45(1): 4:1-4:54 (2023) - [c102]Michael Ballantyne, Matthias Felleisen:
Injecting Language Workbench Technology into Mainstream Languages. Eelco Visser Commemorative Symposium 2023: 3:1-3:11 - 2022
- [j45]Ben Greenman
A Transient Semantics for Typed Racket. Art Sci. Eng. Program. 6(2): 9 (2022) - 2021
- [j44]Lukas Lazarek, Ben Greenman
How to evaluate blame for gradual types. Proc. ACM Program. Lang. 5(ICFP): 1-29 (2021) - [i7]Ben Greenman, Lukas Lazarek, Christos Dimoulas, Matthias Felleisen:
A Transient Semantics for Typed Racket. CoRR abs/2111.10411 (2021) - 2020
- [j43]Samuel Caldwell, Tony Garnock-Jones, Matthias Felleisen:
Typed dataspace actors. J. Funct. Program. 30: e27 (2020) - [j42]Leif Andersen
Adding interactive visual syntax to textual code. Proc. ACM Program. Lang. 4(OOPSLA): 222:1-222:28 (2020) - [j41]Michael Ballantyne, Alexis King, Matthias Felleisen:
Macros for domain-specific languages. Proc. ACM Program. Lang. 4(OOPSLA): 229:1-229:29 (2020) - [i6]Leif Andersen, Michael Ballantyne, Matthias Felleisen:
Adding Interactive Visual Syntax to Textual Code. CoRR abs/2010.12695 (2020)
2010 – 2019
- 2019
- [j40]Ben Greenman
How to evaluate the performance of gradual type systems. J. Funct. Program. 29: e4 (2019) - [j39]Ben Greenman
Complete monitors for gradual types. Proc. ACM Program. Lang. 3(OOPSLA): 122:1-122:29 (2019) - [j38]Leif Andersen
Feature-Specific Profiling. ACM Trans. Program. Lang. Syst. 41(1): 4:1-4:34 (2019) - [c101]Ryan Culpepper, Matthias Felleisen, Matthew Flatt, Shriram Krishnamurthi
From Macros to DSLs: The Evolution of Racket. SNAPL 2019: 5:1-5:19 - 2018
- [j37]Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, Shriram Krishnamurthi
A programmable programming language. Commun. ACM 61(3): 62-71 (2018) - [j36]Ben Greenman
A spectrum of type soundness and performance. Proc. ACM Program. Lang. 2(ICFP): 71:1-71:32 (2018) - [i5]Leif Andersen, Vincent St-Amour, Jan Vitek, Matthias Felleisen:
Feature-Specific Profiling. CoRR abs/1809.04151 (2018) - 2017
- [j35]Leif Andersen, Stephen Chang
Super 8 languages for making movies (functional pearl). Proc. ACM Program. Lang. 1(ICFP): 30:1-30:29 (2017) - [c100]Sam Tobin-Hochstadt
Migratory Typing: Ten Years Later. SNAPL 2017: 17:1-17:17 - 2016
- [c99]Tony Garnock-Jones, Matthias Felleisen:
Coordinated Concurrent Programming in Syndicate. ESOP 2016: 310-336 - [c98]Christos Dimoulas, Max S. New, Robert Bruce Findler, Matthias Felleisen:
Oh Lord, please don't let contracts be misunderstood (functional pearl). ICFP 2016: 117-131 - [c97]Asumu Takikawa, Daniel Feltey, Ben Greenman
Is sound gradual typing dead? POPL 2016: 456-468 - 2015
- [c96]Vincent St-Amour, Leif Andersen, Matthias Felleisen:
Feature-Specific Profiling. CC 2015: 49-68 - [c95]Asumu Takikawa, Daniel Feltey, Earl Dean, Matthew Flatt, Robert Bruce Findler, Sam Tobin-Hochstadt
Towards Practical Gradual Typing. ECOOP 2015: 4-27 - [c94]Emmanuel Schanzer
Transferring Skills at Solving Word Problems from Computing to Algebra Through Bootstrap. SIGCSE 2015: 616-621 - [c93]Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, Shriram Krishnamurthi
The Racket Manifesto. SNAPL 2015: 113-128 - 2014
- [j34]Matthias Felleisen:
Editorial. J. Funct. Program. 24(6): 611 (2014) - [c92]Tony Garnock-Jones, Sam Tobin-Hochstadt
The Network as a Language Construct. ESOP 2014: 473-492 - [c91]Stephen Chang
Profiling for laziness. POPL 2014: 349-360 - 2013
- [b6]Matthias Felleisen, David Van Horn, Conrad Barski:
Realm of Racket - Learn to Program, One Game at a Time! No Starch Press 2013, ISBN 978-1-59327-491-7, pp. I-XVIII, 1-294 - [j33]Robert Bruce Findler, Matthias Felleisen:
ICFP 2002: Contracts for higher-order functions. ACM SIGPLAN Notices 48(4S): 34-45 (2013) - [j32]T. Stephen Strickland, Christos Dimoulas
Contracts for First-Class Classes. ACM Trans. Program. Lang. Syst. 35(3): 11:1-11:58 (2013) - [c90]Christos Dimoulas
Option contracts. OOPSLA 2013: 475-494 - [e3]Matthias Felleisen, Philippa Gardner:
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 [contents] - 2012
- [j31]Matthias Felleisen:
Editorial. J. Funct. Program. 22(3): 223-224 (2012) - [c89]Stephen Chang
The Call-by-Need Lambda Calculus, Revisited. ESOP 2012: 128-147 - [c88]Christos Dimoulas
Complete Monitors for Behavioral Contracts. ESOP 2012: 214-233 - [c87]Vincent St-Amour, Sam Tobin-Hochstadt
Optimization coaching: optimizers learn to communicate with programmers. OOPSLA 2012: 163-178 - [c86]Asumu Takikawa, T. Stephen Strickland, Christos Dimoulas
Gradual typing for first-class classes. OOPSLA 2012: 793-810 - [c85]Vincent St-Amour, Sam Tobin-Hochstadt
Typing the Numeric Tower. PADL 2012: 289-303 - [c84]Casey Klein, John Clements, Christos Dimoulas
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
On contract satisfaction in a higher-order world. ACM Trans. Program. Lang. Syst. 33(5): 16:1-16:29 (2011) - [c83]Matthias Felleisen:
Multilingual component programming in racket. GPCE 2011: 1-2 - [c82]Stephen Chang, Eli Barzilay, John Clements, Matthias Felleisen:
From Stack Traces to Lazy Rewriting Sequences. IFL 2011: 100-115 - [c81]Sam Tobin-Hochstadt
Languages as libraries. PLDI 2011: 132-141 - [c80]Christos Dimoulas
Correct blame for contracts: no more scapegoating. POPL 2011: 215-226 - [c79]Matthias Felleisen:
TeachScheme! SIGCSE 2011: 1-2 - [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) - [c78]T. Stephen Strickland, Matthias Felleisen:
Contracts for first-class classes. DLS 2010: 97-112 - [c77]Sam Tobin-Hochstadt
Logical types for untyped languages. ICFP 2010: 117-128 - [c76]Matthias Felleisen:
TeachScheme!: a checkpoint. ICFP 2010: 129-130 - [c75]Ryan Culpepper, Matthias Felleisen:
Fortifying macros. ICFP 2010: 235-246 - [c74]Stephen Chang, David Van Horn, Matthias Felleisen:
Evaluating Call-by-Need on the Control Stack. Trends in Functional Programming 2010: 1-15 - [c73]Carl Eastlund, Matthias Felleisen:
Hygienic Macros for ACL2. Trends in Functional Programming 2010: 84-101 - [c72]Matthias Felleisen:
Adding types to untyped languages. TLDI 2010: 1-2 - [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]Xavier Leroy, Matthias Felleisen:
Editorial. J. Funct. Program. 19(5): 489-490 (2009) - [c71]T. Stephen Strickland, Matthias Felleisen:
Contracts for first-class modules. DLS 2009: 27-38 - [c70]T. Stephen Strickland, Sam Tobin-Hochstadt, Matthias Felleisen:
Practical Variable-Arity Polymorphism. ESOP 2009: 32-46 - [c69]Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, Shriram Krishnamurthi
A functional I/O system or, fun for freshman kids. ICFP 2009: 47-58 - [c68]T. Stephen Strickland, Matthias Felleisen:
Nested and Dynamic Contract Boundaries. IFL 2009: 141-158 - [c67]Carl Eastlund, Matthias Felleisen:
Toward a Practical Module System for ACL2. PADL 2009: 46-60 - [c66]Carl Eastlund, Matthias Felleisen:
Making induction manifest in modular ACL2. PPDP 2009: 105-116 - [c65]Christos Dimoulas, Riccardo Pucella, Matthias Felleisen:
Future contracts. PPDP 2009: 195-206 - 2008
- [j26]Matthias Felleisen:
Why teach programming languages in this day and age and how to go about it. ACM SIGPLAN Notices 43(11): 59-61 (2008) - [c64]Rex L. Page, Carl Eastlund, Matthias Felleisen:
Functional programming and theorem proving for undergraduates: a progress report. FDPE@ICFP 2008: 21-30 - [c63]Sam Tobin-Hochstadt
The design and implementation of typed scheme. POPL 2008: 395-406 - 2007
- [j25]Shriram Krishnamurthi
Implementation and use of the PLT scheme Web server. High. Order Symb. Comput. 20(4): 431-460 (2007) - [c62]Ryan Culpepper, Matthias Felleisen:
Debugging macros. GPCE 2007: 135-144 - [c61]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:
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 [contents] - 2006
- [c60]Dale Vaillancourt, Rex L. Page, Matthias Felleisen:
ACL2 in DrScheme. ACL2 2006: 107-116 - [c59]Matthew Flatt, Robert Bruce Findler, Matthias Felleisen:
Scheme with Classes, Mixins, and Traits. APLAS 2006: 270-289 - [c58]Sam Tobin-Hochstadt
Interlanguage migration: from scripts to programs. OOPSLA Companion 2006: 964-974 - [c57]Philippe Meunier, Robert Bruce Findler, Matthias Felleisen:
Modular set-based analysis from contracts. POPL 2006: 218-231 - 2005
- [j24]Matthias Felleisen, Julia Lawall, Manuel Serrano, Olin Shivers:
Editorial. High. Order Symb. Comput. 18(3-4): 243-244 (2005) - [c56]Matthias Felleisen:
How to design class hierarchies. FDPE@ICFP 2005: 1 - [c55]Greg Pettyjohn, John Clements, Joe Marshall, Shriram Krishnamurthi
Continuations from generalized stack inspection. ICFP 2005: 216-227 - [c54]Richard Cobbe, Matthias Felleisen:
Environmental acquisition revisited. POPL 2005: 14-25 - 2004
- [j23]Jacob Matthews, Robert Bruce Findler, Paul T. Graunke, Shriram Krishnamurthi
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 TeachScheme! Project: Computing and Programming for Every Student. Comput. Sci. Educ. 14(1): 55-77 (2004) - [j21]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) - [j20]John Clements, Matthias Felleisen:
A tail-recursive machine with stack inspection. ACM Trans. Program. Lang. Syst. 26(6): 1029-1052 (2004) - [c53]Matthias Felleisen:
Functional Objects. ECOOP 2004: 267 - [c52]Robert Bruce Findler, Matthew Flatt, Matthias Felleisen:
Semantic Casts: Contracts and Structural Subtyping in a Nominal World. ECOOP 2004: 364-388 - [c51]Ryan Culpepper, Matthias Felleisen:
Taming Macros. GPCE 2004: 225-243 - [c50]Tudor Antoniu, Paul A. Steckler, Shriram Krishnamurthi, Erich Neuwirth, Matthias Felleisen:
Validating the Unit Correctness of Spreadsheet Programs. ICSE 2004: 439-448 - [c49]Jacob Matthews, Robert Bruce Findler, Matthew Flatt, Matthias Felleisen:
A Visual Environment for Developing Context-Sensitive Term Rewriting Systems. RTA 2004: 301-311 - 2003
- [j19]Matthias Felleisen:
Welcome to the Educational Pearls Column. J. Funct. Program. 13(5): 835-838 (2003) - [c48]John Clements, Matthias Felleisen:
A Tail-Recursive Semantics for Stack Inspections. ESOP 2003: 22-37 - [c47]Paul T. Graunke, Robert Bruce Findler, Shriram Krishnamurthi
Modeling Web Interactions. ESOP 2003: 238-252 - 2002
- [j18]Robert Bruce Findler, John Clements, Cormac Flanagan, Matthew Flatt, Shriram Krishnamurthi
DrScheme: a programming environment for Scheme. J. Funct. Program. 12(2): 159-182 (2002) - [c46]Matthias Felleisen:
Developing Interactive Web Programs. Advanced Functional Programming 2002: 100-128 - [c45]Robert Bruce Findler, Matthias Felleisen:
Contracts for higher-order functions. ICFP 2002: 48-59 - [c44]Mark Logan, Matthias Felleisen, David N. Blank-Edelman:
Environmental Acquisition in Network Management. LISA 2002: 175-184 - [c43]Matthias Felleisen:
From POPL to the classroom and back. POPL 2002: 126-127 - 2001
- [j17]Ron Cytron, Matthias Felleisen:
SIGPLAN Response to the Ironman Draft of the Computing Curricula 2001. ACM SIGPLAN Notices 36(4): 3-4 (2001) - [c42]Paul T. Graunke, Shriram Krishnamurthi
Programming the Web with High-Level Programming Languages. ESOP 2001: 122-136 - [c41]John Clements, Matthew Flatt, Matthias Felleisen:
Modeling an Algebraic Stepper. ESOP 2001: 320-334 - [c40]Paul T. Graunke, Robert Bruce Findler, Shriram Krishnamurthi
Automatically Restructuring Programs for the We. ASE 2001: 211-222 - [c39]Robert Bruce Findler, Matthias Felleisen:
Contract Soundness for Object-Oriented Languages. OOPSLA 2001: 1-15 - [c38]Robert Bruce Findler, Mario Latendresse, Matthias Felleisen:
Behavioral contracts and behavioral subtyping. ESEC / SIGSOFT FSE 2001: 229-236 - 2000
- [j16]Matthias Felleisen:
Components and program analyses. ACM SIGSOFT Softw. Eng. Notes 25(1): 49-50 (2000)
1990 – 1999
- 1999
- [j15]Cormac Flanagan, Matthias Felleisen:
The Semantics of Future and an Application. J. Funct. Program. 9(1): 1-31 (1999) - [j14]Cormac Flanagan, Matthias Felleisen:
Componential Set-Based Analysis. ACM Trans. Program. Lang. Syst. 21(2): 370-416 (1999) - [c37]Matthias Felleisen, Robert Cartwright:
Safety as a Metric. CSEE&T 1999: 129-131 - [c36]Shriram Krishnamurthi
Expressing Structural Properties as Language Constructs. ESOP 1999: 258-272 - [c35]Shriram Krishnamurthi
From Macros to Reusable Generative Programming. GCSE 1999: 105-120 - [c34]Matthew Flatt, Robert Bruce Findler, Shriram Krishnamurthi
Programming Languages as Operating Systems (or Revenge of the Son of the Lisp Machine). ICFP 1999: 138-147 - [c33]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
- [j13]Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, Shriram Krishnamurthi
The DrScheme Project: An Overview. ACM SIGPLAN Notices 33(6): 17-23 (1998) - [c32]Shriram Krishnamurthi
Synthesizing Object-Oriented and Functional Design to Promote Re-Use. ECOOP 1998: 91-113 - [c31]Matthew Flatt, Matthias Felleisen:
Units: Cool Modules for HOT Languages. PLDI 1998: 236-248 - [c30]Matthew Flatt, Shriram Krishnamurthi
Classes and Mixins. POPL 1998: 171-183 - [c29]Shriram Krishnamurthi
Toward a Formal Theory of Extensible Software. SIGSOFT FSE 1998: 88-98 - [e1]Matthias Felleisen, Paul Hudak, Christian Queinnec:
Proceedings of the third ACM SIGPLAN International Conference on Functional Programming (ICFP '98), Baltimore, Maryland, USA, September 27-29, 1998. ACM 1998, ISBN 1-58113-024-4 [contents] - 1997
- [j12]Zena M. Ariola, Matthias Felleisen:
The Call-By-Need lambda Calculus. J. Funct. Program. 7(3): 265-301 (1997) - [c28]Cormac Flanagan, Matthias Felleisen:
Componential Set-Based Analysis. PLDI 1997: 235-248 - [c27]Robert Bruce Findler, Cormac Flanagan, Matthew Flatt, Shriram Krishnamurthi
DrScheme: A Pedagogic Programming Environment for Scheme. PLILP 1997: 369-388 - [c26]Matthew Flatt, Matthias Felleisen:
Program Units as Higher-Order Modules. HOOTS 1997: 204-229 - 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) - [c25]Cormac Flanagan, Matthew Flatt, Shriram Krishnamurthi
Static Debugging: Browsing the Web of Program Invariants. PLDI 1996: 23-32 - 1995
- [c24]J. Gregory Morrisett, Matthias Felleisen, Robert Harper:
Abstract Models of Memory Management. FPCA 1995: 66-77 - [c23]Cormac Flanagan, Matthias Felleisen:
The Semantics of Future and Its Use in Program Optimizations. POPL 1995: 209-220 - [c22]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) - [c21]Amr Sabry
Is Continuation-Passing Useful for Data Flow Analysis? PLDI 1994: 1-12 - [c20]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 Symb. Comput. 6(3-4): 289-360 (1993) - [c19]Cormac Flanagan, Amr Sabry
The Essence of Compiling with Continuations. PLDI 1993: 237-247 - [c18]Cormac Flanagan, Amr Sabry
The essence of compiling with continuations (with retrospective). Best of PLDI 1993: 502-514 - [c17]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) - [c16]Amr Sabry
Reasoning About Programs in Continuation-Passing Style. LISP and Functional Programming 1992: 288-298 - [c15]Robert Cartwright, Matthias Felleisen:
Observable Sequentiality and Full Abstraction. POPL 1992: 328-342 - [c14]Ramarao Kanneganti
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) - [c13]Dorai Sitaram, Matthias Felleisen:
Modeling Continuations without Continuations. POPL 1991: 185-196 - [c12]Erik Crank, Matthias Felleisen:
Parameter-Passing and the Lambda Calculus. POPL 1991: 233-244 - 1990
- [j5]Dorai Sitaram, Matthias Felleisen:
Control Delimiters and Their Hierarchies. LISP Symb. Comput. 3(1): 67-99 (1990) - [c11]Matthias Felleisen:
On the Expressive Power of Programming Languages. ESOP 1990: 134-151 - [c10]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) - [c9]Robert Cartwright, Matthias Felleisen:
The Semantics of Program Dependence. PLDI 1989: 13-27 - 1988
- [c8]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 - [c7]Matthias Felleisen:
lambda-V-CS: An Extended lambda-Calculus for Scheme. LISP and Functional Programming 1988: 72-85 - [c6]Matthias Felleisen:
The Theory and Practice of First-Class Prompts. POPL 1988: 180-190 - 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) - [c5]Matthias Felleisen, Daniel P. Friedman:
Control operators, the SECD-machine, and the λ-calculus. Formal Description of Programming Concepts 1987: 193-222 - [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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-26 00:44 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: