815 search results - page 88 / 163 » Algebraic Recognizability of Languages |
151
click to vote
ICFP
2006
ACM
16 years 6 months ago
2006
ACM
Generic Haskell is a language extension of Haskell for polytypic programming. Constrained types are parametric algebraic types with at least one argument constrained by type-class...
160
click to vote
POPL
2012
ACM
14 years 1 months ago
2012
ACM
Software-defined networks (SDNs) are a new implementation architecture in which a controller machine manages a distributed collection of switches, by instructing them to install ...
166
click to vote
IFIP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract This paper introduces new-HOPLA, a concise but powerful language for higherorder nondeterministic processes with name generation. Its origins as a metalanguage for domain ...
226
click to vote
SDB
1995
15 years 9 months ago
1995
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...
178
click to vote
CADE
2004
Springer
16 years 6 months ago
2004
Springer
Formal semantic definitions of concurrent languages, when specified in a well-suited semantic framework and supported by generic and efficient formal tools, can be the basis of pow...