Sciweavers

180 search results - page 16 / 36
» Program transformation for numerical precision
Sort
View
PPDP
2010
Springer
13 years 6 months ago
Graph queries through datalog optimizations
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
K. Tuncay Tekle, Michael Gorbovitski, Yanhong A. L...
HASKELL
2009
ACM
14 years 2 months ago
Finding the needle: stack traces for GHC
Even Haskell programs can occasionally go wrong. Programs calling head on an empty list, and incomplete patterns in function definitions can cause program crashes, reporting littl...
Tristan O. R. Allwood, Simon Peyton Jones, Susan E...
IFL
2004
Springer
138views Formal Methods» more  IFL 2004»
14 years 29 days ago
A Rational Deconstruction of Landin's SECD Machine
Landin’s SECD machine was the first abstract machine for the λ-calculus viewed as a programming language. Both theoretically as a model of computation and practically as an ide...
Olivier Danvy
ICLP
1997
Springer
13 years 11 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
CEC
2008
IEEE
14 years 2 months ago
A fast high quality pseudo random number generator for graphics processing units
—Limited numerical precision of nVidia GeForce 8800 GTX and other GPUs requires careful implementation of PRNGs. The Park-Miller PRNG is programmed using G80’s native Value4f ...
William B. Langdon