dispatch.bib

%%% Bibliography for Gud (Grand Unified Dispatching)

@Article{Taivalsaari93,
  author =   "Antero Taivalsaari",
  title =    "Object-oriented programming with modes",
  journal =      "Journal of Object-Oriented Programming",
  year =     1993,
  month =    Jun,
  pages =    "25--32",
}


@Article{StromY86,
  author =   "Robert E. Strom and Shaula Yemini",
  title =    "Typestate: A programming language concept for enhancing
          software reliability",
  journal =      TSE,
  year =     1986,
  volume =   "SE-12",
  number =   1,
  month =    Jan,
  pages =    "157--171"
}


@Article{StromY93,
  author =   "Robert E. Strom and Daniel M. Yellin",
  title =    "Extending typestate checking using conditional liveness
          analysis",
  journal =      TSE,
  year =     1993,
  volume =   19,
  number =   5,
  month =    May,
  pages =    "478--485"
}




@InProceedings{Wadler87,
  author =   "Philip Wadler",
  title =    "Views: A Way for Pattern Matching to Cohabit with Data Abstraction",
  crossref =    "POPL87",
  pages =    "307--313"
}






@InProceedings{MugridgeHH91,
  author =   "Warwick B. Mugridge and John Hamer and John G. Hosking",
  title =    "Multi-Methods in a Statically-Typed Programming Language",
  crossref =     "ECOOP91",
  pages =    "307--324",
}


@InProceedings{HoskingHM90,
  author =   "Hosking, J.G. and Hamer, J. and W.B. Mugridge",
  title =    "Integrating functional and object-oriented programming",
  booktitle =    "Technology of Object-Oriented Languages and Systems TOOLS 3",
  year =     1990,
  address =  "Sydney",
  pages =    "345--355"
}



@TechReport{HamerHM90,
  author =   "Hamer, J. and Hosking, J.G. and Mugridge, W.B.",
  title =    "A Method for Integrating Classification Within an Object-Oriented Environment",
  institution =  "Department of Computer Science, University of Auckland",
  year =     1990,
  number =   48,
  month =    oct
}


@article{ChambersL95,
  title= "Typechecking and Modules for Multi-Methods",
  author="Craig Chambers and Gary T. Leavens",
  journal=toplas,
  year=1995,
  month=nov,
  volume=17,
  number=6,
  pages="805--843"
}


@Book{MilnerTH90,
  author =   "Robin Milner and Mads Tofte and Robert Harper",
  title =    "The Definition of Standard {ML}",
  publisher =    "MIT Press",
  year =     1990
}


@Book{MilnerTHM97,
  author =   "Robin Milner and Mads Tofte and Robert Harper and Dave MacQueen",
  title =    "The Definition of Standard {ML} (Revised)",
  publisher =    "MIT Press",
  year =     1997
}


@Manual{OCaml:Manual,
  title =    "The Objective Caml system, release 3.07",
  OPTkey =   "",
  author =   "Xavier Leroy",
  OPTorganization = "",
  OPTaddress =   "",
  OPTedition =   "",
  month =    sep # "~29,",
  year =     2003,
  note =     "with Damien Doligez, Jacques Garrigue, Didier R{\'e}my and J{\'e}r{\^o}me Vouillon",
  OPTannote =    ""
}


@TechReport{NakamuraOT96,
  author =   "Hiroaki Nakamura and Tamiya Onodera and Mikio Takeuchi",
  title =    "Message dispatch using binary decision trees",
  institution =  "IBM Research, Tokyo Research Laboratory",
  year =     1996,
  number =   "RT0137",
  address =  "Kanagawa, Japan",
  month =    mar # "~1,"
}


@InProceedings{Kiczales:Rodriquez:acm:lfp:1990,
  author =       "Gregor Kiczales and Luis Rodriguez",
  email =        "Gregor@Xerox.com and rassilon@athena.mit.edu",
  title =        "Efficient Method Dispatch in {PCL}",
  booktitle =    "1990 {ACM} Conference on Lisp and Functional
                 Programming",
  organization = "ACM",
  month =        jun,
  year =         "1990",
  pages =        "99--105",
  refs =         "8",
  checked =      "19940629",
  source =       "Dept. Library",
  keywords =     "PCL, CLOS",
  reffrom =      "Hennessey:acm:lfp:1992",
}


@PhdThesis{murthy:on-growing:,
  author =       "Sreerama K. Murthy",
  title =        "On Growing Better Decision Trees from Data",
  school =   "Johns Hopkins University",
  year =     "1995",
  OPTaddress =   "Baltimore, Maryland",
  abstract =     "This thesis investigates the problem of growing
                 decision trees from data, for the purposes of
                 classification and prediction. After a comprehensive,
                 multi-disciplinary survey of work on decision trees,
                 some algorithmic extensions to existing tree growing
                 methods are considered. The implications of using (1)
                 less greedy search and (2) less restricted splits at
                 tree nodes are systematically studied. Extending the
                 traditional axis-parallel splits to {\it oblique}
                 splits is shown to be practical and beneficial for a
                 variety of problems. However, the use of more extensive
                 search heuristics than the traditional greedy heuristic
                 is argued to be unnecessary, and often harmful. Any
                 effort to build good decision trees from real-world
                 data involves ``massaging'' the data into a suitable
                 form. Two forms of data massaging, domain-independent
                 and domain-specific, are distinguished in this work. A
                 new framework is outlined for the former, and the
                 importance of the latter is illustrated in the context
                 of two new, complex classification problems in
                 astronomy. Highly accurate and small decision tree
                 classifiers are built for both these problems through a
                 collaborative effort with astronomers.",
  annote =       "For individual chapters, see
                 ftp://blaze.cs.jhu.edu/pub/murthy",
  url =          "http://www.cs.jhu.edu/grad/murthy",
}





@Article{DujardinAS97,
  author =   "Eric Dujardin and Eric Amiel and Eric Simon",
  title =    "Fast algorithms for compressed multimethod dispatch
          table generation",
  journal =      TOPLAS,
  year =     1998,
  volume =   20,
  number =   1,
  pages =    "116--165",
  month =    jan,
  abstract =
   "The efficiency of dynamic dispatch is a major impediment to the adoption of
    multimethods in object-oriented languages. In this article, we propose a
    simple multimethod dispatch scheme based on compressed dispatch
    tables. This scheme is applicable to any object-oriented language using a
    method precedence order that satisfies a specific monotonous property
    (e.g., as Cecil and Dylan) and guarantees that dynamic dispatch is
    performed in constant time, the latter being a major requirement for some
    languages and applications. We provide efficient algorithms to build the
    dispatch tables, provide their worst-case complexity, and demonstrate the
    effectiveness of our scheme by real measurements performed on two large
    object-oriented applications. Finally, we provide a detailed comparison of
    our technique with other existing techniques.",
}

@InProceedings{POPL89*105,
  author =       "Paris C. Kanellakis and John C. Mitchell",
  title =        "Polymorphic unification and {ML} typing",
  pages =        "105--115",
  ISBN =         "0-89791-294-2",
  editor =       "ACM-SIGPLAN ACM-SIGACT",
  booktitle =    "Conference Record of the 16th Annual {ACM} Symposium
                 on Principles of Programming Languages ({POPL} '89)",
  address =      "Austin, TX, USA",
  month =        jan,
  year =         "1989",
}


@TechReport{UTEXAS_CS//AI93-200,
  bibdate =      "August 25, 97",
  type =         "Technical Report",
  number =       "AI93-200",
  institution =  "University of Texas, Austin",
  title =        "Learning Search-Control Heuristics For Logic Programs:
                 Applications To Speed-up Learning and
                 Language Acquisitions",
  year =         "1993",
  month =        may # " 1,",
  author =       "John M. Zelle",
  abstract =     "This paper presents a general framework, learning
                 search-control heuristics for logic programs, which can
                 be used to improve both the efficiency and accuracy of
                 knowledge-based systems expressed as definite-clause
                 logic programs. The approach combines techniques of
                 explanation- based learning and recent advances in
                 inductive logic programming to learn clause-selection
                 heuristics that guide program execution. Two specific
                 applications of this framework are detailed: dynamic
                 optimization of Prolog programs (improving efficiency)
                 and natural language acquisition (improving accuracy).
                 In the area of program optimization, a prototype
                 system, DOLPHIN is able to transform some intractable
                 specifications into polynomial-time algorithms, and
                 outperforms competing approaches in several benchmark
                 speedup domains. A prototype language acquisition
                 system, CHILL is also described. It is capable of
                 automatically acquiring semantic grammars, which
                 uniformly incorporate syntactic and semantic
                 constraints to parse sentences into case-role
                 representations. Initial experiments show that this
                 approach is able to construct accurate parsers which
                 generalize well to novel sentences and significantly
                 outperform previous approaches to learning case-role
                 mapping based on connectionist techniques. Planned
                 extensions of the general framework and the specific
                 applications as well as plans for further evaluation
                 are also discussed.",
}


%%%
%%% Additional items for predicate fields paper
%%%


@InProceedings{Millstein2004,
  author =   "Todd Millstein",
  title =    "Practical Predicate Dispatch",
  crossref =     "OOPSLA2004",
  pages =    "345--364",
  abstract =
   "Predicate dispatch is an object-oriented (OO) language
    mechanism for determining the method implementation to be invoked
    upon a message send. With predicate dispatch, each method
    implementation includes a predicate guard specifying the
    conditions under which the method should be invoked, and logical
    implication of predicates determines the method overriding
    relation. Predicate dispatch naturally unifies and generalizes
    several common forms of dynamic dispatch, including traditional OO
    dispatch, multimethod dispatch, and functional-style pattern
    matching. Unfortunately, prior languages supporting predicate
    dispatch have had several deficiencies that limit its utility in
    practice.
    \par
    We introduce JPred, a backward-compatible extension
    to Java supporting predicate dispatch. While prior languages with
    predicate dispatch have been extensions to toy or non-mainstream
    languages, we show how predicate dispatch can be naturally added
    to a traditional OO language. While prior languages with predicate
    dispatch have required the whole program to be available for
    typechecking and compilation, JPred retains Java's modular
    typechecking and compilation strategies. While prior languages
    with predicate dispatch have included special-purpose algorithms
    for reasoning about predicates, JPred employs general-purpose,
    off-the-shelf decision procedures. As a result, JPred's type
    system is more flexible, allowing several useful programming
    idioms that are spuriously rejected by those other languages.
    After describing the JPred language and type system, we present a
    case study illustrating the utility of JPred in a real-world
    application, including its use in the detection of several errors.",
}

@InProceedings{CHA93B,
  author =   "Craig Chambers",
  title =    "Predicate classes",
  crossref =     "ECOOP93",
  pages =    "268--296",
}

@Book{GlynnTorok02,
   Author={Jay Glynn and Csaba Torok and Richard Conway and Wahid Choudhury and Zach Greenvoss and Shripad Kulkarniq and Neil Whitlow},
   Publisher={Apress},
   Title={Professional Windows GUI Programming Using C\#},
   Year=2002,
   Address={Berkeley, CA}
}

@Book{MacDonald02,
   Author={Matthew MacDonald},
   Publisher={Apress},
   Title={User Interfaces in C\#: Windows Forms and Custom Controls},
   Year=2002,
   Address={Berkeley, CA}
}

@Book{Brown02,
   Author={Erik Brown},
   Publisher={Manning Publications},
   Title={Windows Forms Programming in C\#},
   Year=2002,
   Address={Greenwich, CT}
}

@Book{Chappell96,
   Author={David Chappell},
   Publisher={Microsoft Press},
   Title={Understanding {ActiveX} and {OLE}},
   Year=1996,
   Address={Seattle, WA}
}

@Book{BOX97,
   Author={Don Box},
   Publisher={Addison-Wesley Professional},
   Title={Essential COM},
   Year=1997,
   Address={Boston, MA}
}

@Book{Harmon00,
    Author={Eric Harmon},
   Publisher={New Riders Publishing},
   Title={Delphi COM Programming},
   Year=2000,
   Address={Indianapolis, IN}
}

@Book{Rammer02,
   Author={Ingo Rammer},
   Publisher={Apress},
   Title={Advanced .NET Remoting (C\# Edition)},
   Year=2002,
   Address={Berkeley, CA}
}

@Book{BrownEwald99,
   Author={Keith Brown and Tim Ewald and Chris Sells and Don Box},
   Publisher={Addison-Wesley Professional},
   Title={Effective COM: 50 Ways to Improve Your COM and MTS-based Applications},
   Year=1999,
   Address={Boston, MA}
}

@Book{MacDonald03,
   Author={Matthew MacDonald},
   Publisher={Microsoft Press},
   Title={Microsoft .NET Distributed Applications: Integrating XML Web Services and .NET Remoting},
   Year=2003,
   Address={Seattle, WA}
}

@Book{Nock03,
   Author={Clifton Nock},
   Publisher={Addison-Wesley Professional},
   Title={Data Access Patterns: Database Interactions in Object-Oriented Applications},
   Year=2003,
   Address={Boston, MA}
}

@Book{Delphi99,
   Author={Steve Teixeira and Xavier Pacheco},
   Publisher={Sams},
   Title={Delphi 5 Developer's Guide},
   Year=1999,
   Address={Scotts Valley, CA}
}


@Manual{ATEASY,
  title =    "ATEasy 3.0 Reference Manual",
  organization = "Geotest -- Marvin Test Systems, Inc",
  address =  "CA",
  year =     2000
}

@InProceedings{CliftonLCM2000,
  author =   "Curtis Clifton and Gary T. Leavens and Craig Chambers and
                  Todd Millstein",
  title =    "{MultiJava}: Modular open classes and symmetric multiple
                  dispatch for {Java}",
  crossref =     "OOPSLA2000",
  pages =    "130--145",
}

@InProceedings{ChambersC99,
  author =   "Craig Chambers and Weimin Chen",
  title =    "Efficient multiple and predicated dispatching",
  crossref =     "OOPSLA99",
  pages =    "238--255",
}



@InProceedings{Orleans2002,
  author =   "Doug Orleans",
  title =    "Incremental programming with extensible decisions",
  crossref =     "AOSD2002",
  pages =    "56--64",
}




@TechReport{Ucko2001,
  author =   "Aaron Ucko",
  title =    "Predicate Dispatching in the {Common Lisp Object System}",
  institution =  MITAI,
  year =     2001,
  number =   "2001-006",
  address =  MITaddr,
  month =    jun
}




@InProceedings{BobrowKKMSZ86,
  author =   "Daniel G. Bobrow and Kenneth Kahn and Gregor Kiczales and
                  Larry Masinter and Mark Stefik and Frank Zdybel",
  title =    "{CommonLoops}: Merging {Lisp} and object-oriented programming",
  crossref =     "OOPSLA86",
  pages =    "17--29",
}


@article{54278,
 author = {D. G. Bobrow and L. G. DeMichiel and R. P. Gabriel and S. E. Keene and G. Kicsales and D. A. Moon},
 title = {Common LISP object system specification X3J13 Document 88-002R},
 journal = {SIGPLAN Not.},
 volume = {23},
 number = {SI},
 year = {1988},
 issn = {0362-1340},
 pages = {1--143},
 doi = {https://doi.acm.org/10.1145/54277.54278},
 }



@Article{BobrowDGKKM88,
  author =   "Daniel G. Bobrow and Linda G. DeMichiel and Richard P. Gabriel and Sonya E. Keene and Gregor Kiczales and David A. Moon",
  title =    "{Common Lisp Object System} specification",
  journal =      SIGPLANNotices,
  year =     1988,
  volume =   23,
  number =   "SI",
  pages =    "1--145",
  note = "Special issue:  X3J13 Document 88-002R"
}


@Manual{Dylan,
  title =    "Dylan, an Object-Oriented Dynamic Language",
  organization = "Apple Computer",
  year =     1992
}




@InProceedings{UngarS87,
  author =   "David Ungar and Randall B. Smith",
  title =    "Self: The power of simplicity",
  crossref =     "OOPSLA87",
  pages =    "227--242",
}


@InProceedings{Chambers92,
  author =   "Craig Chambers",
  title =    "Object-oriented multi-methods in {Cecil}",
  crossref =     "ECOOP92",
  NEEDpages = "*"
}

@inproceedings{Myers92,
 author = "Brad A. Myers and Mary Beth Rosson",
 title = "Survey on user interface programming",
 booktitle = "CHI '92: Proceedings of the SIGCHI conference on Human factors in computing systems",
 year = 1992,
 isbn = {0-89791-513-5},
 pages = "195--202",
 address  = {Monterey, California, United States},
 doi = {https://doi.acm.org/10.1145/142750.142789},
 }


@InProceedings{TamaiUI2005,
  author = 	 "Tetsuo Tamai and Naoyasu Ubayashi and Ryoichi Ichiyama",
  title = 	 "An adaptive object model with dynamic role binding",
  crossref =     "ICSE2005",
  pages = 	 "166--175",
}