A new kind of attribute grammars, called higher order attribute grammars, is defined. In
higher order attribute grammars the structure tree can be expanded as a result of attribute …

… and Swierstra SD Optimal pretty-printing combinators. Available at: http://www.cs.ruu.nl/groups/ST/…
Swierstra SD and Duponcheel L. Deterministic, error correcting combinator parsers. In …

We show how error-correcting, deterministic, combinator parsers can be constructed for
grammars which have the LL(1) property. The normal disadvantages of conventional combinator …

To improve the quality of type error messages in functional programming languages,we
propose four techniques which influence the behaviour of constraint-based type inference …

Even when programming in a statically typed language we every now and then encounter
statically untypable values; such values result from interpreting values or from communicating …

There are numerous ways to implement a parser for a given syntax; using parser combinators
is a powerful approach to parsing which derives much of its power and expressiveness …

In this paper we describe the architecture of the Utrecht Haskell Compiler (UHC). UHC is a
new Haskell compiler, that supports most (but not all) Haskell 98 features, plus some …

Attribute Grammars (AGs), a general-purpose formalism for describing recursive computations
over data types, avoid the trade-off which arises when building software incrementally: …

First-class attribute grammars Page 45 Informatica 24 (2000) 329-341 329 First-class Attribute
Grammars Oege de Moor and Kevin Backhouse Programming Research Group Wolfson …

We develop, in a stepwise fashion, a set of parser combinators for constructing deterministic,
error-correcting parsers. The only restriction on the grammar is that it is not left recursive. …