Sciweavers

1458 search results - page 9 / 292
» Monads for incremental computing
Sort
View
BIRTHDAY
2003
Springer
14 years 3 months ago
Colimits for Concurrent Collectors
Abstract. This case study applies techniques of formal program development by specification refinement and composition to the problem of concurrent garbage collection. The speci...
Dusko Pavlovic, Peter Pepper, Douglas R. Smith
DLT
2009
13 years 7 months ago
Subshifts, Languages and Logic
We study the Monadic Second Order (MSO) Hierarchy over infinite pictures, that is tilings. We give a characterization of existential MSO in terms of tilings and projections of tili...
Emmanuel Jeandel, Guillaume Theyssier
ENTCS
2007
132views more  ENTCS 2007»
13 years 9 months ago
The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads
Lawvere theories and monads have been the two main category theoretic formulations of universal algebra, Lawvere theories arising in 1963 and the connection with monads being esta...
Martin Hyland, John Power
JSW
2006
82views more  JSW 2006»
13 years 9 months ago
Incremental Implementation of Syntax Driven Logics
Abstract-- This paper describes a technique combining higher order functions, algebraic datatypes, and monads to incrementally implement syntax driven logics. Extensions can be com...
Ignatius Sri Wishnu Brata Prasetya, A. Azurat, Tan...