Sciweavers

119 search results - page 5 / 24
» Foundations for structured programming with GADTs
Sort
View
COMPGEOM
2003
ACM
14 years 27 days ago
Cache-oblivious data structures for orthogonal range searching
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan...
SYNTHESE
2011
239views more  SYNTHESE 2011»
13 years 2 months ago
Carnap on theoretical terms: structuralism without metaphysics
: Both realists and instrumentalists have found it difficult to understand (much less accept) Carnap’s developed view on theoretical terms, which attempts to stake out a neutral ...
Michael Friedman
PASTE
1998
ACM
13 years 12 months ago
Concept Analysis - A New Framework for Program Understanding
Concept analysis transforms any relation between ‘lobjects” and “attributes” into a complete lattice. This concept lattice can be studied by algebraic means and offers rem...
Gregor Snelting
PPSC
2001
13 years 9 months ago
A Mathematical Cache Miss Analysis for Pointer Data Structures
As the gap between processor and memory performance widens, careful analyses and optimizations of cache memory behavior become increasingly important. While analysis of regular lo...
Hongli Zhang, Margaret Martonosi
POPL
1996
ACM
13 years 11 months ago
Using Parameterized Signatures to Express Modular Structure
Module systems are a powerful, practical tool for managing the complexity of large software systems. Previous attempts to formulate a type-theoretic foundation for modular program...
Mark P. Jones