Sciweavers

174 search results - page 11 / 35
» Efficient Intensional Implementation for Lazy Functional Lan...
Sort
View
PEPM
2010
ACM
14 years 4 months ago
Optimizing relational algebra operations using generic equivalence discriminators and lazy products
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
Fritz Henglein
POPL
2008
ACM
14 years 8 months ago
Semantics of transactional memory and automatic mutual exclusion
Software Transactional Memory (STM) is an attractive basis for the development of language features for concurrent programming. However, the semantics of these features can be del...
Andrew Birrell, Martín Abadi, Michael Isard...
ICFP
1999
ACM
14 years 22 hour ago
Type Dispatch for Named Hierarchical Types
Type dispatch constructs are an important feature of many programming languages. Scheme has predicates for testing the runtime type of a value. Java has a class cast expression an...
Neal Glew
HICSS
2002
IEEE
150views Biometrics» more  HICSS 2002»
14 years 20 days ago
AUI: A Programming Language for Developing Plastic Interactive Software
With the proliferation of consumer computing devices with varied display and input characteristics, it has become desirable to develop interactive systems that are usable across m...
Kevin A. Schneider, James R. Cordy
ML
2008
ACM
13 years 7 months ago
Unrestricted pure call-by-value recursion
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...
Johan Nordlander, Magnus Carlsson, Andy Gill