Sciweavers

988 search results - page 129 / 198
» The Frontiers of Data Programmability
Sort
View
WEBDB
1998
Springer
83views Database» more  WEBDB 1998»
15 years 5 months ago
On the Unification of Persistent Programming and the World Wide Web
In its infancy, the World-Wide Web consisted of a web of largely static hypertext documents. As time progresses it is evolving into a domain which supports almost arbitrary network...
Richard C. H. Connor, Keith Sibson, Paolo Manghi
111
Voted
ASPLOS
1992
ACM
15 years 4 months ago
Access Normalization: Loop Restructuring for NUMA Compilers
: In scalable parallel machines, processors can make local memory accesses much faster than they can make remote memory accesses. In addition, when a number of remote accesses must...
Wei Li, Keshav Pingali
SWAT
1992
Springer
101views Algorithms» more  SWAT 1992»
15 years 4 months ago
Parallel Algorithms for Priority Queue Operations
This paper presents parallel algorithms for priority queue operations on a p-processor EREWPRAM. The algorithms are based on a new data structure, the Min-path Heap (MH), which is...
Maria Cristina Pinotti, Geppino Pucci
103
Voted
OOPSLA
1989
Springer
15 years 4 months ago
Static Type Inference for Parametric Classes
Method inheritance and data abstraction are central features of objectoriented programming that are attained through a hierarchical organization of classes. Recent studies have sh...
Atsushi Ohori, Peter Buneman
HASKELL
2007
ACM
15 years 4 months ago
Why it's nice to be quoted: quasiquoting for haskell
Quasiquoting allows programmers to use domain specific syntax to construct program fragments. By providing concrete syntax for complex data types, programs become easier to read, ...
Geoffrey Mainland