MFPS B

20 papers

YearTitle / Authors
2016A Monad for Randomized Algorithms.
Tyler Barker
2016A Predicate/State Transformer Semantics for Bayesian Learning.
Bart Jacobs, Fabio Zanasi
2016Approximate Relational Hoare Logic for Continuous Random Samplings.
Tetsuya Sato
2016Binding Operators for Nominal Sets.
Arthur Azevedo de Amorim
2016Bitopology and Four-valued Logic.
Tomas Jakl, Achim Jung, Ales Pultr
2016Categorical Models of the Differential λ-Calculus Revisited.
J. Robin B. Cockett, Jonathan Gallagher
2016Classical Realizability in the CPS Target Language.
Jonas Frey
2016Coalgebraic Minimization of Automata by Initiality and Finality.
Jurriaan Rot
2016Complete Elgot Monads and Coalgebraic Resumptions.
Sergey Goncharov, Stefan Milius, Christoph Rauch
2016Effectuses from Monads.
Bart Jacobs
2016Giry and the Machine.
Fredrik Dahlqvist, Vincent Danos, Ilias Garnier
2016How to Think of Intersection Types as Cartesian Products.
Rick Statman
2016Iteration and Labelled Iteration.
Bram Geron, Paul Blain Levy
2016On the Representation of Semigroups and Other Congruences in the Lambda Calculus.
Rick Statman
2016Preface.
Lars Birkedal
2016Programs as Data Structures in λSF-Calculus.
Barry Jay
2016Reducing Complex CSP Models to Traces via Priority.
David Mestel, A. W. Roscoe
2016The Algebra of Partial Equivalence Relations.
Fabio Zanasi
2016The Shuffle Quasimonad and Modules with Differentiation and Integration.
Marc Bagnol, Richard Blute, J. Robin B. Cockett, J. S. Lemay
2016The Thirty-second Conference on the Mathematical Foundations of Programming Semantics, MFPS 2016, Carnegie Mellon University, Pittsburgh, PA, USA, May 23-26, 2016
Lars Birkedal