Fixpoint expressions built from functional signatures interpreted over arbitrary complete lattices are considered. A generic notionof automatonis defined and shown, by means of a ...
We present a game-theoretic model of the polymorphic -calculus, system F, as a fibred category. Every morphism of the model defines an -expanded, -normal form ^ of system F whose...
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
We present a categorical theory of ‘well-behaved’ operational semantics which aims at complementing the established theory of domains and denotational semantics to form a cohe...
In this paper, we incorporate a representation of the non-negative extended real numbers based on the composition of linear fractional transformations with nonnegative integer coe...
traction for Functional Languages with Control James Laird LFCS, Department of Computer Science University of Edinburgh This paper considers the consequences of relaxing the brack...