Sciweavers

102 search results - page 4 / 21
» Type Systems for Optimizing Stack-based Code
Sort
View
POS
1994
Springer
14 years 19 days ago
Expressing Object Residency Optimizations Using Pointer Type Annotations
We consider some issues in optimizing persistent programming languages. In particular, we show how to express optimizations of object residency checks in strongly typed persistent...
J. Eliot B. Moss, Antony L. Hosking
LFP
1992
140views more  LFP 1992»
13 years 9 months ago
Global Tagging Optimization by Type Inference
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...
Fritz Henglein
ICFP
2005
ACM
14 years 8 months ago
Dynamic optimization for functional reactive programming using generalized algebraic data types
A limited form of dependent types, called Generalized Algebraic Data Types (GADTs), has recently been added to the list of Haskell extensions supported by the Glasgow Haskell Comp...
Henrik Nilsson
POPL
2012
ACM
12 years 4 months ago
The ins and outs of gradual type inference
Gradual typing lets programmers evolve their dynamically typed programs by gradually adding explicit type annotations, which confer benefits like improved performance and fewer r...
Aseem Rastogi, Avik Chaudhuri, Basil Hosmer
TCOM
2008
100views more  TCOM 2008»
13 years 8 months ago
On the performance of concatenated convolutional code and Alamouti space-time code with noisy channel estimates and finite-depth
Abstract--In this paper, performance of the Alamouti spacetime code (STC) [1] and performance of the concatenation between the convolutional code and the Alamouti STC are derived. ...
Jittra Jootar, James R. Zeidler, John G. Proakis