478 search results - page 11 / 96 » Monads of Regular Theories |
101
click to vote
JCT
2006
14 years 10 months ago
2006
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
113
click to vote
CALCO
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. Monads are a well-established tool for modelling various computational effects. They form the semantic basis of Moggi’s computational metalanguage, the metalanguage of ...
172
click to vote
POPL
2009
ACM
15 years 11 months ago
2009
ACM
We develop a model of concurrent imperative programming with threads. We focus on a small imperative language with cooperative threads which execute without interruption until the...
ENTCS
2002
14 years 10 months ago
2002
We study the partial algebra of typed terms with an associative commutative and idempotent operator (typed AC-terms). The originality lies in the representation of the typing poli...
105
click to vote
CSL
2000
Springer
15 years 3 months ago
2000
Springer
We introduce basic concepts from object-oriented programming into dependent type theory based on the idea of modelling objects as interactive programs. We consider methods, interf...