Finiteness spaces constitute a categorical model of Linear Logic whose objects can be seen as linearly topologised spaces, (a class of topological vector spaces introduced by Lefsc...
The last few years have seen the development of a new calculus which can be considered as an outcome of the last decade of various researches on (higher order) term rewriting syst...
We propose a dependent type theory that integrates programming, specifications, and reasoning about higher-order concurrent programs with shared transactional memory. The design ...
Aleksandar Nanevski, Paul Govereau, Greg Morrisett
We investigate mathematical modelling with theories of data types. We provide a formal setting for the formulation of such theories (TPL) and use it to introduce the notion of a c...
Communication is becoming one of the central elements in software development. As a potential typed foundation for structured communication-centred programming, session types have...