2436 search results - page 36 / 488 » Comonadic Notions of Computation |
TLCA
1993
Springer
14 years 1 months ago
1993
Springer
This paper describes a method of proving strong normalization based on an extension of the conservation theorem. We introduce a structural notion of reduction that we call βS, and...
CIE
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Effective domain theory is applied to fuzzy logic to give suitable notions of semi-decidable and decidable L-subset. The connection with the notions of fuzzy Turing machi...
CONCUR
2009
Springer
14 years 1 months ago
2009
Springer
We define an extension of forest algebra for -forests. We show how the standard algebraic notions (free object, syntactic algebra, morphisms, etc.) extend to the infinite case. To ...
PODC
2010
ACM
13 years 11 months ago
2010
ACM
We present a single-version STM that satisfies a practical notion of permissiveness: it never aborts read-only transactions, and it only aborts an update transaction due to anothe...
SIAMDM
2010
13 years 8 months ago
2010
We introduce notions of linear reduction and linear equivalence of bijections for the purposes of study bijections between Young tableaux. Originating in Theoretical Computer Scie...