815 search results - page 77 / 163 » Algebraic Recognizability of Languages |
164
click to vote
ICDT
2010
ACM
16 years 3 months ago
2010
ACM
We study fundamental aspects related to the efficient processing of the SPARQL query language for RDF, proposed by the W3C to encode machine-readable information in the Semantic W...
191
click to vote
CN
1999
15 years 5 months ago
1999
Recently, the ITU-standardised specification language Message Sequence Chart has been extended with constructs for more complete and structured specifications. The new version of ...
184
click to vote
ECOOP
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. Generic types in C behave invariantly with respect to subtyping. We propose a system of type-safe variance for C that supports the declaration of covariant and contravari...
222
click to vote
CALCO
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. We investigate the phenomenon that every monad is a linear state monad. We do this by studying a fully-complete state-passing translation from an impure call-by-value lan...
149
click to vote
FLOPS
2004
Springer
15 years 11 months ago
2004
Springer
Restricting polymorphism to values is now the standard way to obtain soundness in ML-like programming languages with imperative features. While this solution has undeniable advant...