The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Matthias Felleisen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  82. Practical Variable-Arity Polymorphism. [Citation Graph (, )][DBLP]


  83. Debugging macros. [Citation Graph (, )][DBLP]


  84. A functional I/O system or, fun for freshman kids. [Citation Graph (, )][DBLP]


  85. Toward a Practical Module System for ACL2. [Citation Graph (, )][DBLP]


  86. The design and implementation of typed scheme. [Citation Graph (, )][DBLP]


  87. Making induction manifest in modular ACL2. [Citation Graph (, )][DBLP]


  88. Future contracts. [Citation Graph (, )][DBLP]


  89. Adding types to untyped languages. [Citation Graph (, )][DBLP]


  90. Viewpoint - Why computer science doesn't matter. [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.015secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002