Sciweavers

LICS
1997
IEEE
14 years 3 months ago
Automata, Tableaus and a Reduction Theorem for Fixpoint Calculi in Arbitrary Complete Lattices
Fixpoint expressions built from functional signatures interpreted over arbitrary complete lattices are considered. A generic notionof automatonis defined and shown, by means of a ...
David Janin
LICS
1997
IEEE
14 years 3 months ago
Games and Definability for System F
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...
Dominic J. D. Hughes
LICS
1997
IEEE
14 years 3 months ago
How Much Memory is Needed to Win Infinite Games?
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...
LICS
1997
IEEE
14 years 3 months ago
Linear Higher-Order Pre-Unification
Iliano Cervesato, Frank Pfenning
LICS
1997
IEEE
14 years 4 months ago
Towards a Mathematical Operational Semantics
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...
Daniele Turi, Gordon D. Plotkin
LICS
1997
IEEE
14 years 4 months ago
A Relational Account of Call-by-Value Sequentiality
Jon G. Riecke, Anders Sandholm
LICS
1997
IEEE
14 years 4 months ago
Semantics of Exact Real Arithmetic
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...
Peter John Potts, Abbas Edalat, Martín H&ou...
LICS
1997
IEEE
14 years 4 months ago
Full Abstraction for Functional Languages with Control
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...
James Laird