In this paper we present an ambiguity preserving translation approach which transfers ambiguous LFG f-structure representations. It is based on packed f-structure representations ...
We discuss the problem of generating text that preserves certain ambiguities, a capability that is useful in applications such as machine translation. We show that it is relativel...
We present a graphical implementation for finite processes of the mobile ambients calculus. Our encoding uses unstructured (i.e., non hierarchical) graphs and it is sound and comp...
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...