Sciweavers

57 search results - page 2 / 12
» A monadic approach to polycategories
Sort
View
CSFW
2005
IEEE
15 years 5 months ago
Achieving Information Flow Security through Precise Control of Effects
This paper advocates a novel approach to the construction of secure software: controlling information flow and maintaining integrity via monadic encapsulation of effects. This ap...
William L. Harrison, James Hook
ICFP
2002
ACM
15 years 11 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
ICALP
2007
Springer
15 years 6 months ago
A Combinatorial Theorem for Trees
Following the idea developed by I. Simon in his theorem of Ramseyan factorisation forests, we develop a result of ‘deterministic factorisations’. This extra determinism propert...
Thomas Colcombet
ACS
2010
14 years 12 months ago
Lawvere Completion and Separation Via Closure
For a quantale V, first a closure-theoretic approach to completeness and separation in V-categories is presented. This approach is then generalized to T-categories, where T is a to...
Dirk Hofmann, Walter Tholen
ICFP
2001
ACM
15 years 11 months ago
A New Notation for Arrows
The categorical notion of monad, used by Moggi to structure denotational descriptions, has proved to be a powerful tool for structuring combinator libraries. Moreover, the monadic...
Ross Paterson