Sciweavers

2944 search results - page 215 / 589
» On Well Quasi-orders on Languages
Sort
View
ASPLOS
2009
ACM
16 years 7 months ago
Early experience with a commercial hardware transactional memory implementation
We report on our experience with the hardware transactional memory (HTM) feature of two pre-production revisions of a new commercial multicore processor. Our experience includes a...
David Dice, Yossi Lev, Mark Moir, Daniel Nussbaum
ASPLOS
2009
ACM
16 years 7 months ago
3D finite difference computation on GPUs using CUDA
In this paper we describe a GPU parallelization of the 3D finite difference computation using CUDA. Data access redundancy is used as the metric to determine the optimal implement...
Paulius Micikevicius
EACL
2009
ACL Anthology
16 years 7 months ago
Evaluating the Inferential Utility of Lexical-Semantic Resources
Lexical-semantic resources are used extensively for applied semantic inference, yet a clear quantitative picture of their current utility and limitations is largely missing. We pr...
Shachar Mirkin, Ido Dagan, Eyal Shnarch
ICFP
2003
ACM
16 years 6 months ago
An effective theory of type refinements
We develop an explicit two level system that allows programmers to reason about the behavior of effectful programs. The first level is an ordinary ML-style type system, which conf...
Yitzhak Mandelbaum, David Walker, Robert Harper
ICFP
2003
ACM
16 years 6 months ago
Mechanising Hankin and Barendregt using the Gordon-Melham axioms
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
Michael Norrish