29 search results - page 5 / 6 » Generalising monads to arrows |
JFP
2008
13 years 7 months ago
2008
In this paper, we introduce Applicative functors--an abstract characterisation of an applicative style of effectful programming, weaker than Monads and hence more widespread. it i...
FCT
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Generalising modules over associative rings, the notion of modules for an endofunctor of any category is well established and useful in large parts of mathematics includi...
LFP
1990
13 years 8 months ago
1990
Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970�...
CONCUR
2004
Springer
14 years 25 days ago
2004
Springer
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
MFCS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. The description of a single state of a modelled system is often complex in practice, but few procedures for synthesis address this problem in depth. We study systems in w...