Sciweavers

29 search results - page 3 / 6
» Generalising monads to arrows
Sort
View
TPHOL
2007
IEEE
14 years 1 months ago
Formalising Generalised Substitutions
Abstract. We use the theorem prover Isabelle to formalise and machinecheck results of the theory of generalised substitutions given by Dunne and used in the B method. We describe t...
Jeremy E. Dawson
ENTCS
2008
125views more  ENTCS 2008»
13 years 7 months ago
Quantum Arrows in Haskell
We argue that a realistic model for quantum computations should be general with respect to measurements, and complete with respect to the information flow between the quantum and ...
Juliana Kaizer Vizzotto, Antônio Carlos da R...
ICFP
2009
ACM
14 years 8 months ago
Causal commutative arrows and their optimization
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
Hai Liu, Eric Cheng, Paul Hudak
HASKELL
2005
ACM
14 years 1 months ago
There and back again: arrows for invertible programming
Invertible programming occurs in the area of data conversion where it is required that the conversion in one direction is the inverse of the other. For that purpose, we introduce ...
Artem Alimarine, Sjaak Smetsers, Arjen van Weelden...