655 search results - page 39 / 131 » On Flat Programs with Lists |
PADL
2007
Springer
14 years 1 months ago
2007
Springer
Abstract The Haskell String type is notoriously inefficient. We introduce a new data type, ByteString, based on lazy lists of byte arrays, combining the speed benefits of strict a...
ESOP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We present a type system for a compile-time analysis of heapspace requirements of Java style object-oriented programs with explicit deallocation. Our system is based on a...
IFIP
2009
Springer
13 years 5 months ago
2009
Springer
We present a platform that allows a protocol researcher to specify the sequence of games from an initial protocol to a protocol where the security property under consideration can ...
ICASSP
2008
IEEE
14 years 2 months ago
2008
IEEE
We develop a computationally efficient and memory efficient approach to (near) maximum a posteriori probability demodulation for MIMO systems with QPSK signalling, based on semi...
PARELEC
2000
IEEE
14 years 2 days ago
2000
IEEE
The purpose of this paper consists of demonstrating an implementation methodology of sequential and distributed simulations using Java programming: two specific algorithms based o...