@inproceedings{ranta09:grammar-development-demo,
    author = {Ranta, Aarne and Angelov, Krasimir and Bringert, Bj\"{o}rn},
    booktitle = {EACL 2009, 12th Conference of the European Chapter of the Association for Computational Linguistics, Proceedings of the Demonstrations Session, March 30 - April 3, 2009, Athens, Greece},
    citeulike-article-id = {6745682},
    citeulike-linkout-0 = {http://www.aclweb.org/anthology/E09-2015},
    keywords = {gf},
    pages = {57--60},
    posted-at = {2010-03-01 16:57:59},
    priority = {0},
    publisher = {The Association for Computer Linguistics},
    title = {Grammar Development in {GF}},
    url = {http://www.aclweb.org/anthology/E09-2015},
    year = {2009}
}



@inproceedings{bringert09:gf-web-service,
    author = {Bringert, Bj\"{o}rn and Angelov, Krasimir and Ranta, Aarne},
    booktitle = {EACL 2009, 12th Conference of the European Chapter of the Association for Computational Linguistics, Proceedings of the Demonstrations Session, March 30 - April 3, 2009, Athens, Greece},
    citeulike-article-id = {6745680},
    citeulike-linkout-0 = {http://www.aclweb.org/anthology/E09-2003},
    keywords = {gf},
    pages = {9--12},
    posted-at = {2010-03-01 16:56:03},
    priority = {0},
    publisher = {The Association for Computer Linguistics},
    title = {{G}rammatical {F}ramework Web Service},
    url = {http://www.aclweb.org/anthology/E09-2003},
    year = {2009}
}



@article{angelov09:pgf,
    abstract = {Abstract  Portable Grammar Format (PGF) is a core language for type-theoretical grammars. It is the target language to which grammars written in the high-level formalism Grammatical Framework (GF) are compiled. Low-level and simple, PGF is easy to reason about, so that its language-theoretic properties can be established. It is also easy to write interpreters that perform parsing and generation with PGF grammars, and compilers converting PGF to other formats. This paper gives a concise description of PGF, covering syntax, semantics, and parser generation. It also discusses the technique of embedded grammars, where language processing tasks defined by PGF grammars are integrated in larger systems.},
    author = {Angelov, Krasimir and Bringert, Bj\"{o}rn and Ranta, Aarne},
    citeulike-article-id = {6403123},
    citeulike-linkout-0 = {http://dx.doi.org/10.1007/s10849-009-9112-y},
    citeulike-linkout-1 = {http://linkinghub.elsevier.com/retrieve/pii/9112},
    citeulike-linkout-2 = {http://www.springerlink.com/content/y32q021028747k70},
    doi = {10.1007/s10849-009-9112-y},
    issn = {0925-8531},
    journal = {Journal of Logic, Language and Information},
    keywords = {gf},
    month = {April},
    number = {2},
    pages = {201--228},
    posted-at = {2010-03-01 16:49:02},
    priority = {0},
    publisher = {Springer Netherlands},
    title = {{PGF}: A Portable Run-time Format for Type-theoretical Grammars},
    url = {http://dx.doi.org/10.1007/s10849-009-9112-y},
    volume = {19},
    year = {2010}
}



@unpublished{bringert08:continuation-semantics,
    author = {Bringert, Bj\"{o}rn},
    citeulike-article-id = {3750548},
    citeulike-linkout-0 = {http://www.cs.chalmers.se/\~{}bringert/publ/continuation-semantics/continuation-semantics.pdf},
    day = {17},
    institution = {Department of Computer Science and Engineering, Chalmers University of Technology and University of Gothenburg},
    keywords = {fol, gf, semantics},
    month = {November},
    posted-at = {2008-12-05 18:31:03},
    priority = {0},
    title = {Delimited Continuations, Applicative Functors and Natural Language Semantics},
    url = {http://www.cs.chalmers.se/\~{}bringert/publ/continuation-semantics/continuation-semantics.pdf},
    year = {2008}
}



@techreport{HTML401,
    author = {Raggett, Dave and Le Hors, Arnaud and Jacobs, Ian},
    citeulike-article-id = {3747145},
    citeulike-linkout-0 = {http://www.w3.org/TR/1999/REC-html401-19991224/},
    day = {24},
    institution = {W3C},
    keywords = {web},
    month = {December},
    posted-at = {2008-12-04 14:02:39},
    priority = {0},
    title = {HTML 4.01 Specification},
    url = {http://www.w3.org/TR/1999/REC-html401-19991224/},
    year = {1999}
}



@inproceedings{claessen03:model-paradox,
    author = {Claessen, Koen and S\"{o}rensson, Niklas},
    booktitle = {Workshop on Model Computation (MODEL)},
    citeulike-article-id = {3733480},
    citeulike-linkout-0 = {http://www.cs.chalmers.se/\~{}koen/pubs/model-paradox.ps},
    keywords = {fol},
    posted-at = {2008-12-01 20:08:20},
    priority = {2},
    title = {New Techniques that Improve MACE-style Model Finding},
    url = {http://www.cs.chalmers.se/\~{}koen/pubs/model-paradox.ps},
    year = {2003}
}



@phdthesis{bringert08:phd,
    abstract = {It is easy to imagine machines that can communicate in natural language. Constructing such machines is more difficult. The aim of this thesis is to demonstrate how declarative grammar formalisms that distinguish between abstract and concrete syntax make it easier to develop natural language applications.

We describe how the type-theorectical grammar formalism Grammatical Framework (GF) can be used as a high-level language for natural language applications. By taking advantage of techniques from the field of programming language implementation, we can use GF grammars to perform portable and efficient parsing and linearization, generate speech recognition language models, implement multimodal fusion and fission, generate support code for abstract syntax transformations, generate dialogue managers, and implement speech translators and web-based syntax-aware editors.

By generating application components from a declarative grammar, we can reduce duplicated work, ensure consistency, make it easier to build multilingual systems, improve linguistic quality, enable re-use across system domains, and make systems more portable.},
    address = {Gothenburg, Sweden},
    author = {Bringert, Bj\"{o}rn},
    citeulike-article-id = {3417065},
    citeulike-linkout-0 = {http://hdl.handle.net/2077/18350},
    citeulike-linkout-1 = {http://dx.doi.org/2077/18350},
    doi = {2077/18350},
    posted-at = {2008-10-16 10:52:18},
    priority = {2},
    school = {Department of Computer Science and Engineering, Chalmers University of Technology and University of Gothenburg},
    title = {Programming Language Techniques for Natural Language Applications},
    url = {http://hdl.handle.net/2077/18350},
    year = {2008}
}



@incollection{burke05:translating-specs,
    abstract = {We describe a system for automatically translating formal software specifications to natural language. The system produces natural language which is acceptable to a human reader, and it supports by-hand optimization by users who are not experts of our system. The translation system is implemented using the Grammatical Framework, a grammar formalism based on Martin-L\"{o}f's type theory. We show that this grammar-based approach scales well enough to handle a non-trivial case study: translating the Object Constraint Language specifications of the Java Card API into English.},
    address = {Heidelberg},
    author = {Burke, David A. and Johannisson, Kristofer},
    booktitle = {Logical Aspects of Computational Linguistics},
    citeulike-article-id = {3387873},
    citeulike-linkout-0 = {http://dx.doi.org/10.1007/11422532\_4},
    doi = {10.1007/11422532\_4},
    keywords = {gf},
    month = {May},
    pages = {51--66},
    posted-at = {2008-10-08 16:24:04},
    priority = {2},
    publisher = {Springer},
    series = {Lecture Notes in Computer Science},
    title = {Translating Formal Software Specifications to Natural Language},
    url = {http://dx.doi.org/10.1007/11422532\_4},
    volume = {3492},
    year = {2005}
}



@inproceedings{bracha98:generic-java,
    abstract = {We present GJ, a design that extends the Java programming language with generic types and methods. These are both explained and implemented by translation into the unextended language. The translation closely mimics the way generics are emulated by programmers: it erases all type parameters, maps type variables to their bounds, and inserts casts where needed. Some subtleties of the translation are caused by the handling of overriding. GJ increases expressiveness and safety: code utilizing...},
    address = {New York, NY, USA},
    author = {Bracha, Gilad and Odersky, Martin and Stoutamire, David and Wadler, Philip},
    booktitle = {Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, Vancouver, BC},
    citeulike-article-id = {3387842},
    citeulike-linkout-0 = {http://dx.doi.org/10.1145/286936.286957},
    doi = {10.1145/286936.286957},
    editor = {Chambers, Craig},
    keywords = {java},
    pages = {183--200},
    posted-at = {2008-10-08 16:04:24},
    priority = {0},
    publisher = {ACM},
    title = {Making the Future Safe for the Past: Adding Genericity to the Java Programming Language},
    url = {http://dx.doi.org/10.1145/286936.286957},
    year = {1998}
}



@inproceedings{ljunglof08:gf-isu,
    abstract = {We describe how to give a full specification of an ISU-based dialogue system as a grammar. For this we use Grammatical Framework (GF), which separates grammars into abstract and concrete syntax. All components necessary for a working GoDiS dialogue system are specified in the abstract syntax, while the linguistic details are defined in the concrete syntax. Since GF is a multilingual grammar formalism, it is straightforward to extend the dialogue system to several languages. Furthermore, the GF Resource Grammar Library can be used to write a single concrete instance covering 13 different languages.},
    author = {Ljungl\"{o}f, Peter and Larsson, Staffan},
    booktitle = {Advances in Natural Language Processing, 6th International Conference, GoTAL 2008, Gothenburg, Sweden},
    citeulike-article-id = {3386903},
    citeulike-linkout-0 = {http://dx.doi.org/10.1007/978-3-540-85287-2\_29},
    doi = {10.1007/978-3-540-85287-2\_29},
    location = {Gothenburg, Sweden},
    month = {August},
    pages = {303--314},
    posted-at = {2008-10-08 14:24:00},
    priority = {2},
    publisher = {Springer},
    series = {Lecture Notes in Computer Science},
    title = {A Grammar Formalism for Specifying ISU-Based Dialogue Systems},
    url = {http://dx.doi.org/10.1007/978-3-540-85287-2\_29},
    volume = {5221},
    year = {2008}
}



@inproceedings{ranta95:syntactic-categories,
    abstract = {We have been studying the structure of simple mathematical statements in English. It has turned out that both phrase structure grammar and type theory are needed. Then we have given an interpretation and generalization of phrase structure grammar in type theory—in other words, an extension of type theory with a system of categories of phrase structure grammar. We have ended up with a formalism that comprises both informal English (that is, strings of words), a system of syntactic categories and syntax trees, and a formal mathematical language. We have shown how syntax trees are sugared into English and interpreted in the mathematical formalism. We have not shown how to define the inverses of sugaring and interpretation, which are by no means trivial. The inverse of sugaring, that is, parsing, was briefly discussed at the end of Section 6. The inverse of interpretation would be a function that takes type-theoretical formulae into syntax trees. It could be combined with the sugaring operation that we already have, to obtain a sugaring method for the mathematical formalism. We have previously tried to define sugaring directly for the mathematical formalism (see Ranta 1994a, chapter 9, and 1994b), but then we did not have access to other categorial structure than the structure of type theory.},
    address = {Heidelberg},
    author = {Ranta, Aarne},
    booktitle = {Types for Proofs and Programs, International Workshop TYPES '94, B\r{a}stad, Sweden, June 6-10, 1994},
    citeulike-article-id = {3385636},
    citeulike-linkout-0 = {http://dx.doi.org/10.1007/3-540-60579-7\_9},
    doi = {10.1007/3-540-60579-7\_9},
    editor = {Dybjer, Peter and Nordstr\"{o}m, Bengt and Smith, Jan},
    journal = {Types for Proofs and Programs},
    keywords = {gf},
    pages = {162--182},
    posted-at = {2008-10-08 09:26:14},
    priority = {2},
    publisher = {Springer},
    series = {Lecture Notes in Computer Science},
    title = {Syntactic categories in the language of mathematics},
    url = {http://dx.doi.org/10.1007/3-540-60579-7\_9},
    volume = {996},
    year = {1995}
}



@inproceedings{denecke02:rapid-prototyping,
    address = {Morristown, NJ, USA},
    author = {Denecke, Matthias},
    booktitle = {Proceedings of the 19th international conference on Computational linguistics (COLING 2002)},
    citeulike-article-id = {3382083},
    citeulike-linkout-0 = {http://dx.doi.org/10.3115/1072228.1072375},
    citeulike-linkout-1 = {http://www.aclweb.org/anthology-new/C/C02/C02-1147.pdf},
    doi = {10.3115/1072228.1072375},
    keywords = {dialogue},
    pages = {1--7},
    posted-at = {2008-10-07 14:05:23},
    priority = {2},
    publisher = {Association for Computational Linguistics},
    title = {Rapid prototyping for spoken dialogue systems},
    url = {http://www.aclweb.org/anthology-new/C/C02/C02-1147.pdf},
    year = {2002}
}



@inproceedings{bos02:uniance,
    address = {Morristown, NJ, USA},
    author = {Bos, Johan},
    booktitle = {Proceedings of the 19th international conference on Computational linguistics (COLING 2002)},
    citeulike-article-id = {3382079},
    citeulike-linkout-0 = {http://dx.doi.org/10.3115/1072228.1072323},
    citeulike-linkout-1 = {http://www.aclweb.org/anthology-new/C/C02/C02-1095.pdf},
    doi = {10.3115/1072228.1072323},
    keywords = {grammars, srg},
    pages = {1--7},
    posted-at = {2008-10-07 14:04:31},
    priority = {2},
    publisher = {Association for Computational Linguistics},
    title = {Compilation of unification grammars with compositional semantics to speech recognition packages},
    url = {http://www.aclweb.org/anthology-new/C/C02/C02-1095.pdf},
    year = {2002}
}



@inproceedings{alshawi01:variant-transduction,
    address = {Morristown, NJ, USA},
    author = {Alshawi, Hiyan and Douglas, Shona},
    booktitle = {Proceedings of the Second SIGdial Workshop on Discourse and Dialogue},
    citeulike-article-id = {3382078},
    citeulike-linkout-0 = {http://dx.doi.org/10.3115/1118078.1118080},
    citeulike-linkout-1 = {http://www.aclweb.org/anthology/W/W01/W01-1602.pdf},
    doi = {10.3115/1118078.1118080},
    keywords = {dialogue},
    pages = {1--9},
    posted-at = {2008-10-07 14:03:45},
    priority = {2},
    publisher = {Association for Computational Linguistics},
    title = {Variant transduction: a method for rapid development of interactive spoken interfaces},
    url = {http://www.aclweb.org/anthology/W/W01/W01-1602.pdf},
    year = {2001}
}



@inproceedings{rayner05:clarissa-demo,
    address = {Morristown, NJ, USA},
    author = {Rayner, Manny and Hockey, Beth A. and Chatzichrisafis, Nikos and Farrell, Kim and Renders, Jean-Michel},
    booktitle = {Proceedings of the ACL Interactive Poster and Demonstration Sessions (ACL 2005), Ann Arbor, Michigan},
    citeulike-article-id = {3382062},
    citeulike-linkout-0 = {http://dx.doi.org/10.3115/1225753.1225761},
    citeulike-linkout-1 = {http://www.aclweb.org/anthology-new/P/P05/P05-3008.pdf},
    doi = {10.3115/1225753.1225761},
    keywords = {dialogue, regulus},
    month = {June},
    pages = {29--32},
    posted-at = {2008-10-07 13:56:55},
    priority = {2},
    publisher = {Association for Computational Linguistics},
    title = {A voice enabled procedure browser for the International Space Station},
    url = {http://www.aclweb.org/anthology-new/P/P05/P05-3008.pdf},
    year = {2005}
}



@article{martin99:oaa,
    abstract = {The Open Agent Architecture (OAA), developed and used for several years at SRI International, makes it possible for software services to be provided through the cooperative efforts of distributed collections of autonomous agents. Communication and cooperation between agents are brokered by one or more facilitators, which are responsible for matching requests, from users and agents, with descriptions of the capabilities of other agents. Thus it is not generally required that a user or agent know the identities, locations, or number of other agents involved in satisfying a request. OAA is structured so as to minimize the effort involved in creating new agents and "wrapping" legacy applications, written in various languages and operating on various platforms; to encourage the reuse of existing agents; and to allow for dynamism and flexibility in the makeup of agent communities. Distinguishing features of OAA as compared with related work include extreme flexibility in using facilitator-based delegation of complex goals, triggers, and data management requests; agent-based provision of multimodal user interfaces; and built-in support for including the user as a privileged member of the agent community. This article explains the structure and elements of agent-based systems constructed using OAA. The characteristics and use of each major component of OAA infrastructure are described, including the agent library, the Interagent Communication Language, capabilities declarations, service requests, facilitation, management of data repositories, and autonomous monitoring using triggers. To provide technical context, we describe the motivations for OAA's design, and situate its features within the realm of alternative software paradigms. A summary is given of OAA-based systems built to date, and brief descriptions are given of several of these. Copyright {\copyright} 1999 Taylor \& Francis.},
    address = {Artificial Intelligence Center, SRI International, 333 Ravenswood Avenue, Menlo Park, CA 94025, United States},
    author = {Martin, David L. and Cheyer, Adam J. and Moran, Douglas B.},
    citeulike-article-id = {3382037},
    citeulike-linkout-0 = {http://dx.doi.org/10.1080/088395199117504},
    citeulike-linkout-1 = {http://www.ai.sri.com/\~{}cheyer/papers/oaa.pdf},
    doi = {10.1080/088395199117504},
    journal = {Applied Artificial Intelligence},
    keywords = {oaa, prolog},
    number = {1-2},
    pages = {91--128},
    posted-at = {2008-10-07 13:48:52},
    priority = {2},
    title = {The open agent architecture: A framework for building distributed software systems},
    url = {http://www.ai.sri.com/\~{}cheyer/papers/oaa.pdf},
    volume = {13},
    year = {1999}
}



@inproceedings{jonson06:gf-slm,
    abstract = {In this paper, we explore statistical language modelling for a speech-enabled MP3 player application by generating a corpus from the interpretation grammar written for the application with the Grammatical Framework (GF). We create a statistical language model (SLM) directly from our interpretation grammar and compare recognition performance of this model against a speech recognition grammar compiled from the same GF interpretation grammar. The results show a relative Word Error Rate (WER) reduction of 37\% for the SLM derived from the interpretation grammar while maintaining a low in-grammar WER comparable to that associated with the speech recognition grammar. From this starting point we try to improve our artificially generated model by interpolating it with different corpora achieving great reduction in perplexity and 8\% relative recognition improvement.},
    author = {Jonson, Rebecca},
    booktitle = {EACL 2006, 11st Conference of the European Chapter of the Association for Computational Linguistics},
    citeulike-article-id = {3382030},
    citeulike-linkout-0 = {http://acl.ldc.upenn.edu/E/E06/E06-1008.pdf},
    keywords = {gf, grammars, slm},
    posted-at = {2008-10-07 13:46:23},
    priority = {2},
    title = {Generating Statistical Language Models from Interpretation Grammars in Dialogue Systems},
    url = {http://acl.ldc.upenn.edu/E/E06/E06-1008.pdf},
    year = {2006}
}



@article{hudak96:dsel,
    abstract = {this paper I will describe the results of using the functional language Haskell to build DSELs. Haskell has several features that make it particularly suitable for this, but other languages could also be used. On the other hand, there are features that don't exist in any language (to my knowledge) that would make things even easier; there is much more work to be done. Domain Specific Semantics It is surprisingly straightforward to design a DSEL for many specific applications. We have done so...},
    author = {Hudak, Paul},
    chapter = {196},
    citeulike-article-id = {3382016},
    citeulike-linkout-0 = {http://dx.doi.org/10.1145/242224.242477},
    citeulike-linkout-1 = {http://portal.acm.org/citation.cfm?id=242477},
    doi = {10.1145/242224.242477},
    journal = {ACM Computing Surveys},
    keywords = {haskell},
    number = {4es},
    posted-at = {2008-10-07 13:41:23},
    priority = {2},
    title = {Building domain-specific embedded languages},
    url = {http://portal.acm.org/citation.cfm?id=242477},
    volume = {28},
    year = {1996}
}



@inproceedings{muskens01:categorial,
    author = {Muskens, Reinhard},
    booktitle = {Proceedings of the LFG01 Conference, University of Hong Kong, Hong Kong},
    citeulike-article-id = {3380106},
    citeulike-linkout-0 = {http://let.uvt.nl/general/people/rmuskens/pubs/cglfg.pdf},
    editor = {Butt, Miriam and King, Tracy H.},
    keywords = {grammars, lfg},
    posted-at = {2008-10-06 15:56:13},
    priority = {2},
    publisher = {CSLI Publications},
    title = {Categorial Grammar and Lexical-Functional Grammar},
    url = {http://let.uvt.nl/general/people/rmuskens/pubs/cglfg.pdf},
    year = {2001}
}



@inproceedings{mctear99:cslu-toolkit,
    abstract = {The development of a spoken dialogue system requires the integration of the various components of spoken language technology, such as speech recognition, natural language processing, dialogue modelling, and speech synthesis. Recently several toolkits have been developed that provide support for this process, enabling developers who have no specialist knowledge of the component technologies to produce working spoken dialogue systems with relative ease. This paper reports on the use of CSLU's RAD ...},
    author = {Mctear, Michael F.},
    booktitle = {Proceedings, Sixth European Conference on Speech Communication and Technology (EUROSPEECH'99), Budapest, Hungary},
    citeulike-article-id = {3380072},
    citeulike-linkout-0 = {http://www.cslu.ogi.edu/toolkit/pubs/pdf/mctear\_EUROSPEECH\_99.pdf},
    keywords = {dialogue},
    month = {September},
    pages = {339--342},
    posted-at = {2008-10-06 15:46:30},
    priority = {2},
    publisher = {ISCA Archive},
    title = {Software to support research and development of spoken dialogue systems},
    url = {http://www.cslu.ogi.edu/toolkit/pubs/pdf/mctear\_EUROSPEECH\_99.pdf},
    year = {1999}
}



@inproceedings{degroote01:towards-acg,
    address = {Morristown, NJ, USA},
    author = {de Groote, Philippe},
    booktitle = {Proceedings of 39th Annual Meeting of the Association for Computational Linguistics, Toulouse, France},
    citeulike-article-id = {3362553},
    citeulike-linkout-0 = {http://acl.ldc.upenn.edu/P/P01/P01-1033.pdf},
    citeulike-linkout-1 = {http://dx.doi.org/10.3115/1073012.1073045},
    doi = {10.3115/1073012.1073045},
    keywords = {acg, grammars},
    location = {Toulouse, France},
    month = {July},
    pages = {252--259},
    posted-at = {2008-10-01 12:13:56},
    priority = {2},
    publisher = {Association for Computational Linguistics},
    title = {Towards abstract categorial grammars},
    url = {http://acl.ldc.upenn.edu/P/P01/P01-1033.pdf},
    year = {2001}
}



@inproceedings{brown96:fastcgi,
    author = {Brown, Mark R.},
    booktitle = {Programming the Web - a search for APIs, Fifth International World Wide Web Conference (WWW5), Paris, France},
    citeulike-article-id = {3320071},
    citeulike-linkout-0 = {http://www.cs.vu.nl/\~{}eliens/WWW5/papers/FastCGI.html},
    day = {6},
    editor = {Eli\"{e}ns, Anton},
    keywords = {web},
    month = {May},
    posted-at = {2008-09-23 08:52:11},
    priority = {2},
    title = {FastCGI: A High-Performance Gateway Interface},
    url = {http://www.cs.vu.nl/\~{}eliens/WWW5/papers/FastCGI.html},
    year = {1996}
}



@book{ranta95:ttg,
    address = {Oxford, UK},
    author = {Ranta, Aarne},
    citeulike-article-id = {3292351},
    keywords = {gf},
    month = {March},
    posted-at = {2008-09-19 10:07:11},
    priority = {2},
    publisher = {Oxford University Press},
    title = {Type-theoretical Grammar},
    year = {1995}
}



@phdthesis{fielding00:rest,
    abstract = {The World Wide Web has succeeded in large part because its software architecture has been designed to meet the needs of an Internet-scale distributed hypermedia system. The Web has been iteratively developed over the past ten years through a series of modifications to the standards that define its architecture. In order to identify those aspects of the Web that needed improvement and avoid undesirable modifications, a model for the modern Web architecture was needed to guide its design, definition, and deployment. Software architecture research investigates methods for determining how best to partition a system, how components identify and communicate with each other, how information is communicated, how elements of a system can evolve independently, and how all of the above can be described using formal and informal notations. My work is motivated by the desire to understand and evaluate the architectural design of network-based application software through principled use of architectural constraints, thereby obtaining the functional, performance, and social properties desired of an architecture. An architectural style is a named, coordinated set of architectural constraints. This dissertation defines a framework for understanding software architecture via architectural styles and demonstrates how styles can be used to guide the architectural design of network-based application software. A survey of architectural styles for network-based applications is used to classify styles according to the architectural properties they induce on an architecture for distributed hypermedia. I then introduce the Representational State Transfer (REST) architectural style and describe how REST has been used to guide the design and development of the architecture for the modern Web. REST emphasizes scalability of component interactions, generality of interfaces, independent deployment of components, and intermediary components to reduce interaction latency, enforce security, and encapsulate legacy systems. I describe the software engineering principles guiding REST and the interaction constraints chosen to retain those principles, contrasting them to the constraints of other architectural styles. Finally, I describe the lessons learned from applying REST to the design of the Hypertext Transfer Protocol and Uniform Resource Identifier standards, and from their subsequent deployment in Web client and server software.},
    author = {Fielding, Roy T.},
    citeulike-article-id = {3292273},
    citeulike-linkout-0 = {http://www.ics.uci.edu/\~{}fielding/pubs/dissertation/fielding\_dissertation.pdf},
    keywords = {web},
    posted-at = {2008-09-19 09:33:13},
    priority = {2},
    school = {University of California, Irvine},
    title = {Architectural Styles and the Design of Network-based Software Architectures},
    url = {http://www.ics.uci.edu/\~{}fielding/pubs/dissertation/fielding\_dissertation.pdf},
    year = {2000}
}



@misc{rfc-4627,
    author = {Crockford, Douglas},
    citeulike-article-id = {3292266},
    citeulike-linkout-0 = {http://www.ietf.org/rfc/rfc4627.txt},
    howpublished = {RFC 4627 (Informational)},
    keywords = {json},
    month = {July},
    number = {4627},
    posted-at = {2008-09-19 09:26:52},
    priority = {2},
    publisher = {IETF},
    series = {Request for Comments},
    title = {The application/json Media Type for JavaScript Object Notation (JSON)},
    url = {http://www.ietf.org/rfc/rfc4627.txt},
    year = {2006}
}



@book{ECMA-262,
    address = {Geneva, Switzerland},
    author = {International, E. C. M. A.},
    citeulike-article-id = {3292257},
    citeulike-linkout-0 = {http://www.ecma-international.org/publications/standards/Ecma-327.htm},
    edition = {Third},
    keywords = {ecmascript, javascript, programming},
    month = {December},
    posted-at = {2008-09-19 09:19:05},
    priority = {0},
    publisher = {ECMA (European Association for Standardizing Information and Communication Systems)},
    title = {ECMA-262: ECMAScript Language Specification},
    url = {http://www.ecma-international.org/publications/standards/Ecma-327.htm},
    year = {1999}
}



@inproceedings{moggi89:monads,
    abstract = {The λ-calculus is considered a useful mathematical tool in the study of programming languages. However, if one uses βη-conversion to prove equivalence of programs, then a gross simplification is introduced. The author gives a calculus based on a categorical semantics for computations, which provides a correct basis for proving equivalence of programs, independent from any specific computational model},
    address = {Washington, DC, USA},
    author = {Moggi, Eugenio},
    booktitle = {Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), Pacific Grove, CA, USA},
    citeulike-article-id = {3194099},
    citeulike-linkout-0 = {http://www.disi.unige.it/person/MoggiE/ftp/lics89.pdf},
    citeulike-linkout-1 = {http://dx.doi.org/10.1109/LICS.1989.39155},
    doi = {10.1109/LICS.1989.39155},
    month = {June},
    pages = {14--23},
    posted-at = {2008-09-04 15:32:26},
    priority = {2},
    publisher = {IEEE Computer Society Press},
    title = {Computational lambda-calculus and monads},
    url = {http://www.disi.unige.it/person/MoggiE/ftp/lics89.pdf},
    year = {1989}
}



@article{wadler92:monads,
    author = {Wadler, Philip},
    citeulike-article-id = {3192414},
    citeulike-linkout-0 = {http://homepages.inf.ed.ac.uk/wadler/papers/monads/monads.ps},
    journal = {Mathematical Structures in Computer Science},
    keywords = {haskell},
    number = {4},
    pages = {461--493},
    posted-at = {2008-09-04 14:42:10},
    priority = {2},
    title = {Comprehending Monads},
    url = {http://homepages.inf.ed.ac.uk/wadler/papers/monads/monads.ps},
    volume = {2},
    year = {1992}
}



@article{ranta04:semantics-type-theory,
    address = {Paris},
    author = {Ranta, Aarne},
    citeulike-article-id = {3185949},
    citeulike-linkout-0 = {http://www.ehess.fr/revue-msh/pdf/N165R925.pdf},
    journal = {Mathematics and Social Sciences},
    keywords = {semantics, type-theory},
    pages = {31--57},
    posted-at = {2008-09-03 14:02:15},
    priority = {2},
    publisher = {Centre d'analyse et math\'{e}matiques sociales, Ecole de Hautes Etudes en Sciences Sociales (EHESS)},
    title = {Computational Semantics in Type Theory},
    url = {http://www.ehess.fr/revue-msh/pdf/N165R925.pdf},
    volume = {165},
    year = {2004}
}



@inproceedings{barker01:integrity,
    address = {Somerville, MA},
    author = {Barker, Chris},
    booktitle = {WCCFL 20: Proceedings of the 20th West Coast Conference on Formal Linguistics},
    citeulike-article-id = {3182342},
    citeulike-linkout-0 = {http://semanticsarchive.net/Archive/2IxM2ExM/barker.integrity.pdf},
    editor = {Megerdoomian, Karine and Bar-El, Leora A.},
    keywords = {semantics},
    month = {February},
    posted-at = {2008-09-02 16:01:22},
    priority = {2},
    publisher = {Cascadilla Press},
    title = {Integrity: A Syntactic Constraint on Quantificational Scoping},
    url = {http://semanticsarchive.net/Archive/2IxM2ExM/barker.integrity.pdf},
    year = {2001}
}



@incollection{keller88:nester-cooper-storage,
    address = {Dordrecht},
    author = {Keller, W. R.},
    booktitle = {Natural Language Parsing and Linguistic Theories},
    citeulike-article-id = {3182096},
    editor = {Reyle, U. and Rohrer, C.},
    keywords = {semantics},
    pages = {432--447},
    posted-at = {2008-09-02 15:16:36},
    priority = {2},
    publisher = {Reidel},
    title = {Nested Cooper storage: The proper treatment of quantification in ordinary noun phrases},
    year = {1988}
}



@inproceedings{maccartney08:containment,
    address = {Manchester, UK},
    author = {Maccartney, Bill and Manning, Christopher D.},
    booktitle = {Proceedings of the 22nd International Conference on Computational Linguistics (Coling 2008)},
    citeulike-article-id = {3182046},
    citeulike-linkout-0 = {http://www.aclweb.org/anthology/C08-1066},
    citeulike-linkout-1 = {http://nlp.stanford.edu/\~{}wcmac/papers/natlog-coling08.pdf},
    keywords = {fracas, semantics},
    month = {August},
    pages = {521--528},
    posted-at = {2008-09-02 14:42:34},
    priority = {2},
    publisher = {Coling 2008 Organizing Committee},
    title = {Modeling Semantic Containment and Exclusion in Natural Language Inference},
    url = {http://www.aclweb.org/anthology/C08-1066},
    year = {2008}
}



@inproceedings{pulman07:case-study,
    author = {Pulman, Stephen G.},
    booktitle = {Proceedings of the Seventh International Workshop on Computational Semantics (IWCS-7), Tilburg, The Netherlands},
    citeulike-article-id = {3182037},
    citeulike-linkout-0 = {http://www.clg.ox.ac.uk/pulman/pdfpapers/tilburg\_final.pdf},
    editor = {Geertzen, Jeroen and Thijsse, Elias and Bunt, Harry and Schiffrin, Amanda},
    keywords = {semantics},
    pages = {181--196},
    posted-at = {2008-09-02 14:31:31},
    priority = {2},
    title = {Formal and Computational Semantics: a Case Study},
    url = {http://www.clg.ox.ac.uk/pulman/pdfpapers/tilburg\_final.pdf},
    year = {2007}
}



@inproceedings{shan01:monads-natural-language,
    author = {Shan, Chung-Chieh},
    booktitle = {Proceedings of the sixth ESSLLI Student Session, 13th European Summer School in Logic, Language and Information, Helsinki, Finland},
    citeulike-article-id = {3171669},
    citeulike-linkout-0 = {http://arxiv.org/abs/cs/0205026v1},
    editor = {Striegnitz, Kristina},
    keywords = {semantics},
    month = {August},
    pages = {275--288},
    posted-at = {2008-08-29 12:17:11},
    priority = {0},
    title = {Monads for natural language semantics},
    url = {http://arxiv.org/abs/cs/0205026v1},
    year = {2001}
}



@inproceedings{degroote01:type-raising,
    author = {de Groote, Philippe},
    booktitle = {Thirteenth Amsterdam Colloquium},
    citeulike-article-id = {3171519},
    citeulike-linkout-0 = {http://www.loria.fr/\~{}degroote/papers/amsterdam01.pdf},
    editor = {van Rooy, R. and Stokhof, M.},
    keywords = {continuations, semantics},
    month = {December},
    pages = {97--101},
    posted-at = {2008-08-29 10:43:16},
    priority = {2},
    publisher = {Institute for Logic, Language and Computation, Universiteit van Amsterdam},
    title = {Type raising, continuations, and classical logic},
    url = {http://www.loria.fr/\~{}degroote/papers/amsterdam01.pdf},
    year = {2001}
}



@inproceedings{shan04:delimited-continuations,
    address = {Birmingham B15 2TT, United Kingdom},
    author = {Shan, Chung-Chieh},
    booktitle = {Proceedings of the Fourth ACM SIGPLAN Continuations Workshop (CW'04), Venice, Italy},
    citeulike-article-id = {3171502},
    citeulike-linkout-0 = {http://arxiv.org/abs/cs/0404006v1},
    citeulike-linkout-1 = {http://www.cs.bham.ac.uk/\~{}hxt/cw04/shan.pdf},
    day = {17},
    editor = {Thielecke, Hayo},
    keywords = {continuations, semantics},
    month = {January},
    posted-at = {2008-08-29 10:29:21},
    priority = {0},
    publisher = {School of Computer Science, University of Birmingham},
    title = {Delimited continuations in natural language},
    url = {http://arxiv.org/abs/cs/0404006v1},
    year = {2004}
}



@article{barker02:continuations-quantification,
    abstract = {This paper proposes that the meanings of some natural language expressions should be thought of as functions on their own continuations. Continuations are a well-established technique in the theory of programming language semantics; in brief, a continuation is the entire default future of a computation. I show how a continuation-based grammar can unify several aspects of natural language quantification in a new way: merely stating the truth conditions for quantificational expressions in terms of continuations automatically accounts for scope displacement and scope ambiguity. To prove this claim, I exhibit a simple finite context-free grammar with a strictly compositional semantics in which quantificational NPs are interpreted in-situ but take semantic scope over larger constituents. There is no Quantifier Raising (nor any use of a level of Logical Form distinct from overt syntax), no Cooper Storage (or other similar mechanisms used in many recent HPSG, Categorial, or Type-logical treatments), and no need for type-shifting (as in Hendriks' Flexible Types account). Continuations also provide a natural account of generalized coordination that does not require either type-shifting or type-polymorphism. Compositionality issues are discussed in some detail.},
    address = {The Netherlands},
    author = {Barker, Chris},
    citeulike-article-id = {3171470},
    citeulike-linkout-0 = {http://barker.linguistics.fas.nyu.edu/Research/barker-continuations.pdf},
    citeulike-linkout-1 = {http://dx.doi.org/10.1023/A:1022183511876},
    citeulike-linkout-2 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.3998},
    doi = {10.1023/A:1022183511876},
    journal = {Natural Language Semantics},
    keywords = {continuations, semantics},
    number = {3},
    pages = {211--242},
    posted-at = {2008-08-29 10:13:00},
    priority = {2},
    publisher = {Kluwer Academic Publishers},
    title = {Continuations and the nature of quantification},
    url = {http://barker.linguistics.fas.nyu.edu/Research/barker-continuations.pdf},
    volume = {10},
    year = {2002}
}



@book{nordstrom90:programming-tt,
    abstract = {In recent years several formalisms for program construction have been introduced. One such formalism is the type theory developed by Per Martin-L¨of. It is well suited as a theory for program construction since it is possible to express both specifications and programs within the same formalism. Furthermore, the proof rules can be used to derive a correct program from a specification as well as to verify that a given program has a certain property. This book contains an introduction to type theory as a theory for program construction.},
    address = {USA},
    author = {Nordstr\"{o}m, Bengt and Petersson, Kent and Smith, Jan M.},
    citeulike-article-id = {2310446},
    citeulike-linkout-0 = {http://www.cs.chalmers.se/Cs/Research/Logic/book/},
    citeulike-linkout-1 = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20\&path=ASIN/0198538146},
    citeulike-linkout-2 = {http://www.amazon.de/exec/obidos/redirect?tag=citeulike01-21\&path=ASIN/0198538146},
    citeulike-linkout-3 = {http://www.amazon.fr/exec/obidos/redirect?tag=citeulike06-21\&path=ASIN/0198538146},
    citeulike-linkout-4 = {http://www.amazon.co.uk/exec/obidos/ASIN/0198538146/citeulike00-21},
    citeulike-linkout-5 = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/0198538146},
    citeulike-linkout-6 = {http://www.worldcat.org/isbn/0198538146},
    citeulike-linkout-7 = {http://books.google.com/books?vid=ISBN0198538146},
    citeulike-linkout-8 = {http://www.amazon.com/gp/search?keywords=0198538146\&index=books\&linkCode=qs},
    citeulike-linkout-9 = {http://www.librarything.com/isbn/0198538146},
    day = {19},
    howpublished = {Hardcover},
    isbn = {0198538146},
    keywords = {type-theory},
    month = {July},
    posted-at = {2008-08-07 16:37:39},
    priority = {2},
    publisher = {Oxford University Press},
    title = {Programming in Martin-L\"{o}f's Type Theory: An Introduction},
    url = {http://www.cs.chalmers.se/Cs/Research/Logic/book/},
    year = {1990}
}



@book{alexandrescu01:modern-cplusplus-design,
    address = {Indianapolis},
    author = {Alexandrescu, Andrei},
    citeulike-article-id = {602596},
    citeulike-linkout-0 = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20\&path=ASIN/0201704315},
    citeulike-linkout-1 = {http://www.amazon.de/exec/obidos/redirect?tag=citeulike01-21\&path=ASIN/0201704315},
    citeulike-linkout-2 = {http://www.amazon.fr/exec/obidos/redirect?tag=citeulike06-21\&path=ASIN/0201704315},
    citeulike-linkout-3 = {http://www.amazon.jp/exec/obidos/ASIN/0201704315},
    citeulike-linkout-4 = {http://www.amazon.co.uk/exec/obidos/ASIN/0201704315/citeulike00-21},
    citeulike-linkout-5 = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/0201704315},
    citeulike-linkout-6 = {http://www.worldcat.org/isbn/0201704315},
    citeulike-linkout-7 = {http://books.google.com/books?vid=ISBN0201704315},
    citeulike-linkout-8 = {http://www.amazon.com/gp/search?keywords=0201704315\&index=books\&linkCode=qs},
    citeulike-linkout-9 = {http://www.librarything.com/isbn/0201704315},
    day = {13},
    howpublished = {Paperback},
    isbn = {0201704315},
    keywords = {c-plus-plus},
    month = {February},
    posted-at = {2008-08-07 16:30:19},
    priority = {2},
    publisher = {Addison-Wesley Professional},
    title = {Modern C++ Design: Generic Programming and Design Patterns Applied},
    url = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/0201704315},
    year = {2001}
}



@inproceedings{bringert08:gf-slt,
    author = {Bringert, Bj\"{o}rn},
    booktitle = {Coling 2008: Proceedings of the workshop on Speech Processing for Safety Critical Translation and Pervasive Applications, Manchester, UK},
    citeulike-article-id = {2886387},
    citeulike-linkout-0 = {http://www.cs.chalmers.se/\~{}bringert/publ/gf-slt/gf-slt.pdf},
    citeulike-linkout-1 = {http://www.aclweb.org/anthology/W/W08/W08-1502},
    day = {23},
    keywords = {gf, speech, translation},
    month = {August},
    pages = {5--8},
    posted-at = {2008-06-12 09:09:36},
    priority = {0},
    publisher = {Coling 2008 Organizing Committee},
    title = {Speech Translation with Grammatical Framework},
    url = {http://www.cs.chalmers.se/\~{}bringert/publ/gf-slt/gf-slt.pdf},
    year = {2008}
}



@book{alshawi92:cle,
    abstract = {The Core Language Engine presents the theoretical and engineering advances embodied in one of the most comprehensive natural language processing systems designed to date. Recent research results from different areas of computational linguistics are integrated into a single elegant design with potential for application to tasks ranging from machine translation to information system interfaces. Bridging the gap between theoretical and implementation oriented literature, The Core Language Engine describes novel analyses and techniques developed by the contributors at SRI International's Cambridge Computer Science Research Centre. It spans topics that include a wide-coverage unification grammar for English syntax and semantics, context-dependent and contextually disambiguated logical form representations, interactive translation, efficient algorithms for parsing and generation, and mechanisms for quantifier scoping, reference resolution, and lexical acquisition.},
    address = {Cambridge, Mass.},
    author = {Alshawi, Hiyan},
    citeulike-article-id = {2713506},
    citeulike-linkout-0 = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20\&path=ASIN/0262011263},
    citeulike-linkout-1 = {http://www.amazon.de/exec/obidos/redirect?tag=citeulike01-21\&path=ASIN/0262011263},
    citeulike-linkout-2 = {http://www.amazon.fr/exec/obidos/redirect?tag=citeulike06-21\&path=ASIN/0262011263},
    citeulike-linkout-3 = {http://www.amazon.co.uk/exec/obidos/ASIN/0262011263/citeulike00-21},
    citeulike-linkout-4 = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/0262011263},
    citeulike-linkout-5 = {http://www.worldcat.org/isbn/0262011263},
    citeulike-linkout-6 = {http://books.google.com/books?vid=ISBN0262011263},
    citeulike-linkout-7 = {http://www.amazon.com/gp/search?keywords=0262011263\&index=books\&linkCode=qs},
    citeulike-linkout-8 = {http://www.librarything.com/isbn/0262011263},
    day = {15},
    howpublished = {Hardcover},
    isbn = {0262011263},
    keywords = {cle, grammars},
    month = {May},
    posted-at = {2008-06-11 19:32:47},
    priority = {2},
    publisher = {MIT Press},
    series = {ACL-MIT Series in Natural Language Processing},
    title = {The Core Language Engine},
    url = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/0262011263},
    year = {1992}
}



@inproceedings{power98:wysiwym,
    abstract = {Many kinds of knowledge-based system would be easier to develop and maintain if domain experts (as opposed to knowledge engineers) were in a position to define and edit the knowledge. From the viewpoint of domain experts, the best medium for defining the knowledge would be a text in natural language; however, natural language input cannot be decoded reliably unless written in controlled languages, which are difficult for domain experts to learn and use. WYSIWYM editing is an alternative...},
    address = {Chichester, England},
    author = {Power, Richard and Scott, Donia and Evans, Roger},
    booktitle = {13th European Conference on Artificial Intelligence (ECAI 1998)},
    citeulike-article-id = {1596289},
    citeulike-linkout-0 = {http://www.itri.brighton.ac.uk/projects/WYSIWYM/ecai98.ps},
    citeulike-linkout-1 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.3639},
    editor = {Prade, Henri},
    keywords = {syntax-editing},
    pages = {677--681},
    posted-at = {2008-06-11 13:58:13},
    priority = {2},
    publisher = {John Wiley and Sons},
    title = {What You See Is What You Meant: direct knowledge editings with natural language feedback},
    url = {http://www.itri.brighton.ac.uk/projects/WYSIWYM/ecai98.ps},
    year = {1998}
}



@mastersthesis{meza08:masters-thesis,
    author = {Meza-Moreno, Mois\'{e}s S.},
    citeulike-article-id = {2858819},
    keywords = {gf},
    posted-at = {2008-06-03 12:27:26},
    priority = {0},
    school = {Chalmers University of Technology},
    title = {Implementation of a JavaScript Syntax Editor and Parser for Grammatical Framework},
    year = {2008}
}



@book{citeulike:2857088,
    author = {Montague, Richard},
    citeulike-article-id = {2857088},
    editor = {Thomason, Richmond},
    keywords = {semantics},
    posted-at = {2008-06-02 15:23:25},
    priority = {2},
    publisher = {Yale University Press},
    title = {Formal Philosophy},
    year = {1974}
}



@article{montague73:ptq,
    address = {Dordrecht},
    author = {Montague, Richard},
    booktitle = {Approaches to Natural Language: proceedings of the 1970 Stanford workshop on Grammar and Semantics},
    citeulike-article-id = {2857079},
    editor = {Hintikka, J. and Moravcsik, J. and Suppes, P.},
    keywords = {semantics},
    pages = {221--242},
    posted-at = {2008-06-02 15:18:17},
    priority = {0},
    publisher = {Reidel},
    title = {The Proper Treatment of Quantification in Ordinary English},
    year = {1973}
}



@inproceedings{furbach08:loganswer-description,
    author = {Furbach, Ulrich and Gl\"{o}ckner, Ingo and Helbig, Hermann and Pelzer, Bj\"{o}rn},
    booktitle = {In Proceedings of the 4th International Joint Conference on Automated Reasoning (IJCAR-08), Sydney, Australia},
    citeulike-article-id = {2857004},
    citeulike-linkout-0 = {http://pi7.fernuni-hagen.de/gloeckner/ijcar08.pdf},
    keywords = {semantics},
    month = {August},
    posted-at = {2008-06-02 14:49:46},
    priority = {2},
    title = {LogAnswer - A Deduction-Based Question Answering System (System Description)},
    url = {http://pi7.fernuni-hagen.de/gloeckner/ijcar08.pdf},
    year = {2008}
}



@article{bos07:automated-deduction-nlu,
    abstract = {Very few natural language understanding applications employ methods from automated deduction. This is mainly because (i) a high level of interdisciplinary knowledge is required, (ii) there is a huge gap between formal semantic theory and practical implementation, and (iii) statistical rather than symbolic approaches dominate the current trends in natural language processing. Moreover, abduction rather than deduction is generally viewed as a promising way to apply reasoning in natural language understanding. We describe three applications where we show how first-order theorem proving and finite model construction can efficiently be employed in language understanding. The first is a text understanding system building semantic representations of texts, developed in the late 1990s. Theorem provers are here used to signal inconsistent interpretations and to check whether new contributions to the discourse are informative or not. This application shows that it is feasible to use general-purpose theorem provers for first-order logic, and that it pays off to use a battery of different inference engines as in practice they complement each other in terms of performance. The second application is a spoken-dialogue interface to a mobile robot and an automated home. We use the first-order theorem prover spass for checking inconsistencies and newness of information, but the inference tasks are complemented with the finite model builder mace used in parallel to the prover. The model builder is used to check for satisfiability of the input; in addition, the produced finite and minimal models are used to determine the actions that the robot or automated house has to execute. When the semantic representation of the dialogue as well as the number of objects in the context are kept fairly small, response times are acceptable to human users. The third demonstration of successful use of first-order inference engines comes from the task of recognising entailment between two (short) texts. We run a robust parser producing semantic representations for both texts, and use the theorem prover vampire to check whether one text entails the other. For many examples it is hard to compute the appropriate background knowledge in order to produce a proof, and the model builders mace and paradox are used to estimate the likelihood of an entailment.},
    author = {Bos, Johan},
    citeulike-article-id = {2856994},
    citeulike-linkout-0 = {http://science-direct.com/science/article/B758H-4P61N94-1/1/7775f77993736a76577c599dbaefa76b},
    citeulike-linkout-1 = {http://dx.doi.org/10.1016/j.jal.2007.07.008},
    doi = {10.1016/j.jal.2007.07.008},
    journal = {Journal of Applied Logic},
    keywords = {fol, semantics},
    posted-at = {2008-06-02 14:45:11},
    priority = {2},
    title = {Applying automated deduction to natural language understanding},
    url = {http://science-direct.com/science/article/B758H-4P61N94-1/1/7775f77993736a76577c599dbaefa76b},
    volume = {In Press, Corrected Proof},
    year = {2007}
}



@incollection{cooper96:fracas-test-suite,
    author = {Cooper, Robin and Crouch, Dick and van Eijck, Jan and Fox, Chris and van Genabith, Josef and Jaspars, Jan and Kamp, Hans and Milward, David and Pinkal, Manfred and Poesio, Massimo and Pulman, Steve and Briscoe, Ted and Maier, Holger and Konrad, Karsten},
    booktitle = {Using the Framework, Deliverable D16},
    chapter = {3},
    citeulike-article-id = {2816930},
    citeulike-linkout-0 = {ftp://ftp.cogsci.ed.ac.uk/pub/FRACAS/del16.ps.gz},
    citeulike-linkout-1 = {http://www.cogsci.ed.ac.uk/\~{}jbos/rte/fracas.pdf},
    keywords = {fracas, semantics},
    month = {January},
    posted-at = {2008-05-20 16:39:35},
    priority = {2},
    publisher = {The FRACAS Consortium},
    title = {A Semantic Test Suite},
    url = {ftp://ftp.cogsci.ed.ac.uk/pub/FRACAS/del16.ps.gz},
    year = {1996}
}



@article{barwise81:generalized-quantifiers,
    author = {Barwise, Jon and Cooper, Robin},
    citeulike-article-id = {2816773},
    citeulike-linkout-0 = {http://dx.doi.org/10.1007/BF00350139},
    day = {1},
    doi = {10.1007/BF00350139},
    journal = {Linguistics and Philosophy},
    keywords = {semantics},
    month = {June},
    number = {2},
    pages = {159--219},
    posted-at = {2008-05-20 16:10:02},
    priority = {2},
    title = {Generalized quantifiers and natural language},
    url = {http://dx.doi.org/10.1007/BF00350139},
    volume = {4},
    year = {1981}
}



@book{cooper83:quantification,
    author = {Cooper, R.},
    citeulike-article-id = {2816758},
    citeulike-linkout-0 = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20\&path=ASIN/9027714843},
    citeulike-linkout-1 = {http://www.amazon.de/exec/obidos/redirect?tag=citeulike01-21\&path=ASIN/9027714843},
    citeulike-linkout-2 = {http://www.amazon.fr/exec/obidos/redirect?tag=citeulike06-21\&path=ASIN/9027714843},
    citeulike-linkout-3 = {http://www.amazon.jp/exec/obidos/ASIN/9027714843},
    citeulike-linkout-4 = {http://www.amazon.co.uk/exec/obidos/ASIN/9027714843/citeulike00-21},
    citeulike-linkout-5 = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/9027714843},
    citeulike-linkout-6 = {http://www.worldcat.org/isbn/9027714843},
    citeulike-linkout-7 = {http://books.google.com/books?vid=ISBN9027714843},
    citeulike-linkout-8 = {http://www.amazon.com/gp/search?keywords=9027714843\&index=books\&linkCode=qs},
    citeulike-linkout-9 = {http://www.librarything.com/isbn/9027714843},
    day = {29},
    edition = {1},
    howpublished = {Hardcover},
    isbn = {9027714843},
    keywords = {semantics},
    month = {April},
    posted-at = {2008-05-20 16:02:38},
    priority = {2},
    publisher = {Springer},
    series = {Studies in Linguistics and Philosophy},
    title = {Quantification and Syntactic Theory},
    url = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/9027714843},
    volume = {21},
    year = {1983}
}



@article{wadler93:monads,
    abstract = {Moggi's use of monads to factor semantics is used to model the composable
continuations of Danvy and Filinski. This yields some insights into the type systems
proposed by Murthy and by Danvy and Filinski. Interestingly, modelling some aspects
of composable continuations requires a structure that is almost, but not quite, a monad.
1.},
    author = {Wadler, Philip},
    citeulike-article-id = {1213941},
    citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.2608},
    journal = {Lisp and Symbolic Computation},
    keywords = {continuations, haskell},
    number = {1},
    pages = {39--56},
    posted-at = {2008-05-20 15:47:51},
    priority = {2},
    title = {Monads and Composable Continuations},
    url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.2608},
    volume = {7},
    year = {1994}
}



@incollection{zwicky75:ambiguity-tests,
    address = {New York},
    author = {Zwicky, Arnold M. and Sadock, Jerrold M.},
    booktitle = {Syntax and Semantics},
    citeulike-article-id = {2816718},
    citeulike-linkout-0 = {http://www.stanford.edu/\~{}zwicky/ambiguity-tests-and-how-to-fail-them.pdf},
    editor = {Kimball, John P.},
    keywords = {semantics},
    month = {July},
    posted-at = {2008-05-20 15:45:17},
    priority = {2},
    publisher = {Academic Press},
    title = {Ambiguity tests and how to fail them},
    url = {http://www.stanford.edu/\~{}zwicky/ambiguity-tests-and-how-to-fail-them.pdf},
    volume = {4},
    year = {1975}
}



@inproceedings{khegai06:gf-mt,
    author = {Khegai, Janna},
    booktitle = {Proceedings of EAMT-2006, 11th Annual conference of the European Association for Machine Translation, Oslo, Norway},
    citeulike-article-id = {2746156},
    citeulike-linkout-0 = {http://www.mt-archive.info/EAMT-2006-Khegai.pdf},
    keywords = {gf, translation},
    month = {June},
    pages = {95--104},
    posted-at = {2008-05-02 16:54:37},
    priority = {2},
    title = {Grammatical Framework (GF) for MT in sublanguage domains},
    url = {http://www.mt-archive.info/EAMT-2006-Khegai.pdf},
    year = {2006}
}



@book{blackburn05:compsem,
    abstract = {How can computers distinguish the coherent from the unintelligible, recognize new information in a sentence, or draw inferences from a natural language passage? Computational semantics is an exciting new field that seeks answers to these questions, and this volume is the first textbook wholly devoted to this growing subdiscipline. The book explains the underlying theoretical issues and fundamental techniques for computing semantic representations for fragments of natural language. This volume will be an essential text for computer scientists, linguists, and anyone interested in the development of computational semantics.},
    author = {Blackburn, Patrick and Bos, Johan},
    citeulike-article-id = {2682280},
    citeulike-linkout-0 = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20\&path=ASIN/1575864967},
    citeulike-linkout-1 = {http://www.amazon.de/exec/obidos/redirect?tag=citeulike01-21\&path=ASIN/1575864967},
    citeulike-linkout-2 = {http://www.amazon.fr/exec/obidos/redirect?tag=citeulike06-21\&path=ASIN/1575864967},
    citeulike-linkout-3 = {http://www.amazon.jp/exec/obidos/ASIN/1575864967},
    citeulike-linkout-4 = {http://www.amazon.co.uk/exec/obidos/ASIN/1575864967/citeulike00-21},
    citeulike-linkout-5 = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/1575864967},
    citeulike-linkout-6 = {http://www.worldcat.org/isbn/1575864967},
    citeulike-linkout-7 = {http://books.google.com/books?vid=ISBN1575864967},
    citeulike-linkout-8 = {http://www.amazon.com/gp/search?keywords=1575864967\&index=books\&linkCode=qs},
    citeulike-linkout-9 = {http://www.librarything.com/isbn/1575864967},
    day = {06},
    howpublished = {Paperback},
    isbn = {1575864967},
    keywords = {fol, semantics},
    month = {April},
    posted-at = {2008-04-17 15:57:44},
    priority = {0},
    publisher = {Center for the Study of Language and Information},
    title = {Representation and Inference for Natural Language: A First Course in Computational Semantics},
    url = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/1575864967},
    year = {2005}
}



@article{furuta88:editing-structured-documents,
    author = {Furuta, R. and Quint, V. and Andre, J.},
    citeulike-article-id = {2642045},
    citeulike-linkout-0 = {http://cajun.cs.nott.ac.uk/wiley/journals/epobetan/pdf/volume1/issue1/eprxf011.pdf},
    journal = {Electronic Publishing},
    keywords = {syntax-editing},
    number = {1},
    pages = {19--44},
    posted-at = {2008-04-08 17:18:59},
    priority = {2},
    title = {{Interactively Editing Structured Documents}},
    url = {http://cajun.cs.nott.ac.uk/wiley/journals/epobetan/pdf/volume1/issue1/eprxf011.pdf},
    volume = {1},
    year = {1988}
}



@inproceedings{cohen06:wexed,
    author = {Cohen, Arjeh and Cuypers, Hans and Poels, Karin and Spanbroek, Mark and Verrijzer, Rikko},
    booktitle = {WebALT 2006, First WebALT Conference and Exhibition, Eindhoven, The Netherlands},
    citeulike-article-id = {2642011},
    citeulike-linkout-0 = {http://www.win.tue.nl/\~{}amc/pub/wexed.pdf},
    editor = {Sepp\"{a}l\"{a}, Mika and Xambo, Sebastian and Caprotti, Olga},
    keywords = {gf, syntax-editing, webalt},
    month = {January},
    pages = {141--145},
    posted-at = {2008-04-08 17:00:42},
    priority = {2},
    title = {WExEd - WebALT Exercise Editor for Multilingual Mathematical Exercises},
    url = {http://www.win.tue.nl/\~{}amc/pub/wexed.pdf},
    year = {2006}
}



@book{beckert07:key,
    address = {Heidelberg},
    citeulike-article-id = {2641989},
    citeulike-linkout-0 = {http://dx.doi.org/10.1007/978-3-540-69061-0},
    doi = {10.1007/978-3-540-69061-0},
    editor = {Beckert, Bernhard and H\"{a}hnle, Reiner and Schmitt, Peter H.},
    keywords = {gf, syntax-editing},
    month = {April},
    posted-at = {2008-04-08 16:45:27},
    priority = {2},
    publisher = {Springer},
    series = {Lecture Notes in Computer Science},
    title = {Verification of Object-Oriented Software: The KeY Approach},
    url = {http://dx.doi.org/10.1007/978-3-540-69061-0},
    volume = {4334},
    year = {2007}
}



@inproceedings{johannisson03:gramlets,
    author = {Johannisson, Kristofer and Khegai, Janna and Forsberg, Markus and Ranta, Aarne},
    booktitle = {The Joint Winter Meeting of Computing Science and Computer Engineering},
    citeulike-article-id = {2641893},
    keywords = {gf, syntax-editing},
    posted-at = {2008-04-08 16:06:56},
    priority = {3},
    publisher = {Chalmers University of Technology},
    title = {{From Grammars to Gramlets}},
    year = {2003}
}



@incollection{khegai03:syntax-editing,
    abstract = {GF (Grammatical Framework) makes it possible to perform multilingual authoring of documents in restricted languages. The idea is to use an object in type theory to describe the common abstract syntax of a document and then map this object to a concrete syntax in the different languages using linearization functions, one for each language. Incomplete documents are represented using metavariables in type theory. The system belongs to the tradition of logical frameworks in computer science. The paper gives a description of how a user can use the editor to build a document in several languages and also shows some examples how ambiguity is resolved using type checking. There is a brief description of how GF grammars are written for new domains and how linearization functions are de.ned.},
    author = {Khegai, Janna and Nordstr\"{o}m, Bengt and Ranta, Aarne},
    booktitle = {Computational Linguistics and Intelligent Text Processing},
    citeulike-article-id = {2641876},
    citeulike-linkout-0 = {http://dx.doi.org/10.1007/3-540-36456-0\_48},
    doi = {10.1007/3-540-36456-0\_48},
    editor = {Gelbukh, Alexander},
    journal = {Computational Linguistics and Intelligent Text Processing},
    keywords = {gf, syntax-editing},
    pages = {199--204},
    posted-at = {2008-04-08 15:57:37},
    priority = {0},
    series = {Lecture Notes in Computer Science},
    title = {Multilingual Syntax Editing in GF},
    url = {http://dx.doi.org/10.1007/3-540-36456-0\_48},
    volume = {2588},
    year = {2003}
}



@incollection{ranta08:grammar-libraries,
    author = {Ranta, Aarne},
    booktitle = {From semantics to computer science: essays in honor of Gilles Kahn},
    citeulike-article-id = {2641830},
    citeulike-linkout-0 = {http://www.cs.chalmers.se/\~{}aarne/articles/libraries-kahn.pdf},
    editor = {Bertot, Yves and Huet, G\'{e}rard and L\'{e}vy, Jean-Jacques and Plotkin, Gordon},
    keywords = {gf},
    posted-at = {2008-04-08 15:52:29},
    priority = {0},
    publisher = {Cambridge University Press},
    title = {Grammars as software libraries},
    url = {http://www.cs.chalmers.se/\~{}aarne/articles/libraries-kahn.pdf},
    year = {2008}
}



@article{teitelbaum81:program-synthesizer,
    address = {New York, NY, USA},
    author = {Teitelbaum, Tim and Reps, Thomas},
    citeulike-article-id = {2075692},
    citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=358755},
    citeulike-linkout-1 = {http://dx.doi.org/10.1145/358746.358755},
    doi = {10.1145/358746.358755},
    issn = {0001-0782},
    journal = {Commun. ACM},
    keywords = {syntax-editing},
    month = {September},
    number = {9},
    pages = {563--573},
    posted-at = {2008-04-08 15:47:04},
    priority = {3},
    publisher = {ACM},
    title = {The Cornell program synthesizer: a syntax-directed programming environment},
    url = {http://dx.doi.org/10.1145/358746.358755},
    volume = {24},
    year = {1981}
}



@inproceedings{meza08:syntax-editing,
    address = {Heidelberg},
    author = {Meza-Moreno, Mois\'{e}s S. and Bringert, Bj\"{o}rn},
    booktitle = {Advances in Natural Language Processing, 6th International Conference, GoTAL 2008, Gothenburg, Sweden},
    citeulike-article-id = {2616731},
    citeulike-linkout-0 = {http://dx.doi.org/10.1007/978-3-540-85287-2\_32},
    citeulike-linkout-1 = {http://www.cs.chalmers.se/\~{}bringert/publ/syntax-editor/syntax-editor.pdf},
    doi = {10.1007/978-3-540-85287-2\_32},
    editor = {Nordstr\"{o}m, Bengt and Ranta, Aarne},
    keywords = {gf, syntax-editing},
    location = {Gothenburg, Sweden},
    month = {August},
    pages = {336--347},
    posted-at = {2008-03-31 17:25:33},
    priority = {0},
    publisher = {Springer},
    series = {Lecture Notes in Computer Science},
    title = {Interactive Multilingual Web Applications with Grammatical Framework},
    url = {http://www.cs.chalmers.se/\~{}bringert/publ/syntax-editor/syntax-editor.pdf},
    volume = {5221},
    year = {2008}
}



@electronic{citeulike:2471778,
    author = {Rawlins, Kyle},
    citeulike-article-id = {2471778},
    citeulike-linkout-0 = {http://people.ucsc.edu/\~{}krawlins/clsbib/},
    keywords = {semantics},
    posted-at = {2008-03-05 10:28:35},
    priority = {0},
    title = {Computational Semantics Information},
    url = {http://people.ucsc.edu/\~{}krawlins/clsbib/}
}



@inproceedings{maccartney07:WTEP,
    address = {Prague},
    author = {Maccartney, Bill and Manning, Christopher D.},
    booktitle = {Proceedings of the ACL-PASCAL Workshop on Textual Entailment and Paraphrasing},
    citeulike-article-id = {2471513},
    citeulike-linkout-0 = {http://www.aclweb.org/anthology/W/W07/W07-1431},
    keywords = {fracas, semantics},
    pages = {193--200},
    posted-at = {2008-03-05 10:10:26},
    priority = {0},
    publisher = {Association for Computational Linguistics},
    title = {Natural Logic for Textual Inference},
    url = {http://www.aclweb.org/anthology/W/W07/W07-1431},
    year = {2007}
}



@article{seki91:mcfg,
    address = {Essex, UK},
    author = {Seki, Hiroyuki and Matsumura, Takashi and Fujii, Mamoru and Kasami, Tadao},
    citeulike-article-id = {2386394},
    citeulike-linkout-0 = {http://dx.doi.org/10.1016/0304-3975(91)90374-B},
    citeulike-linkout-1 = {http://portal.acm.org/citation.cfm?id=123648},
    doi = {10.1016/0304-3975(91)90374-B},
    issn = {0304-3975},
    journal = {Theoretical Computer Science},
    keywords = {grammars},
    month = {October},
    number = {2},
    pages = {191--229},
    posted-at = {2008-02-15 14:36:49},
    priority = {2},
    publisher = {Elsevier Science Publishers Ltd.},
    title = {On multiple context-free grammars},
    url = {http://dx.doi.org/10.1016/0304-3975(91)90374-B},
    volume = {88},
    year = {1991}
}



@article{shieber95:deductive-parsing,
    abstract = {We present a system for generating parsers based directly on the metaphor of parsing as deduction. Parsing algorithms can be represented directly as deduction systems, and a single deduction engine can interpret such deduction systems so as to implement the corresponding parser. The method generalizes easily to parsers for augmented phrase structure formalisms, and has been used for rapid protoyping of parsing algorithms for a variety of formalisms including variants of tree-adjoining grammars, ...},
    author = {Shieber, Stuart M. and Schabes, Yves and Pereira, Fernando C. N.},
    citeulike-article-id = {741855},
    citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.8763},
    journal = {Journal of Logic Programming},
    keywords = {grammars},
    number = {1\&2},
    pages = {3--36},
    posted-at = {2008-02-15 14:30:38},
    priority = {2},
    title = {Principles and Implementation of Deductive Parsing},
    url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.8763},
    volume = {24},
    year = {1995}
}



@article{bringert:composOp-jfp,
    abstract = {This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here  ” almost compositional” means that for all of the constructors in the type(s), except a limited number of them, the result of the function depends only on the constructor and the results of calling the function on the constructor's arguments. The pattern consists of a generic part constructed once for each data type or family of data types, and a task-specific part. The generic part contains the code for the predictable compositional cases, leaving the interesting work to the task-specific part. Examples of the pattern are given, implemented in dependent type theory with inductive families, in Haskell with generalized algebraic data types and rank-2 polymorphism, and in Java using a variant of the Visitor design pattern. The relationships to the  ” Scrap Your Boilerplate” approach to generic programming, and to general tree types in dependent type theory, are investigated by reimplementing our operations using those frameworks.},
    address = {Cambridge, UK},
    author = {Bringert, Bj\"{o}rn and Ranta, Aarne},
    citeulike-article-id = {2360419},
    citeulike-linkout-0 = {http://dx.doi.org/10.1017/S0956796808006898},
    doi = {10.1017/S0956796808006898},
    journal = {Journal of Functional Programming},
    keywords = {gadt, generics, haskell},
    number = {5-6},
    pages = {567--598},
    posted-at = {2008-02-10 22:05:42},
    priority = {0},
    publisher = {Cambridge University Press},
    title = {A Pattern for Almost Compositional Functions},
    url = {http://dx.doi.org/10.1017/S0956796808006898},
    volume = {18},
    year = {2008}
}



@book{unicode50,
    abstract = {"Hard copy versions of the Unicode Standard have been among the most crucial and most heavily used reference books in my personal library for years." --Donald E. Knuth, The Art of Computer Programming "For more than a decade, Unicode has been a foundation for many Microsoft products and technologies; Unicode Standard Version 5.0 will help us deliver important new benefits to users." --Bill Gates, chairman, Microsoft Corporation "The path W3C follows to making text on the Web truly global is Unicode." --Sir Tim Berners-Lee, kbe, Web inventor and director of the World Wide Consortium (W3C) "Without Unicode, Java wouldn't be Java, and the Internet would have a harder time connecting the people of the world." --James Gosling, Inventor of Java, Sun Microsystems, Inc. These and other software luminaries recognize that Unicode has become an indispensable tool for supporting an increasingly global marketplace (see inside for more acclaim). A comprehensive system of standards for representing alphabets throughout the world, Unicode is the basis for modern programming-- Windows, XML, Python, PERL, Mac OS, Linux--and every major search engine and browser in operation today. New to Unicode Version 5.0: - A stable foundation for Unicode Security Mechanisms - Property data for the Unicode Collation Algorithm and Common Locale Data Repository - Improvements to the Unicode Encoding Model for UTF-8 - Rigorous stability of case folding and identifiers for improved interoperability and backward compatibility--enabling additional new ways to optimize code - A systematic framework for improved text processing for greater reliability--covering combining characters, Unicode strings, line breaking, and segmentation This new edition of Unicode's official reference manual has been substantially updated to document the latest revisions to the Unicode Standard, with hundreds of pages of new information. It includes major revisions to text, figures, tables, definitions, and conformance clauses, and provides clear and practical answers to common questions. For the first time, the book contains the Unicode Standard Annexes, which specify vital processes such as text normalization and identifier parsing. These improvements are so important that Version 5.0 is the basis for Microsoft's Vista generation of operating systems, and is included in upgrade plans for Google, Yahoo!, and ICU, to name but a few. This is the one book all developers using Unicode must have.},
    author = {{The Unicode Consortium} and Allen, Julie},
    citeulike-article-id = {2065295},
    citeulike-linkout-0 = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20\&path=ASIN/0321480910},
    citeulike-linkout-1 = {http://www.amazon.de/exec/obidos/redirect?tag=citeulike01-21\&path=ASIN/0321480910},
    citeulike-linkout-2 = {http://www.amazon.fr/exec/obidos/redirect?tag=citeulike06-21\&path=ASIN/0321480910},
    citeulike-linkout-3 = {http://www.amazon.co.uk/exec/obidos/ASIN/0321480910/citeulike00-21},
    citeulike-linkout-4 = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/0321480910},
    citeulike-linkout-5 = {http://www.worldcat.org/isbn/0321480910},
    citeulike-linkout-6 = {http://books.google.com/books?vid=ISBN0321480910},
    citeulike-linkout-7 = {http://www.amazon.com/gp/search?keywords=0321480910\&index=books\&linkCode=qs},
    citeulike-linkout-8 = {http://www.librarything.com/isbn/0321480910},
    day = {19},
    edition = {Fifth},
    howpublished = {Hardcover},
    isbn = {0321480910},
    keywords = {unicode},
    month = {November},
    posted-at = {2008-02-07 15:10:27},
    priority = {1},
    publisher = {Addison-Wesley Professional},
    title = {The Unicode Standard, Version 5.0},
    url = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/0321480910},
    year = {2006}
}



@inproceedings{burden05:lcfrs,
    address = {Vancouver, British Columbia},
    author = {Burden, H\r{a}kan and Ljungl\"{o}f, Peter},
    booktitle = {Proceedings of the Ninth International Workshop on Parsing Technology},
    citeulike-article-id = {2349372},
    citeulike-linkout-0 = {http://www.aclweb.org/anthology/W/W05/W05-1502},
    keywords = {grammars},
    pages = {11--17},
    posted-at = {2008-02-07 15:00:18},
    priority = {0},
    publisher = {Association for Computational Linguistics},
    title = {Parsing Linear Context-Free Rewriting Systems},
    url = {http://www.aclweb.org/anthology/W/W05/W05-1502},
    year = {2005}
}



@inproceedings{loh06:open-data-types,
    address = {New York, NY, USA},
    author = {L\"oh, Andres and Hinze, Ralf},
    booktitle = {PPDP '06: Proceedings of the 8th ACM SIGPLAN symposium on Principles and practice of declarative programming},
    citeulike-article-id = {2204432},
    citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1140352},
    isbn = {1595933883},
    keywords = {haskell},
    pages = {133--144},
    posted-at = {2008-01-07 17:08:47},
    priority = {0},
    publisher = {ACM},
    title = {Open data types and open functions},
    url = {http://portal.acm.org/citation.cfm?id=1140352},
    year = {2006}
}



@inproceedings{petersson89:tree-set-constructor,
    address = {Heidelberg},
    author = {Petersson, Kent and Synek, Dan},
    booktitle = {Category Theory and Computer Science},
    citeulike-article-id = {2204359},
    citeulike-linkout-0 = {http://dx.doi.org/10.1007/BFb0018349},
    doi = {10.1007/BFb0018349},
    keywords = {type-theory},
    pages = {128--140},
    posted-at = {2008-01-07 16:31:45},
    priority = {0},
    publisher = {Springer},
    series = {Lecture Notes in Computer Science},
    title = {A set constructor for inductive sets in Martin-L\"{o}f's type theory},
    url = {http://dx.doi.org/10.1007/BFb0018349},
    volume = {389},
    year = {1989}
}



@phdthesis{forsberg07:phd,
    author = {Forsberg, Markus},
    citeulike-article-id = {2151429},
    citeulike-linkout-0 = {http://www.cs.chalmers.se/\~{}markus/phd2007\_print\_version.pdf},
    keywords = {haskell},
    month = {September},
    posted-at = {2007-12-20 12:02:51},
    priority = {2},
    school = {G\"{o}teborg University and Chalmers University of Technology},
    title = {Three Tools for Language Processing: BNF Converter, Functional Morphology, and Extract},
    url = {http://www.cs.chalmers.se/\~{}markus/phd2007\_print\_version.pdf},
    year = {2007}
}



@phdthesis{vene00:phd,
    author = {Vene, Varmo},
    citeulike-article-id = {2141253},
    citeulike-linkout-0 = {http://www.cs.ut.ee/\~{}varmo/papers/thesis.pdf},
    day = {26},
    keywords = {haskell},
    month = {May},
    posted-at = {2007-12-18 15:08:10},
    priority = {2},
    school = {Faculty of Mathematics, University of Tartu, Estonia},
    title = {Categorial programming with inductive and coinductive types},
    url = {http://www.cs.ut.ee/\~{}varmo/papers/thesis.pdf},
    year = {2000}
}



@inproceedings{gibbons06:iterator-msfp,
    abstract = {The Iterator pattern gives a clean interface for element-by-element access to a collection. Imperative iterations using the pattern have two simultaneous aspects: mapping and accumulating. Various functional iterations model one or other of these, but not both simultaneously. We argue that McBride and Paterson's idioms, and in particular the corresponding traverse operator, do exactly this, and therefore capture the essence of the Iterator pattern. We present some axioms for traversal, and illustrate with a simple example, the repmin problem.},
    address = {Swindon, UK},
    author = {Gibbons, Jeremy and Oliveira, Bruno C.},
    booktitle = {Workshop on Mathematically Structured Functional Programming (MSFP 2006), Kuressaare, Estonia},
    citeulike-article-id = {2105258},
    citeulike-linkout-0 = {http://www.comlab.ox.ac.uk/jeremy.gibbons/publications/iterator-msfp.pdf},
    citeulike-linkout-1 = {http://www.bcs.org/upload/pdf/ewic\_ms06\_paper7.pdf},
    day = {2},
    editor = {Mcbride, Conor and Uustalu, Tarmo},
    keywords = {haskell},
    month = {July},
    posted-at = {2007-12-13 16:19:29},
    priority = {2},
    publisher = {British Computer Society},
    series = {Electronic Workshops in Computing (eWiC)},
    title = {The Essence of the Iterator Pattern},
    url = {http://www.comlab.ox.ac.uk/jeremy.gibbons/publications/iterator-msfp.pdf},
    year = {2006}
}



@inproceedings{leivant83:polymorphic-type-inference,
    abstract = {The benefits of strong typing to disciplined programming, to
 compile-time error detection and to program verification are well
 known. Strong typing is especially natural for functional
 (applicative) languages, in which function application is the
 central construct, and type matching is therefore a principal
 program correctness check. In practice, however, assigning a type
 to each and every expression in a functional program can be
 prohibitively cumbersome. As expressions are compounded, the task
 of assigning a type to each expression and subexpression becomes
 practically impossible, even more so because the type-expressions
 themselves grow longer. It becomes imperative therefore to design
 friendly programming environments that permit the user type-free
 programming, but that generate fully typed programs in which the
 types of all expressions are inferred by the system from the
 program. For interactive functional programming environments of the
 kind implemented for the Edinburgh functional programming language
 ML, a type-inference system is an invaluable tool for on-line
 parse-time error detection and debugging.},
    address = {New York, NY, USA},
    author = {Leivant, Daniel},
    booktitle = {POPL '83: Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages},
    citeulike-article-id = {2057629},
    citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=567077},
    citeulike-linkout-1 = {http://dx.doi.org/10.1145/567067.567077},
    doi = {10.1145/567067.567077},
    isbn = {0-89791-090-7},
    keywords = {type-systems},
    location = {Austin, Texas},
    pages = {88--98},
    posted-at = {2007-12-04 17:31:44},
    priority = {2},
    publisher = {ACM},
    title = {Polymorphic type inference},
    url = {http://dx.doi.org/10.1145/567067.567077},
    year = {1983}
}



@article{peyton-jones07:arbitrary-rank,
    address = {Cambridge, UK},
    author = {Peyton-Jones, Simon and Vytiniotis, Dimitrios and Weirich, Stephanie and Shields, Mark},
    citeulike-article-id = {2057614},
    citeulike-linkout-0 = {http://dx.doi.org/10.1017/S0956796806006034},
    citeulike-linkout-1 = {http://research.microsoft.com/\~{}simonpj/papers/higher-rank/},
    doi = {10.1017/S0956796806006034},
    journal = {Journal of Functional Programming},
    keywords = {haskell},
    number = {1},
    pages = {1--82},
    posted-at = {2007-12-04 17:23:39},
    priority = {2},
    publisher = {Cambridge University Press},
    title = {Practical type inference for arbitrary-rank types},
    url = {http://research.microsoft.com/\~{}simonpj/papers/higher-rank/},
    volume = {17},
    year = {2007}
}



@inproceedings{coquand99:stt,
    abstract = {We present our implementation AGDA of type theory. We limit ourselves in this presentation to a rather primitive form of type theory (dependent product with a simple notion of sorts) that we extend to structure facility we find in most programming language: let expressions (local definition) and a package mechanism. We call this language Structured Type Theory.},
    author = {Coquand, Catarina and Coquand, Thierry},
    booktitle = {Workshop on Logical Frameworks and Meta-languages (LFM'99), Paris, France},
    citeulike-article-id = {612077},
    citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.3778},
    day = {28},
    keywords = {agda},
    month = {September},
    posted-at = {2007-12-04 16:15:10},
    priority = {2},
    title = {Structured type theory},
    url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.3778},
    year = {1999}
}



@phdthesis{norell07:phd,
    address = {G\"{o}teborg, Sweden},
    author = {Norell, Ulf},
    citeulike-article-id = {2057448},
    citeulike-linkout-0 = {http://www.cs.chalmers.se/\~{}ulfn/papers/thesis.pdf},
    keywords = {agda},
    posted-at = {2007-12-04 16:11:47},
    priority = {2},
    school = {Department of Computer Science and Engineering, Chalmers University of Technology},
    title = {Towards a practical programming language based on dependent type theory},
    url = {http://www.cs.chalmers.se/\~{}ulfn/papers/thesis.pdf},
    year = {2007}
}



@misc{bringert07:lic,
    author = {Bringert, Bj\"{o}rn},
    citeulike-article-id = {1781526},
    citeulike-linkout-0 = {http://www.cs.chalmers.se/\~{}bringert/publ/lic/lic.pdf},
    howpublished = {Licentiate thesis, Department of Computer Science and Engineering, Chalmers University of Technology and University of Gothenburg},
    keywords = {gf, grammars, multimodal, speech},
    month = {October},
    posted-at = {2007-10-17 22:53:47},
    priority = {0},
    title = {Compiling Grammar-based Speech Application Components},
    url = {http://www.cs.chalmers.se/\~{}bringert/publ/lic/lic.pdf},
    year = {2007}
}



@inproceedings{bringert04:haskelldb,
    address = {New York, NY, USA},
    author = {Bringert, Bj\"{o}rn and H\"{o}ckersten, Anders and Andersson, Conny and Andersson, Martin and Bergman, Mary and Blomqvist, Victor and Martin, Torbj\"{o}rn},
    booktitle = {Haskell '04: Proceedings of the 2004 ACM SIGPLAN workshop on Haskell},
    citeulike-article-id = {1781500},
    citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1017473},
    citeulike-linkout-1 = {http://dx.doi.org/10.1145/1017472.1017473},
    doi = {10.1145/1017472.1017473},
    isbn = {1581138504},
    keywords = {haskell},
    month = {September},
    pages = {108--115},
    posted-at = {2007-10-17 22:40:07},
    priority = {0},
    publisher = {ACM Press},
    title = {Student paper: HaskellDB improved},
    url = {http://dx.doi.org/10.1145/1017472.1017473},
    year = {2004}
}



@inproceedings{bringert06:composop,
    address = {New York, NY, USA},
    author = {Bringert, Bj\"{o}rn and Ranta, Aarne},
    booktitle = {ICFP '06: Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming},
    citeulike-article-id = {1781499},
    citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1159803.1159834},
    citeulike-linkout-1 = {http://dx.doi.org/10.1145/1159803.1159834},
    doi = {10.1145/1159803.1159834},
    issn = {0362-1340},
    keywords = {haskell},
    month = {September},
    pages = {216--226},
    posted-at = {2007-10-17 22:38:21},
    priority = {0},
    publisher = {ACM Press},
    title = {A pattern for almost compositional functions},
    url = {http://dx.doi.org/10.1145/1159803.1159834},
    year = {2006}
}



@incollection{citeulike:1632206,
    abstract = {We describe an extension of Martin-Lf's type theory with dependent record types and subtyping and use it for obtaining a formal definition of a general structure of the algorithms of sorting by insertion. We start by giving a general formulation of the sorting problem according to which the most general sorting algorithms are those that can be used for ordering lists over any set, along any total relation on the set. In particular, the best known members of the family of algorithms of sorting by insertion, namely straight insertion sort and tree sort, are of this kind. The proposed structure of the algorithms of sorting by insertion is based upon a specification of an abstract data type, which we call of insertion structures. The general method of sorting by insertion is then written as a program depending on unspecified implementation of insertion structures. We therefore call it abstract insertion sort. The concrete algorithms of sorting by insertion correspond to particular implementations of insertion structures. We discuss how it is possible to peecify the operations on insertion structures so as to accurately describe the intended family of algorithms. We also derive axioms for the insertion structures so as to obtain a natural decomposition into lemmas of the proofs of correctness of the algorithms of the family. The whole work serves to illustrate how abstract data types and their implementations can be formally treated in the considered extension of type theory. All the definitions are presented here in ordinary mathematical language using the concepts and some of the notation of the formal theory. They have also been totally formalized and verified using a type checker for the extended theory that has been implemented.},
    author = {Tasistro, Alvaro},
    citeulike-article-id = {1632206},
    citeulike-linkout-0 = {http://dx.doi.org/10.1007/BFb0097801},
    doi = {10.1007/BFb0097801},
    journal = {Types for Proofs and Programs},
    keywords = {type-theory},
    pages = {354--372},
    posted-at = {2007-09-07 17:43:04},
    priority = {2},
    title = {Abstract insertion sort in an extension of type theory with record types and subtyping},
    url = {http://dx.doi.org/10.1007/BFb0097801},
    year = {1998}
}



@inproceedings{bringert07:voicexml,
    author = {Bringert, Bj\"{o}rn},
    booktitle = {Proceedings of the 8th SIGdial Workshop on Discourse and Dialogue, Antwerp, Belgium},
    citeulike-article-id = {1613592},
    citeulike-linkout-0 = {http://www.sigdial.org/workshops/workshop8/Proceedings/SIGdial39.pdf},
    citeulike-linkout-1 = {http://www.cs.chalmers.se/\~{}bringert/publ/gf-voicexml/gf-voicexml.pdf},
    editor = {Keizer, Simon and Bunt, Harry and Paek, Tim},
    keywords = {gf},
    month = {September},
    pages = {223--226},
    posted-at = {2007-09-02 13:55:03},
    priority = {0},
    publisher = {Association for Computational Linguistics},
    title = {Rapid Development of Dialogue Systems by Grammar Compilation},
    url = {http://www.sigdial.org/workshops/workshop8/Proceedings/SIGdial39.pdf},
    year = {2007}
}



@inproceedings{kron-EtAl:2007:SPEECHGRAM,
    address = {Prague, Czech Republic},
    author = {Kron, Elisabeth and Rayner, Manny and Santaholma, Marianne and Bouillon, Pierrette},
    booktitle = {Proceedings of the Workshop on Grammar-Based Approaches to Spoken Language Processing},
    citeulike-article-id = {1613589},
    citeulike-linkout-0 = {http://www.aclweb.org/anthology/W/W07/W07-1807},
    keywords = {speech},
    month = {June},
    pages = {49--52},
    posted-at = {2007-09-02 13:44:40},
    priority = {0},
    publisher = {Association for Computational Linguistics},
    title = {A Development Environment for Building Grammar-Based Speech-Enabled Applications},
    url = {http://www.aclweb.org/anthology/W/W07/W07-1807},
    year = {2007}
}



@inproceedings{bouillon-EtAl:2007:SPEECHGRAM,
    address = {Prague, Czech Republic},
    author = {Bouillon, Pierrette and Flores, Glenn and Starlander, Marianne and Chatzichrisafis, Nikos and Santaholma, Marianne and Tsourakis, Nikos and Rayner, Manny and Hockey, Beth A.},
    booktitle = {Proceedings of the Workshop on Grammar-Based Approaches to Spoken Language Processing},
    citeulike-article-id = {1613588},
    citeulike-linkout-0 = {http://www.aclweb.org/anthology/W/W07/W07-1806},
    keywords = {speech},
    month = {June},
    pages = {41--48},
    posted-at = {2007-09-02 13:44:40},
    priority = {0},
    publisher = {Association for Computational Linguistics},
    title = {A Bidirectional Grammar-Based Medical Speech Translator},
    url = {http://www.aclweb.org/anthology/W/W07/W07-1806},
    year = {2007}
}



@inproceedings{paek-EtAl:2007:SPEECHGRAM,
    address = {Prague, Czech Republic},
    author = {Paek, Tim and Gandhe, Sudeep and Chickering, Max and Ju, Yun C.},
    booktitle = {Proceedings of the Workshop on Grammar-Based Approaches to Spoken Language Processing},
    citeulike-article-id = {1613587},
    citeulike-linkout-0 = {http://www.aclweb.org/anthology/W/W07/W07-1805},
    keywords = {speech},
    month = {June},
    pages = {33--40},
    posted-at = {2007-09-02 13:44:40},
    priority = {0},
    publisher = {Association for Computational Linguistics},
    title = {Handling Out-of-Grammar Commands in Mobile Speech Interaction Using Backoff Filler Models},
    url = {http://www.aclweb.org/anthology/W/W07/W07-1805},
    year = {2007}
}



@inproceedings{jonson:2007:SPEECHGRAM,
    address = {Prague, Czech Republic},
    author = {Jonson, Rebecca},
    booktitle = {Proceedings of the Workshop on Grammar-Based Approaches to Spoken Language Processing},
    citeulike-article-id = {1613586},
    citeulike-linkout-0 = {http://www.aclweb.org/anthology/W/W07/W07-1804},
    keywords = {gf, slm, speech},
    month = {June},
    pages = {25--32},
    posted-at = {2007-09-02 13:44:40},
    priority = {0},
    publisher = {Association for Computational Linguistics},
    title = {Grammar-based context-specific statistical language modelling},
    url = {http://www.aclweb.org/anthology/W/W07/W07-1804},
    year = {2007}
}



@inproceedings{perera07:localizing,
    author = {Perera, Nadine and Ranta, Aarne},
    booktitle = {Proceedings of the Workshop on Grammar-Based Approaches to Spoken Language Processing, Prague, Czech Republic},
    citeulike-article-id = {1613585},
    citeulike-linkout-0 = {http://www.aclweb.org/anthology/W/W07/W07-1803},
    keywords = {speech},
    pages = {17--24},
    posted-at = {2007-09-02 13:44:40},
    priority = {0},
    publisher = {Association for Computational Linguistics},
    title = {Dialogue System Localization with the GF Resource Grammar Library},
    url = {http://www.aclweb.org/anthology/W/W07/W07-1803},
    year = {2007}
}



@inproceedings{ljunglof07:gf-regulus,
    address = {Prague, Czech Republic},
    author = {Ljungl\"{o}f, Peter},
    booktitle = {Proceedings of the Workshop on Grammar-Based Approaches to Spoken Language Processing},
    citeulike-article-id = {1613584},
    citeulike-linkout-0 = {http://www.aclweb.org/anthology/W/W07/W07-1802},
    keywords = {speech},
    pages = {9--16},
    posted-at = {2007-09-02 13:44:40},
    priority = {0},
    publisher = {Association for Computational Linguistics},
    title = {Converting Grammatical Framework to Regulus},
    url = {http://www.aclweb.org/anthology/W/W07/W07-1802},
    year = {2007}
}



@inproceedings{bringert07:gf-srg,
    author = {Bringert, Bj\"{o}rn},
    booktitle = {Proceedings of the Workshop on Grammar-Based Approaches to Spoken Language Processing, Prague, Czech Republic},
    citeulike-article-id = {1613583},
    citeulike-linkout-0 = {http://www.aclweb.org/anthology/W/W07/W07-1801},
    keywords = {speech},
    month = {June},
    pages = {1--8},
    posted-at = {2007-09-02 13:44:40},
    priority = {0},
    publisher = {Association for Computational Linguistics},
    title = {Speech Recognition Grammar Compilation in Grammatical Framework},
    url = {http://www.aclweb.org/anthology/W/W07/W07-1801},
    year = {2007}
}



@book{SPEECHGRAM:2007,
    address = {Prague, Czech Republic},
    citeulike-article-id = {1613582},
    citeulike-linkout-0 = {http://www.aclweb.org/anthology/W/W07/W07-18},
    editor = {Bouillon, Pierrette and Rayner, Manny},
    keywords = {speech},
    month = {June},
    posted-at = {2007-09-02 13:44:40},
    priority = {0},
    publisher = {Association for Computational Linguistics},
    title = {Proceedings of the Workshop on Grammar-Based Approaches to Spoken Language Processing},
    url = {http://www.aclweb.org/anthology/W/W07/W07-18},
    year = {2007}
}



@misc{nagayama06:agda-tutorial,
    address = {Japan},
    author = {Nagayama, Misao and Nishihara, Hideaki and Takeyama, Makoto},
    citeulike-article-id = {1596115},
    citeulike-linkout-0 = {http://unit.aist.go.jp/cvs/Agda/main.pdf},
    citeulike-linkout-1 = {http://unit.aist.go.jp/cvs/Agda/tutorial/},
    day = {12},
    institution = {Research Center for Verification and Semantics (CVS), National Institute of Advanced Industrial Science and Technology (AIST)},
    keywords = {agda, type-theory},
    month = {May},
    posted-at = {2007-08-27 12:41:51},
    priority = {2},
    title = {An Agda Tutorial},
    url = {http://unit.aist.go.jp/cvs/Agda/main.pdf},
    year = {2006}
}



@article{wadler90:deforestation,
    abstract = {An algorithm that transforms programs to eliminate intermediate trees is presented. The algorithm applies to any term containing only functions with definitions in a given syntactic form, and is suitable for incorporation in an optimizing compiler.},
    author = {Wadler, Philip},
    citeulike-article-id = {1595817},
    citeulike-linkout-0 = {http://homepages.inf.ed.ac.uk/wadler/topics/deforestation.html},
    citeulike-linkout-1 = {http://dx.doi.org/10.1016/0304-3975(90)90147-A},
    citeulike-linkout-2 = {http://www.sciencedirect.com/science/article/B6V1G-45W3WV5-3K/2/2659383ba14773eb043709b0c6a981fe},
    doi = {10.1016/0304-3975(90)90147-A},
    journal = {Theoretical Computer Science},
    month = {June},
    number = {2},
    pages = {231--248},
    posted-at = {2007-08-27 09:41:44},
    priority = {2},
    title = {Deforestation: transforming programs to eliminate trees},
    url = {http://homepages.inf.ed.ac.uk/wadler/topics/deforestation.html},
    volume = {73},
    year = {1990}
}



@incollection{citeulike:1583071,
    abstract = {Generic programming allows you to write a function once, and use it many times at different types. Traditionally, generic functions are defined by induction on the structure of types.  ” Scrap your boilerplate” (SYB) is a radically different approach that dispatches on the structure of values. In previous work, we have shown how to reconcile both approaches using the concept of generic views: many generic functions can be based either on the classical sum-of-products view or on the view that underlies SYB, the so-called 'spine' view. One distinct advantage of the spine view is its generality: it is applicable to a large class of data types, including generalised algebraic data types. Its main weakness roots in the value-orientation: one can only define generic functions that consume data () but not ones that produce data (). Furthermore, functions that abstract over type constructors (, ) are out of reach. In this paper, we show how to overcome both limitations. The main technical contributions are the 'type spine' view and the 'lifted spine' view.},
    author = {Hinze, Ralf and L\"{o}h, Andres},
    citeulike-article-id = {1583071},
    citeulike-linkout-0 = {http://www.informatik.uni-bonn.de/\~{}ralf/publications/SYB1.pdf},
    citeulike-linkout-1 = {http://dx.doi.org/10.1007/11783596\_13},
    citeulike-linkout-2 = {http://www.springerlink.com/content/104125km787t4641},
    doi = {10.1007/11783596\_13},
    journal = {Mathematics of Program Construction},
    keywords = {generics, haskell},
    pages = {180--208},
    posted-at = {2007-08-22 15:08:52},
    priority = {2},
    series = {Lecture Notes in Computer Science},
    title = {"Scrap Your Boilerplate" Revolutions},
    url = {http://www.informatik.uni-bonn.de/\~{}ralf/publications/SYB1.pdf},
    volume = {4014},
    year = {2006}
}



@proceedings{ssdgp,
    abstract = {A leitmotif in the evolution of programming paradigms has been the level and extent of parametrisation that is facilitated\~{}--- the so-called \emph{genericity} of the paradigm. The sorts of parameters that can be envisaged in a programming language range from simple values, like integers and floating-point numbers,through structured values, types and classes, to kinds (the type of types and/or classes). \emph{Datatype-generic programming} is about parametrising programs by the structure of the data that they manipulate, exploiting that structure when it is relevant and ignoring it when it is not. Programming languages most commonly used at the present time do not provide effective mechanisms for documenting and implementing datatype genericity. This volume is a contribution towards improving the state of the art.},
    booktitle = {Spring School on Datatype-Generic Programming},
    citeulike-article-id = {1569739},
    citeulike-linkout-0 = {http://www.comlab.ox.ac.uk/jeremy.gibbons/publications/ssdgp-preface.pdf},
    editor = {Backhouse, Roland and Gibbons, Jeremy and Hinze, Ralf and Jeuring, Johan},
    keywords = {generics},
    posted-at = {2007-08-16 17:59:11},
    priority = {0},
    publisher = {Springer-Verlag},
    series = {Lecture Notes in Computer Science},
    title = {Spring School on Datatype-Generic Programming},
    url = {http://www.comlab.ox.ac.uk/jeremy.gibbons/publications/ssdgp-preface.pdf},
    volume = {4719},
    year = {2007}
}



@inproceedings{gibbons07:dgp,
    abstract = {<em>Generic programming</em> aims to increase the flexibility of programming languages, by expanding the possibilities for parametrization\~{}--- ideally, without also expanding the possibilities for uncaught errors. The term means different things to different people: <em>parametric polymorphism</em>, <em>data abstraction</em>, <em>meta-programming</em>, and so on. We use it to mean polytypism, that is, parametrization by the <em>shape</em> of data structures rather than their contents. To avoid confusion with other uses, we have coined the qualified term <em>datatype-generic programming</em> for this purpose. In these lecture notes, we expand on the definition of datatype-generic programming, and present some examples of datatype-generic programs. We also explore the connection with <em>design patterns</em> in object-oriented programming; in particular, we argue that certain design patterns are just higher-order datatype-generic programs.},
    address = {Heidelberg},
    author = {Gibbons, Jeremy},
    booktitle = {Spring School on Datatype-Generic Programming},
    citeulike-article-id = {1569738},
    citeulike-linkout-0 = {http://dx.doi.org/10.1007/978-3-540-76786-2\_1},
    citeulike-linkout-1 = {http://www.comlab.ox.ac.uk/jeremy.gibbons/publications/dgp.pdf},
    doi = {10.1007/978-3-540-76786-2\_1},
    editor = {Backhouse, Roland and Gibbons, Jeremy and Hinze, Ralf and Jeuring, Johan},
    keywords = {generics},
    month = {November},
    pages = {1--71},
    posted-at = {2007-08-16 17:59:11},
    priority = {0},
    publisher = {Springer},
    series = {Lecture Notes in Computer Science},
    title = {Datatype-Generic Programming},
    url = {http://www.comlab.ox.ac.uk/jeremy.gibbons/publications/dgp.pdf},
    volume = {4719},
    year = {2007}
}



@inproceedings{meijer91:bananas,
    address = {Heidelberg},
    author = {Meijer, Erik and Fokkinga, Maarten and Paterson, Ross},
    booktitle = {Proceedings of the 5th ACM conference on Functional programming languages and computer architecture},
    citeulike-article-id = {141857},
    citeulike-linkout-0 = {http://dx.doi.org/10.1007/3540543961\_7},
    citeulike-linkout-1 = {http://portal.acm.org/citation.cfm?id=128035},
    doi = {10.1007/3540543961\_7},
    isbn = {0387543961},
    pages = {124--144},
    posted-at = {2007-07-05 09:48:19},
    priority = {2},
    publisher = {Springer},
    series = {Lecture Notes in Computer Science},
    title = {Functional programming with bananas, lenses, envelopes and barbed wire},
    url = {http://dx.doi.org/10.1007/3540543961\_7},
    volume = {523},
    year = {1991}
}



@inproceedings{uustalu00:mendler,
    author = {Uustalu, Tarmo and Vene, Varmo},
    booktitle = {Proceedings of the 2nd Workshop on Generic Programming},
    citeulike-article-id = {1435285},
    citeulike-linkout-0 = {http://cs.ioc.ee/\~{}tarmo/papers/wgp00.ps.gz},
    day = {6},
    editor = {Jeuring, Johan},
    howpublished = {Tech Report UU-CS-2000-19},
    institution = {Department of Computer Science, Utrecht University},
    keywords = {generics},
    month = {July},
    pages = {69--85},
    posted-at = {2007-07-05 08:40:14},
    priority = {2},
    title = {Coding recursion a la Mendler},
    url = {http://cs.ioc.ee/\~{}tarmo/papers/wgp00.ps.gz},
    year = {2000}
}



@inproceedings{hinze06:generics-now,
    author = {Hinze, Ralf and L\"{o}h, Andres},
    booktitle = {Spring School on Generic Programming},
    citeulike-article-id = {1397557},
    citeulike-linkout-0 = {http://www.informatik.uni-bonn.de/\~{}ralf/publications/NOW.pdf},
    editor = {Backhouse, Roland and Gibbons, Jeremy and Hinze, Ralf and Jeuring, Johan},
    keywords = {gadt, generics, haskell},
    month = {April},
    posted-at = {2007-06-18 21:24:04},
    priority = {3},
    title = {Generic Programming, Now!},
    url = {http://www.informatik.uni-bonn.de/\~{}ralf/publications/NOW.pdf},
    year = {2006}
}



@article{sheard04:two-level-types,
    abstract = {In this paper, we describe two techniques for the efficient, modularized implementation of a large class of algorithms. We illustrate these techniques using several examples, including efficient generic unification algorithms that use reference cells to encode substitutions, and highly modular language implementations. We chose these examples to illustrate the following important techniques that we believe many functional programmers would find useful. First, defining recursive data types by splitting them into two levels: a structure defining level, and a recursive knot-tying level. Second, the use of rank-2 polymorphism inside Haskell\&apos;s record types to implement a kind of type-parameterized modules. Finally, we explore techniques that allow us to combine already existing recursive Haskell data-types with the highly modular style of programming proposed here.},
    address = {New York, NY, USA},
    author = {Sheard, Tim and Pasalic, Emir},
    citeulike-article-id = {1397548},
    citeulike-linkout-0 = {http://web.cecs.pdx.edu/\~{}sheard/papers/JfpPearl.ps},
    citeulike-linkout-1 = {http://portal.acm.org/citation.cfm?id=1014370.1014379},
    citeulike-linkout-2 = {http://journals.cambridge.org/action/displayAbstract?fromPage=online\&aid=241775},
    citeulike-linkout-3 = {http://dx.doi.org/10.1017/S095679680300488X},
    doi = {10.1017/S095679680300488X},
    issn = {0956-7968},
    journal = {Journal of Functional Programmming},
    keywords = {generics, haskell},
    month = {September},
    number = {05},
    pages = {547--587},
    posted-at = {2007-06-18 21:15:14},
    priority = {3},
    publisher = {Cambridge University Press},
    title = {Two-level types and parameterized modules},
    url = {http://web.cecs.pdx.edu/\~{}sheard/papers/JfpPearl.ps},
    volume = {14},
    year = {2004}
}



@article{marlow02:hws,
    author = {Marlow, Simon},
    citeulike-article-id = {1374799},
    journal = {Journal of Functional Programming},
    keywords = {haskell, web},
    month = {July},
    number = {4+5},
    pages = {359--374},
    posted-at = {2007-06-10 00:15:01},
    priority = {0},
    title = {Developing a high-performance web server in Concurrent Haskell},
    volume = {12},
    year = {2002}
}



@book{appel97:mci-ml,
    abstract = {This new, expanded textbook describes all phases of a modern compiler: lexical analysis, parsing, abstract syntax, semantic actions, intermediate representations, instruction selection via tree matching, dataflow analysis, graph-coloring register allocation, and runtime systems. It includes good coverage of current techniques in code generation and register allocation, as well as functional and object-oriented languages, that are missing from most books. In addition, more advanced chapters are now included so that it can be used as the basis for two-semester or graduate course. The most accepted and successful techniques are described in a concise way, rather than as an exhaustive catalog of every possible variant. Detailed descriptions of the interfaces between modules of a compiler are illustrated with actual C header files. The first part of the book, Fundamentals of Compilation, is suitable for a one-semester first course in compiler design. The second part, Advanced Topics, which includes the advanced chapters, covers the compilation of object-oriented and functional languages, garbage collection, loop optimizations, SSA form, loop scheduling, and optimization for cache-memory hierarchies.},
    author = {Appel, Andrew W.},
    citeulike-article-id = {1340607},
    citeulike-linkout-0 = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20\&amp;path=ASIN/0521582741},
    citeulike-linkout-1 = {http://www.amazon.de/exec/obidos/redirect?tag=citeulike01-21\&amp;path=ASIN/0521582741},
    citeulike-linkout-2 = {http://www.amazon.fr/exec/obidos/redirect?tag=citeulike06-21\&amp;path=ASIN/0521582741},
    citeulike-linkout-3 = {http://www.amazon.co.uk/exec/obidos/ASIN/0521582741/citeulike00-21},
    citeulike-linkout-4 = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/0521582741},
    citeulike-linkout-5 = {http://www.worldcat.org/isbn/0521582741},
    citeulike-linkout-6 = {http://books.google.com/books?vid=ISBN0521582741},
    citeulike-linkout-7 = {http://www.amazon.com/gp/search?keywords=0521582741\&index=books\&linkCode=qs},
    citeulike-linkout-8 = {http://www.librarything.com/isbn/0521582741},
    day = {13},
    howpublished = {Hardcover},
    isbn = {0521582741},
    keywords = {compilers, ml},
    month = {December},
    posted-at = {2007-05-29 11:01:13},
    priority = {2},
    publisher = {Cambridge University Press},
    title = {Modern Compiler Implementation in ML},
    url = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/0521582741},
    year = {1997}
}



@book{appel02:mci-java,
    abstract = {This textbook describes all phases of a compiler: lexical analysis, parsing, abstract syntax, semantic actions, intermediate representations, instruction selection via tree matching, dataflow analysis, graph-coloring register allocation, and runtime systems. It includes thorough coverage of current techniques in code generation and register allocation, and the compilation of functional and object-oriented languages. The most accepted and successful techniques are described and illustrated with actual Java^TM® classes. The first part is suitable for a one-semester first course in compiler design. The second part; which includes the compilation of object-oriented and functional languages, garbage collection, loop optimization, SSA form, instruction scheduling, and optimization for cache-memory hierarchies; can be used for a second-semester or graduate course. This new edition includes more discussion of Java and object-oriented programming concepts such as visitor patterns plus a new Mini-Java programming project. A unique feature is the newly redesigned compiler project in Java for a subset of Java itself. The project includes both front-end and back-end phases.},
    author = {Appel, Andrew W.},
    citeulike-article-id = {322547},
    citeulike-linkout-0 = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20\&amp;path=ASIN/052182060X},
    citeulike-linkout-1 = {http://www.amazon.de/exec/obidos/redirect?tag=citeulike01-21\&amp;path=ASIN/052182060X},
    citeulike-linkout-2 = {http://www.amazon.fr/exec/obidos/redirect?tag=citeulike06-21\&amp;path=ASIN/052182060X},
    citeulike-linkout-3 = {http://www.amazon.co.uk/exec/obidos/ASIN/052182060X/citeulike00-21},
    citeulike-linkout-4 = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/052182060X},
    citeulike-linkout-5 = {http://www.worldcat.org/isbn/052182060X},
    citeulike-linkout-6 = {http://books.google.com/books?vid=ISBN052182060X},
    citeulike-linkout-7 = {http://www.amazon.com/gp/search?keywords=052182060X\&index=books\&linkCode=qs},
    citeulike-linkout-8 = {http://www.librarything.com/isbn/052182060X},
    day = {21},
    edition = {Second},
    howpublished = {Hardcover},
    isbn = {052182060X},
    keywords = {compilers, java},
    month = {October},
    posted-at = {2007-05-29 10:51:33},
    priority = {0},
    publisher = {Cambridge University Press},
    title = {Modern Compiler Implementation in Java},
    url = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/052182060X},
    year = {2002}
}



@article{ranta07:modular_grammar_engineering,
    abstract = {The Grammatical Framework GF is a grammar formalism designed for multilingual grammars. A multilingual grammar has a shared representation, called abstract syntax, and a set of concrete syntaxes that map the abstract syntax to different languages. A GF grammar consists of modules, which can share code through inheritance, but which can also hide information to achieve division of labour between grammarians working on different modules. The goal is to make it possible for linguistically untrained programmers to write linguistically correct application grammars encoding the semantics of special domains. Such programmers can rely on resource grammars, written by linguists, which play the r\^{o}le of standard libraries. Application grammarians use resource grammars through abstract interfaces, and the type system of GF guarantees that grammaticality is preserved. The ongoing GF resource grammar project provides resource grammars for ten languages. In addition to their use as libraries, resource grammars serve as an experiment showing how much grammar code can be shared between different languages.},
    address = {The Netherlands},
    author = {Ranta, Aarne},
    citeulike-article-id = {1337142},
    citeulike-linkout-0 = {http://dx.doi.org/10.1007/s11168-007-9030-6},
    citeulike-linkout-1 = {http://www.cs.chalmers.se/\~{}aarne/articles/multieng3.pdf},
    doi = {10.1007/s11168-007-9030-6},
    journal = {Research on Language and Computation},
    keywords = {gf, multilingual},
    month = {June},
    number = {2},
    pages = {133--158},
    posted-at = {2007-05-27 12:36:20},
    priority = {0},
    publisher = {Springer},
    title = {Modular Grammar Engineering in GF},
    url = {http://www.cs.chalmers.se/\~{}aarne/articles/multieng3.pdf},
    volume = {5},
    year = {2007}
}



@inproceedings{visser01:visitor,
    address = {New York, NY, USA},
    author = {Visser, Joost},
    booktitle = {OOPSLA '01: Proceedings of the 16th ACM SIGPLAN conference on Object oriented programming, systems, languages, and applications},
    citeulike-article-id = {524244},
    citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=504302},
    citeulike-linkout-1 = {http://dx.doi.org/10.1145/504282.504302},
    doi = {10.1145/504282.504302},
    isbn = {1581133359},
    keywords = {java},
    month = {November},
    number = {11},
    pages = {270--282},
    posted-at = {2007-04-19 13:49:28},
    priority = {2},
    publisher = {ACM Press},
    title = {Visitor combination and traversal control},
    url = {http://dx.doi.org/10.1145/504282.504302},
    volume = {36},
    year = {2001}
}



@unpublished{augustsson94:silly-type-families,
    author = {Augustsson, Lennart and Petersson, Kent},
    citeulike-article-id = {1236900},
    citeulike-linkout-0 = {http://www.cs.pdx.edu/\~{}sheard/papers/silly.pdf},
    institution = {Chalmers University of Technology},
    keywords = {gadt, haskell},
    posted-at = {2007-04-19 13:48:08},
    priority = {2},
    title = {Silly type families},
    url = {http://www.cs.pdx.edu/\~{}sheard/papers/silly.pdf},
    year = {1994}
}



@techreport{pellauer04:bnfc-tr,
    author = {Pellauer, Michael and Forsberg, Markus and Ranta, Aarne},
    citeulike-article-id = {1236898},
    institution = {Department of Computing Science, Chalmers University of Technology and G\"{o}teborg University},
    keywords = {bnfc, compilers},
    number = {09},
    posted-at = {2007-04-19 13:46:37},
    priority = {2},
    title = {BNF Converter: Multilingual Front-End Generation from Labelled BNF},
    volume = {2004},
    year = {2004}
}



@inproceedings{forsberg03:bnfc,
    author = {Forsberg, Markus and Ranta, Aarne},
    booktitle = {NWPT'02 proceedings, Proceedings of the Estonian Academy of Sciences},
    citeulike-article-id = {1236893},
    citeulike-linkout-0 = {http://www.cs.chalmers.se/\~{}markus/BNFC/BNF\_Report.ps.gz},
    keywords = {bnfc, compilers},
    month = {December},
    posted-at = {2007-04-19 13:43:56},
    priority = {2},
    title = {The BNF Converter: A High-Level Tool for Implementing Well-Behaved Programming Languages},
    url = {http://www.cs.chalmers.se/\~{}markus/BNFC/BNF\_Report.ps.gz},
    year = {2003}
}



@inproceedings{jansson97:polyp,
    address = {New York, NY, USA},
    author = {Jansson, Patrik and Jeuring, Johan},
    booktitle = {Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (POPL)},
    citeulike-article-id = {1236888},
    citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=263763},
    citeulike-linkout-1 = {http://dx.doi.org/10.1145/263699.263763},
    doi = {10.1145/263699.263763},
    isbn = {0897918533},
    keywords = {generics, haskell},
    pages = {470--482},
    posted-at = {2007-04-19 13:41:30},
    priority = {2},
    publisher = {ACM Press},
    title = {PolyP - a polytypic programming language extension},
    url = {http://dx.doi.org/10.1145/263699.263763},
    year = {1997}
}



@article{sarkar05:nanopass-jfp,
    address = {New York, NY, USA},
    author = {Sarkar, Dipanwita and Waddell, Oscar and Dybvig, Kent R.},
    citeulike-article-id = {1236876},
    citeulike-linkout-0 = {http://www.cs.indiana.edu/\~{}dyb/pubs/nano-jfp.pdf},
    citeulike-linkout-1 = {http://dx.doi.org/10.1017/S0956796805005605},
    doi = {10.1017/S0956796805005605},
    journal = {Journal of Functional Programming},
    keywords = {compilers, scheme},
    number = {5},
    pages = {653--667},
    posted-at = {2007-04-19 13:32:27},
    priority = {0},
    publisher = {Cambridge University Press},
    title = {EDUCATIONAL PEARL: A Nanopass framework for compiler education},
    url = {http://www.cs.indiana.edu/\~{}dyb/pubs/nano-jfp.pdf},
    volume = {15},
    year = {2005}
}



@article{dybjer94:inductive-families,
    abstract = {A general formulation of inductive and recursive definitions in Martin-L\"{o}f's type theory is presented. It extends Backhouse's 'Do-It-Yourself Type Theory' to include inductive definitions of families of sets and definitions of functions by recursion on the way elements of such sets are generated. The formulation is in natural deduction and is intended to be a natural generalisation to type theory of Martin-L\"{o}f's theory of iterated inductive definitions in predicate logic.},
    author = {Dybjer, Peter},
    citeulike-article-id = {1236872},
    citeulike-linkout-0 = {http://dx.doi.org/10.1007/BF01211308},
    citeulike-linkout-1 = {http://www.springerlink.com/content/j17824h467x6j288},
    day = {1},
    doi = {10.1007/BF01211308},
    journal = {Formal Aspects of Computing},
    keywords = {type-theory},
    month = {July},
    number = {4},
    pages = {440--465},
    posted-at = {2007-04-19 13:30:25},
    priority = {2},
    title = {Inductive families},
    url = {http://dx.doi.org/10.1007/BF01211308},
    volume = {6},
    year = {1994}
}



@book{gamma95:design-patterns,
    address = {Boston, MA, USA},
    author = {Gamma, Erich and Helm, Richard and Johnson, Ralph and Vlissides, John},
    citeulike-article-id = {257271},
    citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=186897},
    isbn = {0-201-63361-2},
    posted-at = {2007-04-19 13:19:49},
    priority = {2},
    publisher = {Addison-Wesley Longman Publishing Co., Inc.},
    title = {Design patterns: elements of reusable object-oriented software},
    url = {http://portal.acm.org/citation.cfm?id=186897},
    year = {1995}
}



@inproceedings{sheard02:template-haskell,
    abstract = {We propose a new extension to the purely functional programming language Haskell that supports  compile-time meta-programming.  The purpose of the system is to support the  algorithmic  construction of programs at compile-time.The ability to generate code at compile time allows the programmer to implement such features as polytypic programs, macro-like expansion, user directed optimization (such as inlining), and the generation of supporting data structures and functions from existing data structures and functions.Our design is being implemented in the Glasgow Haskell Compiler, ghc.},
    address = {New York, NY, USA},
    author = {Sheard, Tim and Peyton-Jones, Simon},
    booktitle = {Haskell '02: Proceedings of the 2002 ACM SIGPLAN workshop on Haskell},
    citeulike-article-id = {3211},
    citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=581691},
    citeulike-linkout-1 = {http://dx.doi.org/10.1145/581690.581691},
    doi = {10.1145/581690.581691},
    isbn = {1-58113-605-6},
    keywords = {haskell},
    location = {Pittsburgh, Pennsylvania},
    pages = {1--16},
    posted-at = {2007-04-19 13:15:43},
    priority = {2},
    publisher = {ACM},
    title = {Template meta-programming for Haskell},
    url = {http://dx.doi.org/10.1145/581690.581691},
    year = {2002}
}



@inproceedings{rayner03:regulus,
    address = {Morristown, NJ, USA},
    author = {Rayner, Manny and Hockey, Beth A. and Dowding, John},
    booktitle = {EACL '03: Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics},
    citeulike-article-id = {1236826},
    citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1067790},
    isbn = {1111567890},
    keywords = {grammars, regulus},
    pages = {223--226},
    posted-at = {2007-04-19 12:57:52},
    priority = {2},
    publisher = {Association for Computational Linguistics},
    title = {An open source environment for compiling typed unification grammars into speech recognisers},
    url = {http://portal.acm.org/citation.cfm?id=1067790},
    year = {2003}
}



@inproceedings{johnston98:multimodal-parsing,
    address = {Morristown, NJ, USA},
    author = {Johnston, Michael},
    booktitle = {Proceedings of the 36th annual meeting on Association for Computational Linguistics},
    citeulike-article-id = {1236817},
    citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=980949},
    keywords = {multimodal},
    pages = {624--630},
    posted-at = {2007-04-19 12:55:13},
    priority = {2},
    publisher = {Association for Computational Linguistics},
    title = {Unification-based multimodal parsing},
    url = {http://portal.acm.org/citation.cfm?id=980949},
    year = {1998}
}



@book{milner97:ml-definition,
    abstract = {Standard ML is a general-purpose programming language designed for large projects. This book provides a formal definition of Standard ML for the benefit of all concerned with the language, including users and implementers. Because computer programs are increasingly required to withstand rigorous analysis, it is all the more important that the language in which they are written be defined with full rigor.

One purpose of a language definition is to establish a theory of meanings upon which the understanding of particular programs may rest. To properly define a programming language, it is necessary to use some form of notation other than a programming language. Given a concern for rigor, mathematical notation is an obvious choice. The authors have defined their semantic objects in mathematical notation that is completely independent of Standard ML.

In defining a language one must also define the rules of evaluation precisely--that is, define what meaning results from evaluating any phrase of the language. The definition thus constitutes a formal specification for an implementation. The authors have developed enough of their theory to give sense to their rules of evaluation.

The Definition of Standard ML is the essential point of reference for Standard ML. Since its publication in 1990, the implementation technology of the language has advanced enormously and the number of users has grown. The revised edition includes a number of new features, omits little-used features, and corrects mistakes of definition.},
    author = {Milner, Robin and Tofte, Mads and Harper, Robert and Macqueen, David},
    citeulike-article-id = {113339},
    citeulike-linkout-0 = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20\&amp;path=ASIN/0262631814},
    citeulike-linkout-1 = {http://www.amazon.de/exec/obidos/redirect?tag=citeulike01-21\&amp;path=ASIN/0262631814},
    citeulike-linkout-2 = {http://www.amazon.fr/exec/obidos/redirect?tag=citeulike06-21\&amp;path=ASIN/0262631814},
    citeulike-linkout-3 = {http://www.amazon.jp/exec/obidos/ASIN/0262631814},
    citeulike-linkout-4 = {http://www.amazon.co.uk/exec/obidos/ASIN/0262631814/citeulike00-21},
    citeulike-linkout-5 = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/0262631814},
    citeulike-linkout-6 = {http://www.worldcat.org/isbn/0262631814},
    citeulike-linkout-7 = {http://books.google.com/books?vid=ISBN0262631814},
    citeulike-linkout-8 = {http://www.amazon.com/gp/search?keywords=0262631814\&index=books\&linkCode=qs},
    citeulike-linkout-9 = {http://www.librarything.com/isbn/0262631814},
    day = {15},
    howpublished = {Paperback},
    isbn = {0262631814},
    keywords = {ml, programming},
    month = {May},
    posted-at = {2007-04-19 12:49:22},
    priority = {2},
    publisher = {The MIT Press},
    title = {The Definition of Standard ML - Revised},
    url = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/0262631814},
    year = {1997}
}



@inbook{magnusson94:alf,
    author = {Magnusson, Lena and Nordstr\"{o}m, Bengt},
    booktitle = {Types for Proofs and Programs},
    citeulike-article-id = {1236801},
    citeulike-linkout-0 = {http://dx.doi.org/10.1007/3-540-58085-9\_78},
    doi = {10.1007/3-540-58085-9\_78},
    journal = {Types for Proofs and Programs},
    keywords = {type-theory},
    pages = {213--237},
    posted-at = {2007-04-19 12:44:18},
    priority = {2},
    publisher = {Springer},
    series = {Lecture Notes in Computer Science},
    title = {The Alf proof editor and its proof engine},
    url = {http://dx.doi.org/10.1007/3-540-58085-9\_78},
    volume = {806},
    year = {1994}
}



@article{harper93:lf,
    author = {Harper, Robert and Honsell, Furio and Plotkin, Gordon},
    citeulike-article-id = {99878},
    citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=138060},
    citeulike-linkout-1 = {http://dx.doi.org/10.1145/138027.138060},
    doi = {10.1145/138027.138060},
    issn = {0004-5411},
    journal = {J. ACM},
    keywords = {type-theory},
    month = {January},
    number = {1},
    pages = {143--184},
    posted-at = {2007-04-19 12:42:30},
    priority = {2},
    publisher = {ACM Press},
    title = {A framework for defining logics},
    url = {http://dx.doi.org/10.1145/138027.138060},
    volume = {40},
    year = {1993}
}



@mastersthesis{bringert05:embedded-grammars,
    address = {G\"oteborg, Sweden},
    author = {Bringert, Bj\"orn},
    citeulike-article-id = {1236783},
    citeulike-linkout-0 = {http://www.cs.chalmers.se/\~{}bringert/publ/exjobb/embedded-grammars.pdf},
    keywords = {gf, grammars},
    month = {February},
    posted-at = {2007-04-19 12:36:15},
    priority = {2},
    school = {Chalmers University of Technology},
    title = {Embedded Grammars},
    url = {http://www.cs.chalmers.se/\~{}bringert/publ/exjobb/embedded-grammars.pdf},
    year = {2005}
}



@proceedings{citeulike:1234225,
    abstract = {Following up with the speech technology development, spoken dialogue systems are getting commercialized. Many public service companies, such as call centres, tourist information centres, travel agencies, etc., are applying spoken dialogue systems for customer communication. However, there are many usability problems with these spoken dialogue systems. A study of the usability and user's experience of a consumer Swedish spoken dialog system is reported here. Six users went through three different scenarios in a home environment during the tests. The analysis of the participant's conversation with the dialogue system, observations, interviews and questionnaire were used as the testing methods. The result shows that the system is working, since all the users concluded their tasks. However, there are a few usability problems were found. These problems are: the understanding between the user and the system, the system's flexibility, naturalness, and correctness, error handling and the user's control of the system, as well as the information overloading to user's memory. Concerning the user's experience, the study showed that the variables as elegance, emotion, encouragement, intelligence or personality were not present. These variables would affect users' attitude towards the system. Sponsors: Vodafone},
    address = {Interaction Design Group, Department of Computer Science and Engineering, Chalmers University of Technology, Gothenburg, Sweden},
    author = {Chen, F. and Katzenellenbogen, Y.},
    citeulike-article-id = {1234225},
    citeulike-linkout-0 = {http://www.cs.chalmers.se/\~{}fanch/Chen\_Katz\_v2.pdf},
    citeulike-linkout-1 = {http://www.scopus.com/record/display.url?view=extended\&origin=resultslist\&eid=2-s2.0-33745187345},
    journal = {Eur. Conf. Speech Commun. Technol.},
    keywords = {dialogue},
    pages = {2505--2508},
    posted-at = {2007-04-18 15:49:49},
    priority = {2},
    series = {9th European Conference on Speech Communication and Technology},
    title = {User's experience of a commercial speech dialogue system},
    url = {http://www.cs.chalmers.se/\~{}fanch/Chen\_Katz\_v2.pdf}
}



@inproceedings{schultz04:thai-medical,
    address = {Boston, Massachusetts, USA},
    author = {Schultz, Tanja and Alexander, Dorcas and Black, Alan W. and Peterson, Kay and Suebvisai, Sinaporn and Waibel, Alex},
    booktitle = {HLT-NAACL 2004: Demonstration Papers},
    citeulike-article-id = {1234134},
    editor = {Daniel and Roukos, Salim},
    keywords = {translation},
    pages = {34--35},
    posted-at = {2007-04-18 15:12:52},
    priority = {2},
    publisher = {Association for Computational Linguistics},
    title = {A Thai Speech Translation System for Medical Dialogs},
    year = {2004}
}



@inproceedings{waibel04:speech-translation-past-present-future,
    author = {Waibel, Alex},
    booktitle = {INTERSPEECH-2004},
    citeulike-article-id = {1234107},
    keywords = {translation},
    month = {October},
    pages = {353--356},
    posted-at = {2007-04-18 15:00:06},
    priority = {2},
    title = {Speech Translation: Past, Present and Future},
    year = {2004}
}



@techreport{rayner05:clarissa-tr,
    address = {Berkeley, California},
    author = {Rayner, Manny and Hockey, Beth A. and Renders, Jean-Michel and Chatzichrisafis, Nikos and Farrell, Kim},
    citeulike-article-id = {1233535},
    citeulike-linkout-0 = {ftp://ftp.icsi.berkeley.edu/pub/techreports/2005/tr-05-005.pdf},
    howpublished = {Technical report TR-05-005},
    institution = {International Computer Science Institute},
    keywords = {dialogue, regulus},
    month = {April},
    posted-at = {2007-04-18 12:37:23},
    priority = {2},
    title = {Spoken Language Processing in the Clarissa Procedure Browser},
    url = {ftp://ftp.icsi.berkeley.edu/pub/techreports/2005/tr-05-005.pdf},
    year = {2005}
}



@article{araki05:miml,
    abstract = {In this paper, we propose a new multimodal interaction description language, MIML (Multimodal Interaction Markup Language), which defines dialogue patterns between human and various types of interactive agents. The feature of this language is three-layered description of agent-based interactive systems. The high-level description is a task definition that can easily construct typical agent-based interactive task control information. The middle-level description is an interaction description that defines agent's behavior and user's input at the granularity of dialogue segment. The low-level description is a platform dependent description that can override the pre-defined function in the interaction description. The connection between task-level and interaction-level is realized by generation of interaction description templates from the task level description. The connection between interaction-level and platform-level is realized by a binding mechanism of XML. As a result of the comparison with other languages, MIML has advantages in high-level interaction description, modality extensibility and compatibility with standardized technologies. Copyright {\copyright} 2005 The Institute of Electronics, Information and Communication Engineers.},
    address = {ISCA},
    author = {Araki, M. and Kouzawa, A. and Tachibana, K.},
    citeulike-article-id = {1224352},
    citeulike-linkout-0 = {http://dx.doi.org/10.1093/ietisy/e88-d.11.2469},
    citeulike-linkout-1 = {http://www.scopus.com/record/display.url?view=extended\&origin=resultslist\&eid=2-s2.0-29144515755},
    doi = {10.1093/ietisy/e88-d.11.2469},
    journal = {IEICE Trans Inf Syst},
    keywords = {dialogue, multimodal},
    number = {11},
    pages = {2469--2476},
    posted-at = {2007-04-13 17:18:08},
    priority = {2},
    title = {Proposal of a multimodal interaction description language for various interactive agents},
    url = {http://dx.doi.org/10.1093/ietisy/e88-d.11.2469},
    volume = {E88-D},
    year = {2005}
}



@inproceedings{rayner05:comparing-glm-slm,
    abstract = {We present a series of experiments designed to compare grammar-based and robust approaches to speech understanding, performed in the context of an Open Source medical speech translation system. We used two versions of the system, one grammar-based and one robust, trained off the same training data, and evaluated them on test data collected using both versions of the system. The experiments were constructed so as to avoid several methodological problems which occurred in earlier work reported in the literature. We found that the grammarbased version gave significantly better results than the robust version, with the difference increasing as subjects became more familiar with the system's coverage. The rate of improvement in subject performance was positively affected by providing them with an intelligent online help system.},
    author = {Rayner, Manny and Bouillon, Pierrette and Chatzichrisafis, Nikos and Hockey, Beth A. and Santaholma, Marianne and Starlander, Marianne and Isahara, Hitoshi and Kanzaki, Kyoko and Nakao, Yukie},
    booktitle = {Proceedings of Interspeech 2005},
    citeulike-article-id = {701487},
    citeulike-linkout-0 = {http://www.issco.unige.ch/pub/RaynerEAInterspeech2005.pdf},
    keywords = {dialogue, medslt, regulus, slm, srg},
    posted-at = {2007-04-12 18:23:24},
    priority = {2},
    title = {A Methodology for Comparing Grammar-Based and Robust Approaches to Speech Understanding},
    url = {http://www.issco.unige.ch/pub/RaynerEAInterspeech2005.pdf},
    year = {2005}
}



@article{katsurada05:interaction-builder,
    abstract = {We have developed Interaction Builder (IB), a rapid prototyping tool for constructing web-based Multi-Modal Interaction (MMI) applications. The goal of IB is making it easy to develop MMI applications with speech recognition, life-like agents, speech synthesis, web browsing, etc. For this purpose, IB supports the following interface and functions: (1) GUI for implementing MMI systems without the details of MMI and MMI description language, (2) functionalities of handling synchronized multi-modal inputs/outputs, (3) a test run mode for run-time testing. The results of evaluation tests showed that the application development cycle using IB was significantly shortened in comparison with the time using a text editor both for MMI description language experts and for beginners. Copyright {\copyright} 2005 The Institute of Electronics, Information and Communication Engineers.},
    address = {IEEE},
    author = {Katsurada, K. and Adachi, H. and Sato, K. and Yamada, H. and Nitta, T.},
    citeulike-article-id = {1222612},
    citeulike-linkout-0 = {http://dx.doi.org/10.1093/ietisy/e88-d.11.2461},
    citeulike-linkout-1 = {http://www.scopus.com/record/display.url?view=extended\&origin=resultslist\&eid=2-s2.0-29144501253},
    doi = {10.1093/ietisy/e88-d.11.2461},
    journal = {IEICE Trans Inf Syst},
    keywords = {dialogue},
    number = {11},
    pages = {2461--2467},
    posted-at = {2007-04-12 18:17:10},
    priority = {2},
    title = {Interaction builder: A rapid prototyping tool for developing web-based MMI applications},
    url = {http://dx.doi.org/10.1093/ietisy/e88-d.11.2461},
    volume = {E88-D},
    year = {2005}
}



@book{rayner00:slt,
    address = {Cambridge, UK},
    citeulike-article-id = {1222506},
    citeulike-linkout-0 = {http://dx.doi.org/10.2277/0521770777},
    doi = {10.2277/0521770777},
    editor = {Rayner, Manny and Carter, David and Bouillon, Pierrette and Digalakis, Vassilis and Wir\'{e}n, Mats},
    keywords = {translation},
    month = {November},
    posted-at = {2007-04-12 17:29:24},
    priority = {2},
    publisher = {Cambridge University Press},
    series = {Studies in Natural Language Processing},
    title = {The Spoken Language Translator},
    url = {http://dx.doi.org/10.2277/0521770777},
    year = {2000}
}



@inproceedings{bouillon05:medslt,
    author = {Bouillon, P. and Rayner, M. and Chatzichrisafis, N. and Hockey, B. A. and Santaholma, M. and Starlander, M. and Isahara, H. and Kanzaki, K. and Nakao, Y.},
    booktitle = {Proceedings of the tenth Conference on European Association of Machine Translation (EAMT 2005), Budapest, Hungary},
    citeulike-article-id = {1222500},
    citeulike-linkout-0 = {http://www.issco.unige.ch/pub/MedSLT\_demo\_EAMT05\_final.pdf},
    keywords = {medslt, multilingual, regulus, translation},
    month = {May},
    pages = {5--58},
    posted-at = {2007-04-12 17:24:11},
    priority = {2},
    title = {A generic Multi-Lingual Open Source Platform for Limited-Domain Medical Speech Translation},
    url = {http://www.issco.unige.ch/pub/MedSLT\_demo\_EAMT05\_final.pdf},
    year = {2005}
}



@inproceedings{rayner06:medslt-demo,
    address = {New York, New York},
    author = {Rayner, Manny and Bouillon, Pierrette and Chatzichrisafis, Nikos and Santaholma, Marianne and Starlander, Marianne and Hockey, Beth A. and Nakao, Yukie and Isahara, Hitoshi and Kanzaki, Kyoko},
    booktitle = {Proceedings of the First International Workshop on Medical Speech Translation},
    citeulike-article-id = {1222491},
    citeulike-linkout-0 = {http://acl.ldc.upenn.edu/W/W06/W06-3707.pdf},
    keywords = {medslt, regulus, translation},
    pages = {40--43},
    posted-at = {2007-04-12 17:20:03},
    priority = {2},
    publisher = {Association for Computational Linguistics},
    title = {MedSLT: A Limited-Domain Unidirectional Grammar-Based Medical Speech Translator},
    url = {http://acl.ldc.upenn.edu/W/W06/W06-3707.pdf},
    year = {2006}
}



@inproceedings{pieraccini05:where-do-we-go,
    address = {Lisbon, Portugal},
    author = {Pieraccini, Roberto and Huerta, Juan},
    booktitle = {Proceedings of the 6th SIGdial Workshop on Discourse and Dialogue},
    citeulike-article-id = {1222445},
    citeulike-linkout-0 = {http://www.sigdial.org/workshops/workshop6/proceedings/pdf/65-SigDial2005\_8.pdf},
    keywords = {dialogue},
    month = {September},
    posted-at = {2007-04-12 16:43:31},
    priority = {3},
    title = {Where do we go from here? Research and commercial spoken dialog systems.},
    url = {http://www.sigdial.org/workshops/workshop6/proceedings/pdf/65-SigDial2005\_8.pdf},
    year = {2005}
}



@inproceedings{cole99:cslu-toolkit-multilingual,
    address = {Leusden, The Netherlands},
    author = {Cole, Ronald A. and Serridge, Ben and Hosom, John-Paul and Cronk, Andrew and Kaiser, Ed},
    booktitle = {Proceedings of the Workshop on Multi-Lingual Interoperability in Speech Technology (MIST)},
    citeulike-article-id = {1220872},
    citeulike-linkout-0 = {http://www.cslu.ogi.edu/people/hosom/pubs/cole\_MIST-platform\_1999.pdf},
    keywords = {dialogue, multilingual},
    month = {September},
    pages = {43--48},
    posted-at = {2007-04-11 16:00:21},
    priority = {2},
    title = {A Platform for Multilingual Research in Spoken Dialogue Systems},
    url = {http://www.cslu.ogi.edu/people/hosom/pubs/cole\_MIST-platform\_1999.pdf},
    year = {1999}
}



@article{citeulike:1220867,
    address = {Amsterdam, The Netherlands, The Netherlands},
    author = {Glass, James and Flammia, Giovanni and Goodine, David and Phillips, Michael and Polifroni, Joseph and Sakai, Shinsuke and Seneff, Stephanie and Zue, Victor},
    citeulike-article-id = {1220867},
    citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=211312},
    citeulike-linkout-1 = {http://dx.doi.org/10.1016/0167-6393(95)00008-C},
    doi = {10.1016/0167-6393(95)00008-C},
    issn = {0167-6393},
    journal = {Speech Commun.},
    keywords = {dialogue, multilingual},
    number = {1-2},
    pages = {1--18},
    posted-at = {2007-04-11 15:56:10},
    priority = {2},
    publisher = {Elsevier Science Publishers B. V.},
    title = {Multilingual spoken-language understanding in the MIT Voyager system},
    url = {http://dx.doi.org/10.1016/0167-6393(95)00008-C},
    volume = {17},
    year = {1995}
}



@inproceedings{fliedner03:diamant,
    author = {Fliedner, Gerhard and Bobbert, Daniel},
    booktitle = {Proceedings of the 7th Workshop on the Semantics and Pragmatics of Dialogue (DiaBruck), Wallerfangen, Germany},
    citeulike-article-id = {1220862},
    citeulike-linkout-0 = {http://www.coli.uni-saarland.de/conf/diabruck/submission\_finals/abstracts/320/demo\_320.pdf},
    keywords = {dialogue},
    posted-at = {2007-04-11 15:47:10},
    priority = {2},
    title = {DiaMant: A Tool for Rapidly Developing Spoken Dialogue Systems},
    url = {http://www.coli.uni-saarland.de/conf/diabruck/submission\_finals/abstracts/320/demo\_320.pdf},
    year = {2003}
}



@inproceedings{wang05:sgstudio,
    address = {Lisbon, Portugal},
    author = {Wang, Ye-Yi and Acero, Alex},
    booktitle = {Proceedings of the Interspeech Conference},
    citeulike-article-id = {1220856},
    citeulike-linkout-0 = {http://research.microsoft.com/srg/papers/2005-yeyiwang-eurospeech.pdf},
    keywords = {dialogue},
    month = {September},
    posted-at = {2007-04-11 15:43:09},
    priority = {2},
    title = {SGStudio: Rapid Semantic Grammar Development for Spoken Language Understanding},
    url = {http://research.microsoft.com/srg/papers/2005-yeyiwang-eurospeech.pdf},
    year = {2005}
}



@inproceedings{hamerich04:gemini-agp,
    address = {Cambridge, Massachusetts, USA},
    author = {Hamerich, Stefan and Schubert, Volker and Schless, Volker and de C\'{o}rdoba, Ricardo and Pardo, Jos\'{e} M. and D'haro, Luis F. and Kladis, Basilis and Kocsis, Otilia and Igel, Stefan},
    booktitle = {Proceedings of the 5th SIGdial Workshop on Discourse and Dialogue},
    citeulike-article-id = {1220852},
    citeulike-linkout-0 = {http://acl.ldc.upenn.edu/hlt-naacl2004/sigdial04/pdf/hamerich.pdf},
    editor = {Strube, Michael and Sidner, Candy},
    keywords = {dialogue},
    pages = {31--34},
    posted-at = {2007-04-11 15:38:46},
    priority = {3},
    publisher = {Association for Computational Linguistics},
    title = {Semi-Automatic Generation of Dialogue Applications in the GEMINI Project},
    url = {http://acl.ldc.upenn.edu/hlt-naacl2004/sigdial04/pdf/hamerich.pdf},
    year = {2004}
}



@misc{citeulike:1191524,
    abstract = {This report describes a portion of a software system for training phonetic hidden Markov
models (HMMs) for automatic speech recognition (ASR). This software was developed as
part of the 1993 MITRE Sponsored Research (MSR) project Spoken Language Interface
for Command and Control and the 1994 MSR project Spoken Language Interfaces. The
complete system consists of UNIX C-Shell scripts and programs written in Standard C
and the functional language Haskell. This report documents those programs...},
    author = {Goblirsch, D.},
    citeulike-article-id = {1191524},
    citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.2383},
    keywords = {asr},
    posted-at = {2007-03-28 14:55:53},
    priority = {2},
    title = {A software system for training phonetic hidden Markov models},
    url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.2383},
    year = {1994}
}



@manual{gansner06:dotguide,
    author = {Gansner, Emden and Koutsofios, Eleftherios and North, Stephen},
    citeulike-article-id = {1177739},
    citeulike-linkout-0 = {http://www.graphviz.org/Documentation/dotguide.pdf},
    day = {26},
    keywords = {dot, graphics, graphviz, manual},
    month = {January},
    posted-at = {2007-03-20 16:33:56},
    priority = {0},
    title = {Drawing graphs with dot},
    url = {http://www.graphviz.org/Documentation/dotguide.pdf},
    year = {2006}
}



@phdthesis{larsson02:issue-based,
    address = {G\"{o}teborg, Sweden},
    author = {Larsson, Staffan},
    citeulike-article-id = {1177735},
    keywords = {dialogue, godis},
    posted-at = {2007-03-20 16:32:36},
    priority = {2},
    school = {G\"{o}teborg University},
    title = {Issue-based Dialogue Management},
    year = {2002}
}



@manual{young04:atk,
    author = {Young, Steve},
    citeulike-article-id = {1177666},
    citeulike-linkout-0 = {http://mi.eng.cam.ac.uk/\~{}sjy/ATK\_Manual.pdf},
    edition = {1.4.1},
    keywords = {asr},
    organization = {Machine Intelligence Laboratory, Cambridge University Engineering Dept},
    posted-at = {2007-03-20 16:06:53},
    priority = {2},
    title = {ATK - An Application Toolkit for HTK},
    url = {http://mi.eng.cam.ac.uk/\~{}sjy/ATK\_Manual.pdf},
    year = {2004}
}



@incollection{nederhof01:regular-approximation-grammatical,
    author = {Nederhof, Mark J.},
    booktitle = {Advances in Probabilistic and other Parsing Technologies},
    citeulike-article-id = {1177403},
    citeulike-linkout-0 = {http://www.dcs.st-and.ac.uk/\~{}mjn/publications/2000d.pdf},
    editor = {Bunt, Harry and Nijholt, Anton},
    keywords = {fsa, grammars},
    pages = {221--241},
    posted-at = {2007-03-20 13:47:59},
    priority = {2},
    publisher = {Kluwer Academic Publishers},
    series = {Text, Speech and Language Technology},
    title = {Regular Approximation of CFLs: A Grammatical View},
    url = {http://www.dcs.st-and.ac.uk/\~{}mjn/publications/2000d.pdf},
    volume = {16},
    year = {2000}
}



@incollection{mohri01:regular-approximation-transformation,
    address = {Dordrecht},
    author = {Mohri, Mehryar and Nederhof, Mark J.},
    booktitle = {Robustness in Language and Speech Technology},
    citeulike-article-id = {1177402},
    citeulike-linkout-0 = {http://www.coli.uni-sb.de/publikationen/softcopies/Mohri:2001:RAC.pdf},
    editor = {Junqua, Jean C. and van Noord, Gertjan},
    keywords = {fsa, grammars},
    pages = {153--163},
    posted-at = {2007-03-20 13:47:59},
    priority = {2},
    publisher = {Kluwer Academic Publishers},
    series = {Text, Speech and Language Technology},
    title = {Regular Approximation of Context-Free Grammars through Transformation},
    url = {http://www.coli.uni-sb.de/publikationen/softcopies/Mohri:2001:RAC.pdf},
    volume = {17},
    year = {2001}
}



@incollection{brzozowski62:minimal-state-graphs,
    author = {Brzozowski, Janusz A.},
    booktitle = {Mathematical theory of Automata},
    citeulike-article-id = {1177399},
    keywords = {fsa},
    pages = {529--561},
    posted-at = {2007-03-20 13:44:53},
    priority = {2},
    publisher = {Polytechnic Press, Polytechnic Institute of Brooklyn, N.Y.},
    series = {Volume 12 of MRI Symposia Series},
    title = {Canonical regular expressions and minimal state graphs for definite events},
    year = {1962}
}



@inproceedings{hockey03:targeted-help,
    address = {Morristown, NJ, USA},
    author = {Hockey, Beth A. and Lemon, Oliver and Campana, Ellen and Hiatt, Laura and Aist, Gregory and Hieronymus, James and Gruenstein, Alexander and Dowding, John},
    booktitle = {EACL '03: Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics},
    citeulike-article-id = {618236},
    citeulike-linkout-0 = {http://acl.ldc.upenn.edu/E/E03/E03-1075.pdf},
    citeulike-linkout-1 = {http://portal.acm.org/citation.cfm?id=1067807.1067828},
    citeulike-linkout-2 = {http://dx.doi.org/10.3115/1067807.1067828},
    doi = {10.3115/1067807.1067828},
    isbn = {1333567890},
    keywords = {dialogue},
    pages = {147--154},
    posted-at = {2007-03-20 13:41:45},
    priority = {2},
    publisher = {Association for Computational Linguistics},
    title = {Targeted help for spoken dialogue systems: intelligent feedback improves naive users' performance},
    url = {http://acl.ldc.upenn.edu/E/E03/E03-1075.pdf},
    year = {2003}
}



@book{bratko00:prolog-ai,
    abstract = {The third edition of this best-selling guide to Prolog and Artificial Intelligence has been updated to include key developments in the field while retaining its lucid approach to these topics. Divided into two parts, the first part of the book introduces the programming language Prolog, while the second part teaches Artificial Intelligence using Prolog as a tool for the implementation of AI techniques.  Prolog has its roots in logic, however the main aim of this book is to teach Prolog as a practical programming tool. This text therefore concentrates on the art of using the basic mechanisms of Prolog to solve interesting problems. The third edition has been fully revised and extended to provide an even greater range of applications, which further enhance its value as a self-contained guide to Prolog, AI or AI Programming for students and professional programmers alike.},
    author = {Bratko, Ivan},
    citeulike-article-id = {437132},
    citeulike-linkout-0 = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20\&amp;path=ASIN/0201403757},
    citeulike-linkout-1 = {http://www.amazon.de/exec/obidos/redirect?tag=citeulike01-21\&amp;path=ASIN/0201403757},
    citeulike-linkout-2 = {http://www.amazon.fr/exec/obidos/redirect?tag=citeulike06-21\&amp;path=ASIN/0201403757},
    citeulike-linkout-3 = {http://www.amazon.jp/exec/obidos/ASIN/0201403757},
    citeulike-linkout-4 = {http://www.amazon.co.uk/exec/obidos/ASIN/0201403757/citeulike00-21},
    citeulike-linkout-5 = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/0201403757},
    citeulike-linkout-6 = {http://www.worldcat.org/isbn/0201403757},
    citeulike-linkout-7 = {http://books.google.com/books?vid=ISBN0201403757},
    citeulike-linkout-8 = {http://www.amazon.com/gp/search?keywords=0201403757\&index=books\&linkCode=qs},
    citeulike-linkout-9 = {http://www.librarything.com/isbn/0201403757},
    day = {08},
    edition = {3rd},
    howpublished = {Paperback},
    isbn = {0201403757},
    keywords = {programming, prolog},
    month = {September},
    posted-at = {2007-03-20 13:40:27},
    priority = {2},
    publisher = {Addison Wesley},
    title = {Prolog Programming for Artificial Intelligence},
    url = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/0201403757},
    year = {2000}
}



@techreport{trindi99:d13,
    author = {Bohlin, Peter and Bos, Johan and Larsson, Staffan and Lewin, Ian and Matheson, Colin and Milward, David},
    citeulike-article-id = {1177394},
    citeulike-linkout-0 = {http://www.ling.gu.se/\~{}peb/pubs/BohlinBosLarsson-1999a.pdf},
    institution = {{TRINDI}},
    keywords = {dialogue},
    number = {1.3},
    posted-at = {2007-03-20 13:39:36},
    priority = {2},
    title = {Survey of Existing Interactive Systems},
    type = {Deliverable},
    url = {http://www.ling.gu.se/\~{}peb/pubs/BohlinBosLarsson-1999a.pdf},
    year = {1999}
}



@book{kernighan88:c,
    abstract = {Just about every C programmer I respect learned C from this book. Unlike many of the 1,000 page doorstops stuffed with CD-ROMs that have become popular, this volume is concise and powerful (if somewhat dangerous) -- like C itself. And it was written by Kernighan himself. Need we say more?},
    author = {Kernighan, Brian W. and Ritchie, Dennis M.},
    citeulike-article-id = {167576},
    citeulike-linkout-0 = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20\&amp;path=ASIN/0131103628},
    citeulike-linkout-1 = {http://www.amazon.de/exec/obidos/redirect?tag=citeulike01-21\&amp;path=ASIN/0131103628},
    citeulike-linkout-2 = {http://www.amazon.fr/exec/obidos/redirect?tag=citeulike06-21\&amp;path=ASIN/0131103628},
    citeulike-linkout-3 = {http://www.amazon.jp/exec/obidos/ASIN/0131103628},
    citeulike-linkout-4 = {http://www.amazon.co.uk/exec/obidos/ASIN/0131103628/citeulike00-21},
    citeulike-linkout-5 = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/0131103628},
    citeulike-linkout-6 = {http://www.worldcat.org/isbn/0131103628},
    citeulike-linkout-7 = {http://books.google.com/books?vid=ISBN0131103628},
    citeulike-linkout-8 = {http://www.amazon.com/gp/search?keywords=0131103628\&index=books\&linkCode=qs},
    citeulike-linkout-9 = {http://www.librarything.com/isbn/0131103628},
    day = {01},
    edition = {2},
    howpublished = {Paperback},
    isbn = {0131103628},
    keywords = {c, programming},
    month = {March},
    posted-at = {2007-03-20 13:36:29},
    priority = {2},
    publisher = {Prentice Hall},
    title = {C Programming Language},
    url = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/0131103628},
    year = {1988}
}



@book{stroustrup97:c++,
    abstract = {In this brand-new third edition of The C++ Programming Language, author Bjarne Stroustrup, the creator of C++, presents the full specification for the C++ language and standard library, a spec that will soon become the joint ISO/ANSI C++ standard.},
    author = {Stroustrup, Bjarne},
    citeulike-article-id = {106123},
    citeulike-linkout-0 = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20\&amp;path=ASIN/0201889544},
    citeulike-linkout-1 = {http://www.amazon.de/exec/obidos/redirect?tag=citeulike01-21\&amp;path=ASIN/0201889544},
    citeulike-linkout-2 = {http://www.amazon.fr/exec/obidos/redirect?tag=citeulike06-21\&amp;path=ASIN/0201889544},
    citeulike-linkout-3 = {http://www.amazon.jp/exec/obidos/ASIN/0201889544},
    citeulike-linkout-4 = {http://www.amazon.co.uk/exec/obidos/ASIN/0201889544/citeulike00-21},
    citeulike-linkout-5 = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/0201889544},
    citeulike-linkout-6 = {http://www.worldcat.org/isbn/0201889544},
    citeulike-linkout-7 = {http://books.google.com/books?vid=ISBN0201889544},
    citeulike-linkout-8 = {http://www.amazon.com/gp/search?keywords=0201889544\&index=books\&linkCode=qs},
    citeulike-linkout-9 = {http://www.librarything.com/isbn/0201889544},
    day = {20},
    edition = {Third},
    howpublished = {Paperback},
    isbn = {0201889544},
    keywords = {c-plus-plus, programming},
    month = {June},
    posted-at = {2007-03-20 13:34:52},
    priority = {2},
    publisher = {Addison-Wesley Professional},
    title = {The C++ Programming Language},
    url = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/0201889544},
    year = {1997}
}



@book{gosling05:java,
    address = {Indianapolis},
    author = {Gosling, James and Joy, Bill and Steele, Guy and Bracha, Gilad},
    citeulike-article-id = {113341},
    citeulike-linkout-0 = {http://java.sun.com/docs/books/jls/},
    citeulike-linkout-1 = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20\&amp;path=ASIN/0321246780},
    citeulike-linkout-2 = {http://www.amazon.de/exec/obidos/redirect?tag=citeulike01-21\&amp;path=ASIN/0321246780},
    citeulike-linkout-3 = {http://www.amazon.fr/exec/obidos/redirect?tag=citeulike06-21\&amp;path=ASIN/0321246780},
    citeulike-linkout-4 = {http://www.amazon.co.uk/exec/obidos/ASIN/0321246780/citeulike00-21},
    citeulike-linkout-5 = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/0321246780},
    citeulike-linkout-6 = {http://www.worldcat.org/isbn/0321246780},
    citeulike-linkout-7 = {http://books.google.com/books?vid=ISBN0321246780},
    citeulike-linkout-8 = {http://www.amazon.com/gp/search?keywords=0321246780\&index=books\&linkCode=qs},
    citeulike-linkout-9 = {http://www.librarything.com/isbn/0321246780},
    day = {08},
    edition = {Third},
    howpublished = {Paperback},
    isbn = {0321246780},
    keywords = {java, programming},
    month = {July},
    posted-at = {2007-03-20 13:31:57},
    priority = {1},
    publisher = {Addison-Wesley Professional},
    title = {Java Language Specification},
    url = {http://java.sun.com/docs/books/jls/},
    year = {2005}
}



@inproceedings{pollard04:hog,
    author = {Pollard, Carl},
    booktitle = {Proceedings of Categorial Grammars 2004},
    citeulike-article-id = {1177388},
    citeulike-linkout-0 = {http://www.ling.ohio-state.edu/\~{}hana/hog/pollard2004-CG.pdf},
    keywords = {grammars, hog},
    month = {June},
    pages = {340--361},
    posted-at = {2007-03-20 13:29:42},
    priority = {2},
    title = {Higher-Order Categorial Grammar},
    url = {http://www.ling.ohio-state.edu/\~{}hana/hog/pollard2004-CG.pdf},
    year = {2004}
}



@misc{talk:d16,
    author = {Ericsson, Stina and Amores, Gabriel and Bringert, Bj\"{o}rn and Burden, H\r{a}kan and Forslund, Ann-Charlotte and Hjelm, David and Jonson, Rebecca and Larsson, Staffan and Ljungl\"{o}f, Peter and Manch\'{o}n, Pilar and Milward, David and P\'{e}rez, Guillermo and Sandin, Mikael},
    citeulike-article-id = {1177382},
    citeulike-linkout-0 = {http://www.talk-project.org/fileadmin/talk/publications\_public/deliverables\_public/D1\_6.pdf},
    howpublished = {deliverable 1.6},
    keywords = {dialogue, multilingual, multimodal},
    posted-at = {2007-03-20 13:24:05},
    priority = {2},
    publisher = {TALK project, IST-507802},
    title = {Software illustrating a unified approach to multimodality and multilinguality in the in-home domain},
    url = {http://www.talk-project.org/fileadmin/talk/publications\_public/deliverables\_public/D1\_6.pdf},
    year = {2006}
}



@book{martin-lof84:inttt,
    address = {Naples},
    author = {Martin-L\"{o}f, Per},
    citeulike-article-id = {1177380},
    keywords = {type-theory},
    posted-at = {2007-03-20 13:21:29},
    priority = {2},
    publisher = {Bibliopolis},
    title = {Intuitionistic Type Theory},
    year = {1984}
}



@incollection{curry61:logical-grammar,
    address = {Providence},
    author = {Curry, Haskell B.},
    booktitle = {Structure of Language and its Mathematical Aspects, volume 12 of Symposia on Applied Mathematics},
    citeulike-article-id = {1177379},
    citeulike-linkout-0 = {http://books.google.com/books?id=ou\_zOzU9wEwC\&\#38;pg=PA56},
    editor = {Jakobson, Roman O.},
    keywords = {grammars},
    pages = {56--68},
    posted-at = {2007-03-20 13:21:29},
    priority = {2},
    publisher = {American Mathematical Society},
    title = {Some Logical Aspects of Grammatical Structure},
    url = {http://books.google.com/books?id=ou\_zOzU9wEwC\&\#38;pg=PA56},
    year = {1961}
}



@misc{ranta06:gf-resource-lib,
    author = {Ranta, Aarne and El-Dada, Ali and Khegai, Janna},
    citeulike-article-id = {1177378},
    citeulike-linkout-0 = {http://www.cs.chalmers.se/\~{}aarne/GF/doc/resource.pdf},
    keywords = {gf, grammars},
    month = {June},
    posted-at = {2007-03-20 13:21:28},
    priority = {2},
    title = {The GF Resource Grammar Library},
    url = {http://www.cs.chalmers.se/\~{}aarne/GF/doc/resource.pdf},
    year = {2006}
}



@incollection{moore99:nl-sources-srg,
    author = {Moore, Robert C.},
    booktitle = {Computational Models of Speech Pattern Processing},
    citeulike-article-id = {1177373},
    citeulike-linkout-0 = {http://research.microsoft.com/users/bobmoore/nato-asi.pdf},
    editor = {Ponting, K. M.},
    keywords = {srg},
    pages = {304--327},
    posted-at = {2007-03-20 13:18:44},
    priority = {2},
    publisher = {Springer},
    title = {Using Natural-Language Knowledge Sources in Speech Recognition},
    url = {http://research.microsoft.com/users/bobmoore/nato-asi.pdf},
    year = {1999}
}



@inproceedings{becker06:sammie,
    author = {Becker, Tilman and Blaylock, Nate and Gerstenberger, Ciprian and Korbayov\'{a}, Ivana K. and Korthauer, Andreas and Pinkal, Manfred and Pitz, Michael and Poller, Peter and Schehl, Jan},
    booktitle = {ECAI 2006, 17th European Conference on Artificial Intelligence},
    citeulike-article-id = {1177369},
    citeulike-linkout-0 = {http://www.coli.uni-saarland.de/\~{}blaylock/Pubs/Files/pais06.pdf},
    keywords = {dialogue, multimodal},
    pages = {612--616},
    posted-at = {2007-03-20 13:14:57},
    priority = {2},
    title = {Natural and Intuitive Multimodal Dialogue for In-Car Applications: The SAMMIE System.},
    url = {http://www.coli.uni-saarland.de/\~{}blaylock/Pubs/Files/pais06.pdf},
    year = {2006}
}



@inproceedings{dowding01:practical,
    address = {Morristown, NJ, USA},
    author = {Dowding, John and Hockey, Beth A. and Gawron, Jean M. and Culy, Christopher},
    booktitle = {ACL '01: Proceedings of the 39th Annual Meeting on Association for Computational Linguistics},
    citeulike-article-id = {1177365},
    citeulike-linkout-0 = {http://dx.doi.org/10.3115/1073012.1073034},
    citeulike-linkout-1 = {http://portal.acm.org/citation.cfm?id=1073034},
    doi = {10.3115/1073012.1073034},
    keywords = {grammars, srg},
    pages = {164--171},
    posted-at = {2007-03-20 13:13:49},
    priority = {0},
    publisher = {Association for Computational Linguistics},
    title = {Practical issues in compiling typed unification grammars for speech recognition},
    url = {http://dx.doi.org/10.3115/1073012.1073034},
    year = {2001}
}



@inproceedings{rayner06:regulus,
    author = {Rayner, Manny and Bouillon, Pierrette and Hockey, Beth A. and Chatzichrisafis, Nikos},
    booktitle = {Proceedings of LREC},
    citeulike-article-id = {1177363},
    citeulike-linkout-0 = {http://www.issco.unige.ch/pub/RaynerEA\_LREC2006.pdf},
    keywords = {grammars, regulus, srg},
    month = {May},
    posted-at = {2007-03-20 13:12:29},
    priority = {2},
    title = {REGULUS: A Generic Multilingual Open Source Platform for Grammar-Based Speech Applications},
    url = {http://www.issco.unige.ch/pub/RaynerEA\_LREC2006.pdf},
    year = {2006}
}



@book{rayner06:regulus-book,
    abstract = {Most computer programs that analyze spoken dialogue use a spoken command grammar, which limits what the user can say when talking to the system. To make this process simpler, more automated, and effective for command grammars even at initial stages of a project, the Regulus grammar compiler was developed by a consortium of experts—including NASA scientists. This book presents a complete description of both the practical and theoretical aspects of Regulus and will be extremely helpful for students and scholars working in computational linguistics as well as software engineering.},
    address = {Ventura Hall, Stanford University, Stanford, CA 94305, USA},
    author = {Rayner, Manny and Hockey, Beth A. and Bouillon, Pierrette},
    citeulike-article-id = {1177360},
    citeulike-linkout-0 = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20\&amp;path=ASIN/1575865262},
    citeulike-linkout-1 = {http://www.amazon.de/exec/obidos/redirect?tag=citeulike01-21\&amp;path=ASIN/1575865262},
    citeulike-linkout-2 = {http://www.amazon.fr/exec/obidos/redirect?tag=citeulike06-21\&amp;path=ASIN/1575865262},
    citeulike-linkout-3 = {http://www.amazon.co.uk/exec/obidos/ASIN/1575865262/citeulike00-21},
    citeulike-linkout-4 = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/1575865262},
    citeulike-linkout-5 = {http://www.worldcat.org/isbn/1575865262},
    citeulike-linkout-6 = {http://books.google.com/books?vid=ISBN1575865262},
    citeulike-linkout-7 = {http://www.amazon.com/gp/search?keywords=1575865262\&index=books\&linkCode=qs},
    citeulike-linkout-8 = {http://www.librarything.com/isbn/1575865262},
    day = {01},
    howpublished = {Paperback},
    isbn = {1575865262},
    keywords = {grammars, regulus, srg},
    month = {July},
    posted-at = {2007-03-20 13:09:41},
    priority = {3},
    publisher = {CSLI Publications},
    title = {Putting Linguistics into Speech Recognition: The Regulus Grammar Compiler},
    url = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/1575865262},
    year = {2006}
}



@book{htkbook,
    author = {Young, Steve and Evermann, Gunnar and Gales, Mark and Hain, Thomas and Kershaw, Dan and Liu, Xunying A. and Moore, Gareth and Odell, Julian and Ollason, Dave and Povey, Dan and Valtchev, Valtcho and Woodland, Phil},
    citeulike-article-id = {1177348},
    citeulike-linkout-0 = {http://htk.eng.cam.ac.uk/docs/docs.shtml},
    keywords = {asr, htk},
    posted-at = {2007-03-20 13:02:47},
    priority = {0},
    publisher = {Cambridge University Engineering Department},
    title = {The HTK Book (for HTK Version 3.4)},
    url = {http://htk.eng.cam.ac.uk/docs/docs.shtml},
    year = {2006}
}



@manual{nuance:grammar,
    address = {Menlo Park, CA, USA},
    citeulike-article-id = {1177340},
    keywords = {asr, manual, nuance},
    month = {December},
    organization = {Nuance Communications, Inc.},
    posted-at = {2007-03-20 12:50:18},
    priority = {0},
    title = {Nuance Speech Recognition System 8.5: Grammar Developer's Guide},
    year = {2003}
}



@techreport{xhtml+voice,
    author = {Axelsson, Jonny and Cross, Chris and Ferrans, Jim and Mccobb, Gerald and Raman, T. V. and Wilson, Les},
    citeulike-article-id = {1177339},
    citeulike-linkout-0 = {http://www.voicexml.org/specs/multimodal/x+v/12/},
    institution = {{VoiceXML} Forum},
    keywords = {voicexml, web, xhtml-voice},
    posted-at = {2007-03-20 12:50:18},
    priority = {0},
    title = {{XHTML+Voice} Profile 1.2},
    type = {Specification},
    url = {http://www.voicexml.org/specs/multimodal/x+v/12/},
    year = {2004}
}



@techreport{SCXML,
    author = {Helbing, Marc and Barnett, Jim and Reifenrath, Klaus and Auburn, R. J. and Bodell, Michael and Hosn, Rafah},
    citeulike-article-id = {1177338},
    citeulike-linkout-0 = {http://www.w3.org/TR/2006/WD-scxml-20060124/},
    institution = {W3C},
    keywords = {voicexml},
    month = {January},
    posted-at = {2007-03-20 12:50:18},
    priority = {2},
    title = {State Chart {XML} ({SCXML}): State Machine Notation for Control Abstraction},
    type = {Working Draft},
    url = {http://www.w3.org/TR/2006/WD-scxml-20060124/},
    year = {2006}
}



@book{ECMA-327,
    address = {Geneva, Switzerland},
    citeulike-article-id = {1177337},
    citeulike-linkout-0 = {http://www.ecma-international.org/publications/standards/Ecma-327.htm},
    edition = {Third},
    keywords = {ecmascript, javascript, programming},
    month = {June},
    posted-at = {2007-03-20 12:50:18},
    priority = {0},
    publisher = {ECMA (European Association for Standardizing Information and Communication Systems)},
    title = {ECMA-327: ECMAScript 3: Compact Profile},
    url = {http://www.ecma-international.org/publications/standards/Ecma-327.htm},
    year = {2001}
}



@techreport{SISR-20030401,
    author = {Van Tichelen, Luc},
    citeulike-article-id = {1177336},
    citeulike-linkout-0 = {http://www.w3.org/TR/2003/WD-semantic-interpretation-20030401/},
    day = {1},
    institution = {W3C},
    keywords = {sisr, srg},
    month = {April},
    posted-at = {2007-03-20 12:50:18},
    priority = {0},
    title = {Semantic Interpretation for Speech Recognition Working Draft},
    url = {http://www.w3.org/TR/2003/WD-semantic-interpretation-20030401/},
    year = {2003}
}



@techreport{SISR,
    author = {Burke, David and Van Tichelen, Luc},
    citeulike-article-id = {1177335},
    citeulike-linkout-0 = {http://www.w3.org/TR/2006/WD-semantic-interpretation-20061103},
    institution = {W3C},
    keywords = {srg},
    month = {November},
    posted-at = {2007-03-20 12:50:18},
    priority = {0},
    title = {Semantic Interpretation for Speech Recognition ({SISR}) Version 1.0},
    type = {Working Draft},
    url = {http://www.w3.org/TR/2006/WD-semantic-interpretation-20061103},
    year = {2006}
}



@techreport{SRGS,
    author = {Hunt, Andrew and Mcglashan, Scott},
    citeulike-article-id = {1177334},
    citeulike-linkout-0 = {http://www.w3.org/TR/2004/REC-speech-grammar-20040316/},
    institution = {{W3C}},
    keywords = {srg},
    month = {March},
    posted-at = {2007-03-20 12:50:18},
    priority = {0},
    title = {Speech Recognition Grammar Specification Version 1.0},
    type = {Recommendation},
    url = {http://www.w3.org/TR/2004/REC-speech-grammar-20040316/},
    year = {2004}
}



@techreport{jsgf,
    author = {Hunt, Andrew},
    citeulike-article-id = {1177333},
    citeulike-linkout-0 = {http://www.w3.org/TR/2000/NOTE-jsgf-20000605/},
    institution = {W3C},
    keywords = {srg},
    month = {June},
    posted-at = {2007-03-20 12:50:18},
    priority = {0},
    title = {JSpeech Grammar Format},
    url = {http://www.w3.org/TR/2000/NOTE-jsgf-20000605/},
    year = {2000}
}



@techreport{voicexml-20,
    author = {Ferrans, Jim and Danielsen, Peter and Hunt, Andrew and Porter, Brad and Lucas, Bruce and Mcglashan, Scott and Tryphonas, Steph and Rehor, Ken and Burnett, Daniel C. and Carter, Jerry},
    citeulike-article-id = {1177332},
    citeulike-linkout-0 = {http://www.w3.org/TR/2004/REC-voicexml20-20040316/},
    institution = {W3C},
    keywords = {voicexml},
    month = {March},
    posted-at = {2007-03-20 12:50:17},
    priority = {0},
    title = {Voice Extensible Markup Language (VoiceXML) Version 2.0},
    url = {http://www.w3.org/TR/2004/REC-voicexml20-20040316/},
    year = {2004}
}



@inproceedings{bringert05:multimodal-grammars,
    author = {Bringert, Bj\"{o}rn and Cooper, Robin and Ljungl\"{o}f, Peter and Ranta, Aarne},
    booktitle = {Proceedings of DIALOR'05, Ninth Workshop on the Semantics and Pragmatics of Dialogue, Nancy, France},
    citeulike-article-id = {1177331},
    citeulike-linkout-0 = {http://dialor05.loria.fr/Papers/07-BjornBringert.pdf},
    citeulike-linkout-1 = {http://www.cs.chalmers.se/\~{}bringert/publ/mm-grammars-dialor/mm-grammars-dialor.pdf},
    keywords = {dialogue, multimodal},
    location = {Nancy, France},
    month = {June},
    pages = {53--60},
    posted-at = {2007-03-20 12:48:44},
    priority = {0},
    title = {Multimodal Dialogue System Grammars},
    url = {http://dialor05.loria.fr/Papers/07-BjornBringert.pdf},
    year = {2005}
}



@article{ranta04:dialogue-proof-editors,
    address = {Hingham, MA, USA},
    author = {Ranta, Aarne and Cooper, Robin},
    citeulike-article-id = {1177324},
    citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=985195},
    citeulike-linkout-1 = {http://dx.doi.org/10.1023/B:JLLI.0000024736.34644.48},
    doi = {10.1023/B:JLLI.0000024736.34644.48},
    issn = {0925-8531},
    journal = {Journal of Logic, Language and Information},
    keywords = {dialogue, gf, type-theory},
    number = {2},
    pages = {225--240},
    posted-at = {2007-03-20 12:45:16},
    priority = {0},
    publisher = {Kluwer Academic Publishers},
    title = {Dialogue Systems as Proof Editors},
    url = {http://dx.doi.org/10.1023/B:JLLI.0000024736.34644.48},
    volume = {13},
    year = {2004}
}



@article{haskell98-libraries,
    author = {Peyton-Jones, Simon},
    citeulike-article-id = {1175997},
    journal = {Journal of Functional Programming},
    keywords = {haskell, programming},
    number = {1},
    pages = {149--240},
    posted-at = {2007-03-19 15:06:14},
    priority = {0},
    title = {The Haskell 98 Libraries},
    volume = {13},
    year = {2003}
}



@article{haskell98,
    author = {Peyton-Jones, Simon},
    citeulike-article-id = {1175996},
    journal = {Journal of Functional Programming},
    keywords = {haskell, programming},
    number = {1},
    pages = {1--146},
    posted-at = {2007-03-19 15:06:14},
    priority = {0},
    title = {The Haskell 98 Language},
    volume = {13},
    year = {2003}
}



@article{danielsson06:fast-loose,
    address = {New York, NY, USA},
    author = {Danielsson, Nils A. and Hughes, John and Jansson, Patrik and Gibbons, Jeremy},
    citeulike-article-id = {665357},
    citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1111320.1111056},
    citeulike-linkout-1 = {http://dx.doi.org/10.1145/1111320.1111056},
    doi = {10.1145/1111320.1111056},
    isbn = {1595930272},
    journal = {SIGPLAN Not.},
    keywords = {haskell},
    month = {January},
    number = {1},
    pages = {206--217},
    posted-at = {2007-03-19 15:04:55},
    priority = {0},
    publisher = {ACM Press},
    title = {Fast and loose reasoning is morally correct},
    url = {http://dx.doi.org/10.1145/1111320.1111056},
    volume = {41},
    year = {2006}
}



@article{mcbride07:applicative,
    abstract = {In this paper, we introduce Applicative functors--an abstract characterisation of an applicative style of effectful programming, weaker than Monads and hence more widespread. Indeed, it is the ubiquity of this programming pattern that drew us to the abstraction. We retrace our steps in this paper, introducing the applicative pattern by diverse examples, then abstracting it to define the Applicative type class and introducing a bracket notation which interprets the normal application syntax in the idiom of an Applicative functor. Further, we develop the properties of applicative functors and the generic operations they support. We close by identifying the categorical structure of applicative functors and examining their relationship both with Monads and with Arrows.},
    address = {Cambridge, UK},
    author = {Mcbride, Conor and Paterson, Ross},
    citeulike-article-id = {465691},
    citeulike-linkout-0 = {http://dx.doi.org/10.1017/S0956796807006326},
    citeulike-linkout-1 = {http://www.soi.city.ac.uk/\~{}ross/papers/Applicative.html},
    doi = {10.1017/S0956796807006326},
    journal = {Journal of Functional Programming},
    keywords = {haskell},
    month = {January},
    number = {1},
    pages = {1--13},
    posted-at = {2007-03-19 14:48:35},
    priority = {0},
    publisher = {Cambridge University Press},
    title = {Applicative Programming with Effects},
    url = {http://www.soi.city.ac.uk/\~{}ross/papers/Applicative.html},
    volume = {18},
    year = {2008}
}



@inproceedings{villing06:dico,
    abstract = {We present a demo of a set of dialogue system applications for controlling various devices in a truck. All applications use the GoDiS dialogue manager and implement multimodal menu-based dialogue (MMD) based on the menu structures of existing GUI interfaces.},
    author = {Villing, Jessica and Larsson, Staffan},
    booktitle = {BRANDIAL'06, Proceedings of the 10th Workshop on the Semantics and Pragmatics of Dialogue},
    citeulike-article-id = {1167727},
    citeulike-linkout-0 = {http://www.ling.uni-potsdam.de/brandial/Proceedings/brandial06\_villing\_etal.pdf},
    keywords = {dialogue, godis, multimodal},
    pages = {187--188},
    posted-at = {2007-03-16 15:18:35},
    priority = {2},
    title = {Dico: A Multimodal Menu-based In-vehicle Dialogue System},
    url = {http://www.ling.uni-potsdam.de/brandial/Proceedings/brandial06\_villing\_etal.pdf},
    year = {2006}
}



@mastersthesis{olsson05:dico,
    author = {Olsson, Anna and Villing, Jessica},
    citeulike-article-id = {1167724},
    citeulike-linkout-0 = {http://www.ling.gu.se/\~{}jessica/Dico.pdf},
    keywords = {dialogue, godis},
    posted-at = {2007-03-16 15:15:04},
    priority = {2},
    school = {G\"{o}teborg University},
    title = {Dico - a Dialogue System for a Cell Phone},
    url = {http://www.ling.gu.se/\~{}jessica/Dico.pdf},
    year = {2005}
}



@techreport{talk:d23,
    author = {Lemon, Oliver and Georgila, Kallirroi and Milward, David and Herbert, Tommy},
    citeulike-article-id = {1167615},
    citeulike-linkout-0 = {http://www.talk-project.org/fileadmin/talk/publications\_public/deliverables\_public/D2\_3.pdf},
    howpublished = {deliverable 2.3},
    keywords = {dialogue},
    posted-at = {2007-03-16 13:42:56},
    priority = {2},
    publisher = {TALK project, IST-507802},
    title = {Programming Devices and Services},
    url = {http://www.talk-project.org/fileadmin/talk/publications\_public/deliverables\_public/D2\_3.pdf},
    year = {2006}
}



@inproceedings{lemon06:dude,
    author = {Lemon, Oliver and Liu, Xingkun},
    booktitle = {EACL 2006, 11st Conference of the European Chapter of the Association for Computational Linguistics},
    citeulike-article-id = {1167605},
    citeulike-linkout-0 = {http://www.aclweb.org/anthology-new/E/E06/E06-2004.pdf},
    citeulike-linkout-1 = {http://homepages.inf.ed.ac.uk/olemon/dude-final.pdf},
    keywords = {dialogue, gf},
    posted-at = {2007-03-16 13:30:21},
    priority = {2},
    title = {DUDE: a Dialogue and Understanding Development Environment, mapping Business Process Models to Information State Update dialogue systems},
    url = {http://www.aclweb.org/anthology-new/E/E06/E06-2004.pdf},
    year = {2006}
}



@inproceedings{lemon06:programming-by-voice,
    author = {Georgila, Kallirroi and Lemon, Oliver},
    booktitle = {BRANDIAL'06, Proceedings of the 10th Workshop on the Semantics and Pragmatics of Dialogue},
    citeulike-article-id = {1167601},
    citeulike-linkout-0 = {http://www.ling.uni-potsdam.de/brandial/Proceedings/brandial06\_georgila\_etal.pdf},
    keywords = {dialogue},
    pages = {199--200},
    posted-at = {2007-03-16 13:15:11},
    priority = {2},
    title = {Programming by Voice: enhancing adaptivity and robustness of spoken dialogue systems},
    url = {http://www.ling.uni-potsdam.de/brandial/Proceedings/brandial06\_georgila\_etal.pdf},
    year = {2006}
}



@inproceedings{lemon06:reall-dude,
    author = {Lemon, Oliver and Liu, Xingkun and Shapiro, Daniel and Tollander, Carl},
    booktitle = {BRANDIAL'06, Proceedings of the 10th Workshop on the Semantics and Pragmatics of Dialogue},
    citeulike-article-id = {1167600},
    citeulike-linkout-0 = {http://www.ling.uni-potsdam.de/brandial/Proceedings/brandial06\_lemon\_etal.pdf},
    keywords = {dialogue},
    month = {September},
    pages = {185--186},
    posted-at = {2007-03-16 13:13:34},
    priority = {2},
    title = {Hierarchical Reinforcement Learning of Dialogue Policies in a development environment for dialogue systems: REALL-DUDE},
    url = {http://www.ling.uni-potsdam.de/brandial/Proceedings/brandial06\_lemon\_etal.pdf},
    year = {2006}
}



@proceedings{citeulike:1165808,
    abstract = {The availability of real-time continuous speech recognition on mobile and embedded devices has opened up a wide range of research opportunities in human-computer interactive applications. Unfortunately, most of the work in this area to date has been confined to proprietary software, or has focused on limited domains with constrained grammars. In this paper, we present a preliminary case study on the porting and optimization of CMU SPHINX-II, a popular open source large vocabulary continuous speech recognition (LVCSR) system, to hand-held devices. The resulting system operates in an average 0.87 times real-time on a 206MHz device, 8.03 times faster than the baseline system. To our knowledge, this is the first hand-held LVCSR system available under an open-source license.},
    author = {Huggins-Daines, D. and Kumar, M. and Chan, A. and Black, A. W. and Ravishankar, M. and Rudnicky, A. I.},
    citeulike-article-id = {1165808},
    citeulike-linkout-0 = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=1659988},
    journal = {Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on},
    keywords = {asr},
    pages = {I-185--I-188},
    posted-at = {2007-03-15 17:57:18},
    priority = {4},
    title = {Pocketsphinx: A Free, Real-Time Continuous Speech Recognition System for Hand-Held Devices},
    url = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=1659988},
    volume = {1},
    year = {2006}
}



@inproceedings{peyton-jones06:gadt-type-inference,
    abstract = {Generalized algebraic data types (GADTs), sometimes known as "guarded recursive data types" or "first-class phantom types", are a simple but powerful generalization of the data types of Haskell and ML. Recent works have given compelling examples of the utility of GADTs, although type inference is known to be difficult. Our contribution is to show how to exploit programmer-supplied type annotations to make the type inference task almost embarrassingly easy. Our main technical innovation is  wobbly types , which express in a declarative way the uncertainty caused by the incremental nature of typical type-inference algorithms.},
    address = {New York, NY, USA},
    author = {Peyton-Jones, Simon and Vytiniotis, Dimitrios and Weirich, Stephanie and Washburn, Geoffrey},
    booktitle = {ICFP '06: Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming},
    citeulike-article-id = {1156288},
    citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1159811},
    citeulike-linkout-1 = {http://dx.doi.org/10.1145/1159803.1159811},
    doi = {10.1145/1159803.1159811},
    isbn = {1-59593-309-3},
    keywords = {gadt, haskell, type-systems},
    location = {Portland, Oregon, USA},
    pages = {50--61},
    posted-at = {2007-03-12 22:48:51},
    priority = {4},
    publisher = {ACM},
    title = {Simple unification-based type inference for GADTs},
    url = {http://dx.doi.org/10.1145/1159803.1159811},
    year = {2006}
}



@inproceedings{hinze04:generics-masses,
    address = {New York},
    author = {Hinze, Ralf},
    booktitle = {ICFP '04: Proceedings of the ninth ACM SIGPLAN international conference on Functional programming},
    citeulike-article-id = {100045},
    citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1016882},
    citeulike-linkout-1 = {http://dx.doi.org/10.1145/1016850.1016882},
    doi = {10.1145/1016850.1016882},
    issn = {0362-1340},
    keywords = {generics, haskell},
    month = {September},
    number = {9},
    pages = {236--243},
    posted-at = {2007-03-12 22:46:00},
    priority = {0},
    publisher = {ACM Press},
    title = {Generics for the masses},
    url = {http://dx.doi.org/10.1145/1016850.1016882},
    volume = {39},
    year = {2004}
}



@inproceedings{hinze06:syb-reloaded,
    address = {Heidelberg},
    author = {Hinze, Ralf and L\"{o}h, Andres and Oliveira, Bruno C. D. S.},
    booktitle = {8th International Symposium on Functional and Logic Programming (FLOPS 2006), Fuji-Susono, Japan},
    citeulike-article-id = {1156268},
    citeulike-linkout-0 = {http://dx.doi.org/10.1007/11737414\_3},
    doi = {10.1007/11737414\_3},
    editor = {Hagiya, Masami and Wadler, Philip},
    keywords = {generics, haskell, syb},
    pages = {13--29},
    posted-at = {2007-03-12 22:41:36},
    priority = {0},
    publisher = {Springer},
    series = {Lecture Notes in Computer Science},
    title = {``Scrap Your Boilerplate'' Reloaded},
    url = {http://dx.doi.org/10.1007/11737414\_3},
    volume = {3945},
    year = {2006}
}



@inproceedings{lammel03:syb,
    abstract = {We describe a design pattern for writing programs that traverse data structures built from rich mutually-recursive data types. Such programs often have a great deal of "boilerplate" code that simply walks the structure, hiding a small amount of "real" code that constitutes the reason for the traversal. Our technique allows most...},
    address = {New York, NY, USA},
    author = {L\"{a}mmel, Ralf and Peyton-Jones, Simon},
    booktitle = {Proceedings of the ACM SIGPLAN Workshop on Types in Language Design and Implementation (TLDI 2003), New Orleans, LA, USA},
    citeulike-article-id = {692047},
    citeulike-linkout-0 = {http://dx.doi.org/10.1145/604174.604179},
    citeulike-linkout-1 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.3176},
    day = {18},
    doi = {10.1145/604174.604179},
    keywords = {generics, haskell, syb},
    month = {January},
    pages = {26--37},
    posted-at = {2007-03-12 22:10:31},
    priority = {0},
    publisher = {ACM},
    title = {Scrap Your Boilerplate: A Practical Design Pattern for Generic Programming},
    url = {http://dx.doi.org/10.1145/604174.604179},
    year = {2003}
}



@inproceedings{jones95:overloading-polymorphism,
    address = {Heidelberg},
    author = {Jones, Mark P.},
    booktitle = {Advanced Functional Programming, First International Spring School on Advanced Functional Programming Techniques-Tutorial Text},
    citeulike-article-id = {386797},
    citeulike-linkout-0 = {http://dx.doi.org/10.1007/3-540-59451-5\_4},
    citeulike-linkout-1 = {http://portal.acm.org/citation.cfm?id=734150},
    doi = {10.1007/3-540-59451-5\_4},
    isbn = {3540594515},
    keywords = {haskell, programming},
    pages = {97--136},
    posted-at = {2007-03-12 22:04:12},
    priority = {0},
    publisher = {Springer},
    series = {Lecture Notes in Computer Science},
    title = {Functional Programming with Overloading and Higher-Order Polymorphism},
    url = {http://dx.doi.org/10.1007/3-540-59451-5\_4},
    volume = {925},
    year = {1995}
}



@inproceedings{moore00:removing-left-recursion,
    address = {San Francisco, CA, USA},
    author = {Moore, Robert C.},
    booktitle = {Proceedings of the first conference on North American chapter of the Association for Computational Linguistics},
    citeulike-article-id = {1156142},
    citeulike-linkout-0 = {http://research.microsoft.com/users/bobmoore/naacl2k-proc-rev.pdf},
    citeulike-linkout-1 = {http://portal.acm.org/citation.cfm?id=974338},
    citeulike-linkout-2 = {http://dx.doi.org/10.1145/321250.321254},
    doi = {10.1145/321250.321254},
    keywords = {grammars},
    pages = {249--255},
    posted-at = {2007-03-12 21:49:41},
    priority = {0},
    publisher = {Morgan Kaufmann Publishers Inc.},
    title = {Removing left recursion from context-free grammars},
    url = {http://research.microsoft.com/users/bobmoore/naacl2k-proc-rev.pdf},
    year = {2000}
}



@phdthesis{ljunglof04:phd,
    address = {G\"{o}teborg, Sweden},
    author = {Ljungl\"{o}f, Peter},
    citeulike-article-id = {1156141},
    citeulike-linkout-0 = {http://www.ling.gu.se/\~{}peb/pubs/p04-PhD-thesis.pdf},
    keywords = {gf, grammars},
    posted-at = {2007-03-12 21:47:38},
    priority = {0},
    school = {G\"{o}teborg University},
    title = {Expressivity and Complexity of the Grammatical Framework},
    url = {http://www.ling.gu.se/\~{}peb/pubs/p04-PhD-thesis.pdf},
    year = {2004}
}



@article{ranta04:gf,
    abstract = {Grammatical Framework (GF) is a special-purpose functional language for defining grammars. It uses a Logical Framework (LF) for a description of abstract syntax, and adds to this a notation for defining concrete syntax. GF grammars themselves are purely declarative, but can be used both for linearizing syntax trees and parsing strings. GF can describe both formal and natural languages. The key notion of this description is a grammatical object, which is not just a string, but a record that contains all information on inflection and inherent grammatical features such as number and gender in natural languages, or precedence in formal languages. Grammatical objects have a type system, which helps to eliminate run-time errors in language processing. In the same way as a LF, GF uses dependent types in abstract syntax to express semantic conditions, such as well-typedness and proof obligations. Multilingual grammars, where one abstract syntax has many parallel concrete syntaxes, can be used for reliable and meaning-preserving translation. They can also be used in authoring systems, where syntax trees are constructed in an interactive editor similar to proof editors based on LF. While being edited, the trees can simultaneously be viewed in different languages. This paper starts with a gradual introduction to GF, going through a sequence of simpler formalisms till the full power is reached. The introduction is followed by a systematic presentation of the GF formalism and outlines of the main algorithms: partial evaluation and parser generation. The paper concludes by brief discussions of the Haskell implementation of GF, existing applications, and related work.},
    address = {New York, NY, USA},
    author = {Ranta, Aarne},
    citeulike-article-id = {346448},
    citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=967507},
    citeulike-linkout-1 = {http://journals.cambridge.org/action/displayAbstract?fromPage=online\&aid=196719},
    citeulike-linkout-2 = {http://dx.doi.org/10.1017/S0956796803004738},
    doi = {10.1017/S0956796803004738},
    issn = {0956-7968},
    journal = {Journal of Functional Programming},
    keywords = {gf, grammars, type-theory},
    month = {March},
    number = {02},
    pages = {145--189},
    posted-at = {2007-03-12 21:44:16},
    priority = {0},
    publisher = {Cambridge University Press},
    title = {Grammatical Framework: A Type-Theoretical Grammar Formalism},
    url = {http://dx.doi.org/10.1017/S0956796803004738},
    volume = {14},
    year = {2004}
}