Sciweavers

237 search results - page 6 / 48
» Modular Monad Transformers
Sort
View
APLAS
2001
ACM
13 years 11 months ago
Linearly Used Effects: Monadic and CPS Transformations into the Linear Lambda Calculus
Abstract. We propose a semantic and syntactic framework for modelling linearly used effects, by giving the monadic transforms of the computational lambda calculus (considered as th...
Masahito Hasegawa
LOPSTR
2009
Springer
14 years 2 months ago
Deciding Full Branching Time Logic by Program Transformation
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
Alberto Pettorossi, Maurizio Proietti, Valerio Sen...
PLANX
2007
13 years 9 months ago
XML Transformation Language Based on Monadic Second Order Logic
Although monadic second-order logic (MSO) has been a foundation of XML queries, little work has attempted to take MSO formulae themselves as a programming construct. Indeed, MSO f...
Kazuhiro Inaba, Haruo Hosoya
ICFP
2002
ACM
14 years 7 months ago
Monads for incremental computing
This paper presents a monadic approach to incremental computation, suitable for purely functional languages such as Haskell. A program that uses incremental computation is able to...
Magnus Carlsson
GPCE
2007
Springer
14 years 1 months ago
Constructing language processors with algebra combinators
Modular Monadic Semantics (MMS) is a well-known mechanism for structuring modular denotational semantic definitions for programming languages. The principal attraction of MMS is ...
Philip Weaver, Garrin Kimmell, Nicolas Frisby, Per...