50 search results - page 4 / 10 » Monads and Effects |
95
Voted
JLP
2010
14 years 10 months ago
2010
A formalism for expressing the operational semantics of proof languages used in procedural theorem provers is proposed. It is argued that this formalism provides an elegant way to...
123
Voted
POPL
2010
ACM
16 years 1 months ago
2010
ACM
In functional programming, monadic characterizations of computational effects are normally understood denotationally: they describe how an effectful program can be systematically ...
107
Voted
PEPM
2009
ACM
16 years 16 days ago
2009
ACM
Computation performed in many typical aspects involve side effects. In a purely functional setting, adding such aspects using techniques such as monadification will generally lea...
112
Voted
CSL
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. A new class of languages of infinite words is introduced, called the maxregular languages, extending the class of -regular languages. The class has two equivalent descrip...
98
Voted
JFP
2008
15 years 3 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...