@inproceedings{carpenter-1993-compiling,
    title = "Compiling Typed Attribute-Value Logic Grammars",
    author = "Carpenter, Bob",
    editor = "Bunt, Harry  and
      Berwick, Robert  and
      Church, Ken  and
      Joshi, Aravind  and
      Kaplan, Ronald  and
      Kay, Martin  and
      Lang, Bernard  and
      Nagao, Makoto  and
      Nijholt, Anton  and
      Steedman, Mark  and
      Thompson, Henry  and
      Tomita, Masaru  and
      Vijay-Shanker, K.  and
      Wilks, Yorick  and
      Wittenburg, Kent",
    booktitle = "Proceedings of the Third International Workshop on Parsing Technologies",
    month = aug # " 10-13",
    year = "1993",
    address = "Tilburg, Netherlands and Durbuy, Belgium",
    publisher = "Association for Computational Linguistics",
    url = "https://preview.aclanthology.org/fix-sig-urls/1993.iwpt-1.5/",
    pages = "39--48",
    abstract = {The unification-based approach to processing attribute-value logic grammars, similar to Prolog \textit{interpretation}, has become the standard. We propose an alternative, embodied in the Attribute-Logic Engine (ALE) (Carpenter 1993) , based on the Warren Abstract Machine (WAM) approach to compiling Prolog (A{\"i}t-Kaci 1991). Phrase structure grammars with procedural attachments, similar to Definite Clause Grammars (DCG) (Pereira {---} Warren 1980), are specified using a typed version of Rounds-Kasper logic (Carpenter 1992). We argue for the benefits of a strong and total version of typing in terms of both clarity and efficiency. Finally, we discuss the compilation of grammars into a few efficient low-level instructions for the basic feature structure operations.}
}