Proceedings 37th Conference on Mathematical Foundations of Programming Semantics

by   Ana Sokolova, et al.

MFPS conferences are dedicated to the areas of mathematics, logic, and computer science that are related to models of computation in general, and to semantics of programming languages in particular. This is a forum where researchers in mathematics and computer science can meet and exchange ideas. The participation of researchers in neighbouring areas is strongly encouraged. Topics include, but are not limited to, the following: bio-computation; concurrent qualitative and quantitative distributed systems; process calculi; probabilistic systems; constructive mathematics; domain theory and categorical models; formal languages; formal methods; game semantics; lambda calculus; programming-language theory; quantum computation; security; topological models; logic; type systems; type theory. We also welcome contributions that address applications of semantics to novel areas such as complex systems, markets, and networks, for example.


Introduction to Univalent Foundations of Mathematics with Agda

We introduce Voevodsky's univalent foundations and univalent mathematics...

Topological duality for distributive lattices, and applications

This book is a course in Stone-Priestley duality theory, with applicatio...

Domains and Stochastic Processes

Domain theory has a long history of applications in theoretical computer...

A novice looks at emotional cognition

Modeling emotional-cognition is in a nascent stage and therefore wide-op...

Computational Complexity of Deciding Provability in Linear Logic and its Fragments

Linear logic was conceived in 1987 by Girard and, in contrast to classic...

Bachelor's thesis on generative probabilistic programming (in Russian language, June 2014)

This Bachelor's thesis, written in Russian, is devoted to a relatively n...

Exploiting Game Theory for Analysing Justifications

Justification theory is a unifying semantic framework. While it has its ...