Learn More
This paper introduces a type system for Extensible Dependency Grammar (xdg) (Debusmann et al., 2004), a new, modular grammar formalism based on dependency grammar. As xdg is based on graph description, our emphasis is on capturing the notion of multigraph, a tuple of arbitrary many graphs sharing the same set of nodes. An xdg grammar consists of the(More)
We present Alice, a functional programming language that has been designed with strong support for typed open programming. It incorporates concur-rency with data flow synchronisation, higher-order modularity, dynamic modules, and type-safe pickling as a minimal and generic set of simple, orthogonal features providing that support. Based on these mechanisms(More)
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different internal data representations. Although it was originally studied for pure, strongly normalizing languages like System F, it has been extended over the past two decades to reason about(More)
We present Alice, a functional programming language that has been designed with strong support for typed open programming. It incorporates concurrency with data flow synchro-nisation, higher-order modularity, dynamic modules, and type-safe pickling as a minimal and generic set of simple, orthogonal features providing that support. Based on these mechanisms(More)