290 search results - page 38 / 58 » A Denotational Semantics for Handel-C |
CAV
1999
Springer
15 years 4 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
103
click to vote
PSSS
2003
15 years 1 months ago
2003
: RDF-based tools promise to provide a base for reasoning about metadata and about situated data—data describing entities situated in time and space—that is superior to alterna...
ICFP
2005
ACM
15 years 11 months ago
2005
ACM
Current languages allow a programmer to describe an interface only by enumerating its parts, possibly including other interfaces wholesale. Such languages cannot express relations...
CSL
2004
Springer
15 years 5 months ago
2004
Springer
Subtyping rules can be fairly complex for union types, due to interactions with other types, such as function types. Furthermore, these interactions turn out to depend on the calc...
103
click to vote
SFP
2001
15 years 1 months ago
2001
: We study type checking that is complete in the sense that it accepts every program whose subexpressions can all be executed without raising a type error at runtime. In a complete...