Results 1 to 10 of about 29,436 (282)
Monad Transformers for Backtracking Search [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 This paper extends Escardo and Oliva's selection monad to the selection monad transformer, a general monadic framework for expressing backtracking search algorithms in Haskell.
Jules Hedges
doaj +7 more sources
Mathematics, 2020 Do the topologies of each dimension have to be same and metrizable for metricization of any space? I show that this is not necessary with monad metrizable spaces.
Orhan GÖÇÜr
exaly +4 more sources
Corecursive Algebras, Corecursive Monads and Bloom Monads [PDF]
Logical Methods in Computer Science, 2014 An algebra is called corecursive if from every coalgebra a unique coalgebra-to-algebra homomorphism exists into it. We prove that free corecursive algebras are obtained as coproducts of the terminal coalgebra (considered as an algebra) and free algebras.
Jiří Adámek +2 more
doaj +5 more sources
The Expectation Monad in Quantum Foundations [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 The expectation monad is introduced abstractly via two composable adjunctions, but concretely captures measures. It turns out to sit in between known monads: on the one hand the distribution and ultrafilter monad, and on the other hand the continuation ...
Bart Jacobs, Jorik Mandemaker
doaj +8 more sources
Unguarded Recursion on Coinductive Resumptions [PDF]
Logical Methods in Computer Science, 2018 We study a model of side-effecting processes obtained by starting from a monad modelling base effects and adjoining free operations using a cofree coalgebra construction; one thus arrives at what one may think of as types of non-wellfounded side ...
Sergey Goncharov +3 more
doaj +3 more sources
Scope ambiguities, monads and strengths
Journal of Language Modelling, 2017 In this paper, we will discuss three semantically distinct scope assignment strategies: traditional movement strategy, polyadic approach, and continuation-based approach.
Justyna Grudzinska, Marek Zawadowski
doaj +4 more sources
Presenting Distributive Laws [PDF]
Logical Methods in Computer Science, 2015 Distributive laws of a monad T over a functor F are categorical tools for specifying algebra-coalgebra interaction. They proved to be important for solving systems of corecursive equations, for the specification of well-behaved structural operational ...
Marcello M. Bonsangue +3 more
doaj +9 more sources
Weak bisimulation for coalgebras over order enriched monads [PDF]
Logical Methods in Computer Science, 2015 The paper introduces the notion of a weak bisimulation for coalgebras whose type is a monad satisfying some extra properties. In the first part of the paper we argue that systems with silent moves should be modelled coalgebraically as coalgebras whose ...
Tomasz Brengos
doaj +4 more sources
Coalgebraic Trace Semantics for Continuous Probabilistic Transition Systems [PDF]
Logical Methods in Computer Science, 2013 Coalgebras in a Kleisli category yield a generic definition of trace semantics for various types of labelled transition systems. In this paper we apply this generic theory to generative probabilistic transition systems, short PTS, with arbitrary ...
Henning Kerstan, Barbara König
doaj +4 more sources
Coalgebraic Infinite Traces and Kleisli Simulations [PDF]
Logical Methods in Computer Science, 2018 Kleisli simulation is a categorical notion introduced by Hasuo to verify finite trace inclusion. They allow us to give definitions of forward and backward simulation for various types of systems. A generic categorical theory behind Kleisli simulation has
Natsuki Urabe, Ichiro Hasuo
doaj +3 more sources