4211 search results - page 339 / 843 » Types as Abstract Interpretations |
162
click to vote
ECEASST
2010
15 years 4 months ago
2010
d Abstract) Detlef Plump Abstract. In general, it is undecidable whether a terminating graphtransformation system is confluent or not. We introduce the class of coverable hypergrap...
178
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
Existing languages provide good support for typeful programming of standalone programs. In a distributed system, however, there may be interaction between multiple instances of ma...
199
click to vote
SIGECOM
2008
ACM
15 years 6 months ago
2008
ACM
We study the question of how to easily recognize whether a social unction f from an abstract type space to a set of outcomes is truthful, i.e. implementable by a truthful mechanis...
267
click to vote
TLDI
2010
ACM
16 years 3 months ago
2010
ACM
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
209
click to vote
EFDBS
2003
15 years 8 months ago
2003
A definition of types in an information system is given from ld abstractions through data constructs, schema and definitions to physical data values. Category theory suggests tha...