Sciweavers

608 search results - page 9 / 122
» The Expressive Power of Simple Parallelism
Sort
View
TPHOL
1992
IEEE
15 years 1 months ago
The HOL Logic Extended with Quantification over Type Variables
The HOL system is an LCF-style mechanized proof-assistant for conducting proofs in higher order logic. This paper discusses a proposal to extend the primitive basis of the logic un...
Thomas F. Melham
FORTE
1992
14 years 10 months ago
A constraint-oriented real-time process calculus
A real-time extension of ccs is described, based on true concurrency semantics and a determination to make composition the sole arbiter of real-time behaviour. The resultant calcu...
Colin J. Fidge
99
Voted
HASKELL
2007
ACM
15 years 1 months ago
Comprehensive comprehensions
We propose an extension to list comprehensions that makes it easy to express the kind of queries one would write in SQL using ORDER BY, GROUP BY, and LIMIT. Our extension adds exp...
Simon L. Peyton Jones, Philip Wadler
HPCA
2004
IEEE
15 years 10 months ago
Exploiting Prediction to Reduce Power on Buses
We investigate coding techniques to reduce the energy consumed by on-chip buses in a microprocessor. We explore several simple coding schemes and simulate them using a modified Si...
Victor Wen, Mark Whitney, Yatish Patel, John Kubia...
RTA
2000
Springer
15 years 1 months ago
Parallelism Constraints
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
Katrin Erk, Joachim Niehren