478 search results - page 11 / 96 » Monads of Regular Theories |
120
Voted
JCT
2006
15 years 9 days 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...
131
Voted
CALCO
2009
Springer
15 years 7 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 ...
191
Voted
POPL
2009
ACM
16 years 1 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...
87
Voted
ENTCS
2002
15 years 4 days 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...
121
click to vote
CSL
2000
Springer
15 years 4 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...