Institute of Information and Computing Sciences, (2009)
Arthur Baars, S. Doaitse Swierstra
Abstract A permutation phrase is a sequence of elements (possibly of different types) in which each element occurs exactly once and the order is irrelevant. Some of the permutable elements may be...
Abstract Scripting the Type Inference Process (2008)
Bastiaan Heeren, Jurriaan Hage, S. Doaitse Swierstra
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 processes. These...
Abstract FUNCTIONAL PEARL Parsing Permutation Phrases (2008)
Arthur Baars, Andres Löh, S. Doaitse Swierstra
A permutation phrase is a sequence of elements (possibly of different types) in which each element occurs exactly once and the order is irrelevant. Some of the permutable elements may be optional. We...
Arthur I. Baars, S. Doaitse Swierstra
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 with the outside...
Generic validation in an XPath-Haskell data binding (2008)
Rui Guerra, Johan Jeuring, S. Doaitse Swierstra
An XPath data binding for a given host language provides a translation of XPath expressions to expressions in the host language. This paper discusses an XPathHaskell data binding. XPath validation...
www.cs.uu.nl Efficient Functional Unification and Substitution (2008)
Arie Middelkoop, S. Doaitse Swierstra
Implementations of language processing systems often use unification and substitution to compute desired properties of input language fragments; for example when inferring a type for an expression....
generators; D.3.4 [Programming languages]: Language (2007)
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....
First-class Attribute Grammars (2007)
Oege De Moor, Kevin Backhouse, S. Doaitse Swierstra
This paper is a contribution to the ongoing quest for modular descriptions of language processors, with the specic aim of rapidly prototyping domain-specic languages [21]. Some might argue that this...
Inductive data types with negative occurrences in HOL (2007)
We identify that a useful inductive data type ty with negative occurrences like ty!bool in the arguments of its constructors can have a set-theoretic interpretation when the negative occurrence...
Abstract FUNCTIONAL PEARL Parsing Permutation Phrases (2007)
Arthur Baars, Andres Löh, S. Doaitse Swierstra
A permutation phrase is a sequence of elements (possibly of different types) in which each element occurs exactly once and the order is irrelevant. Some of the permutable elements may be optional. We...
www.cs.uu.nl Abstract Interpretation of Functional Programs using an Attribute Grammar System (2007)
Jeroen Fokker, S. Doaitse Swierstra, Jeroen Fokker, S. Doaitse Swierstra
We describe an algorithm for abstract interpretation of an intermediate language in a Haskell compiler, itself also written in Haskell. It computes approximations of possible values for all variables...
www.cs.uu.nl Exploiting Type Annotations (2006)
S. Doaitse Swierstra, Atze Dijkstra, S. Doaitse Swierstra
The Haskell type system has been designed in such a way that all allowed types can be inferred automatically; any explicit type specification only serves as a means of documentation and safeguarding....
www.cs.uu.nl Ruler: programming type rules (2005)
S. Doaitse Swierstra, Atze Dijkstra, S. Doaitse Swierstra
Some type systems are first described formally, to be sometimes followed by an implementation. Other type systems are first implemented as a language extension, to be sometimes retrofitted into a...
www.cs.uu.nl Making Implicit Parameters Explicit (2005)
S. Doaitse Swierstra, Atze Dijkstra, S. Doaitse Swierstra
In almost all languages all arguments to functions are to be given explicitly. The Haskell class system however is an exception: functions can have class predicates as part of their type signature,...
www.cs.uu.nl Linear, Online, Functional Pretty Printing (2004)
S. Doaitse Swierstra, S Doaitse Swierstra
We present an implementation of Oppen’s Pretty printing solution in Haskell. The algorithm is linear in the size of the input, independent of the line width, uses limited look ahead, and has online...
www.cs.uu.nl Explicit implicit parameters (2004)
S. Doaitse Swierstra, Atze Dijkstra, S. Doaitse Swierstra
In almost all languages arguments to functions are to be given explicitly in the program text. There are however a few interesting exceptions to this rule. In Haskell functions take arguments which...
(corrected and extended version) (2004)
S. Doaitse Swierstra, S. Doaitse Swierstra
We present yet another implementation of Oppen’s pretty printing solution in Haskell. The algorithm is linear in the size of the input, independent of the line width, uses limited look ahead, and...
First-class Attribute Grammars (2000)
Oege De Moor, Kevin Backhouse, S. Doaitse Swierstra
This paper is a contribution to the ongoing quest for modular descriptions of language processors, with the specific aim of rapidly prototyping domain-specific languages [21]. Some might argue that...
First-class Attribute Grammars (2000)
Oege De Moor, Kevin Backhouse, S. Doaitse Swierstra
This paper is a contribution to the ongoing quest for modular descriptions of language processors, with the specific aim of rapidly prototyping domain-specific languages [21]. Some might argue that...
Designing and implementing combinator languages (1999)
S. Doaitse Swierstra, Joao Saraiva, Doaitse Swierstra, Pablo Azero, João Saraiva
c ○ the authors, 1998. i ii
Fast, Error Correcting Parser Combinators: A Short Tutorial (1999)
this paper we will present a combinator library that may be used to replace conventional parser generators. We will be the first to admit that many existing special purpose tools do a great job, and...
Deterministic, error-correcting combinator parsers (1996)
S. Doaitse Swierstra, Luc Duponcheel
Abstract. We showhow error-correcting, deterministic, combinator parsers can be constructed for grammars which have the LL(1) property. The normal disadvantages of conventional combinator parsers,...
Deterministic, Error-Correcting Combinator Parsers (1996)
S. Doaitse Swierstra, Luc Duponcheel
. 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 parsers, such as...
Deterministic, error-correcting combinator parsers (1996)
S. Doaitse Swierstra, Luc Duponcheel
Abstract. 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 parsers,...