7988 search results - page 1177 / 1598 » A Useful Undecidable Theory |
183
click to vote
ICCAD
2004
IEEE
16 years 3 months ago
2004
IEEE
Closed formed expressions for buffered interconnect delay approximation have been around for some time. However, previous approaches assume that buffers are free to be placed anyw...
189
click to vote
TLDI
2010
ACM
16 years 3 months ago
2010
ACM
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...
212
click to vote
TLDI
2009
ACM
16 years 3 months ago
2009
ACM
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
197
click to vote
PEPM
2010
ACM
16 years 3 months ago
2010
ACM
Adapting a strictness analyser to have it take into account explicit strictness annotations can be a tricky business. Straightforward extensions of analyses based on relevance typ...
193
click to vote
IUI
2009
ACM
16 years 3 months ago
2009
ACM
In this study, we argue that modality planning in multimodal presentation systems needs to consider the modality characteristics at not only the presentational level but also the ...