Sciweavers

233 search results - page 18 / 47
» Computational Lambda-Calculus and Monads
Sort
View
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
ENTCS
2006
125views more  ENTCS 2006»
13 years 7 months ago
Monads and Adjunctions for Global Exceptions
In this paper, we look at two categorical accounts of computational effects (strong monad as a model of the monadic metalanguage, adjunction as a model of call-bypush-value with s...
Paul Blain Levy
ICFP
2005
ACM
14 years 7 months ago
Monadic augment and generalised short cut fusion
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo ...
AFP
1995
Springer
125views Formal Methods» more  AFP 1995»
13 years 11 months ago
Merging Monads and Folds for Functional Programming
Abstract. These notes discuss the simultaneous use of generalised fold operators and monads to structure functional programs. Generalised fold operators structure programs after th...
Erik Meijer, Johan Jeuring
EUROCAST
2001
Springer
118views Hardware» more  EUROCAST 2001»
13 years 12 months ago
A Language Prototyping Tool Based on Semantic Building Blocks
We present a Language Prototyping System that facilitates the modular development of interpreters from semantic specifications. The theoretical basis of our system is the integrat...
José Emilio Labra Gayo, Juan Manuel Cueva L...