Sciweavers

163 search results - page 5 / 33
» Type Systems for Useless-Variable Elimination
Sort
View
ICFP
1999
ACM
14 years 23 days ago
Type Inference with Rank 1 Polymorphism for Type-Directed Compilation of ML
This paper defines an extended polymorphic type system for an ML-style programming language, and develops a sound and complete type inference algorithm. Different from the conve...
Atsushi Ohori, Nobuaki Yoshida
ICFP
2001
ACM
14 years 8 months ago
A Dependently Typed Assembly Language
We present a dependently typed assembly language (DTAL) in which the type system supports the use of a restricted form of dependent types, reaping some benefits of dependent types...
Hongwei Xi, Robert Harper
PLDI
2011
ACM
12 years 11 months ago
EnerJ: approximate data types for safe and general low-power computation
Energy is increasingly a first-order concern in computer systems. Exploiting energy-accuracy trade-offs is an attractive choice in applications that can tolerate inaccuracies. Re...
Adrian Sampson, Werner Dietl, Emily Fortuna, Danus...
VLDB
2007
ACM
118views Database» more  VLDB 2007»
14 years 8 months ago
Eliminating Impedance Mismatch in C++
Recently, the C# and the VISUAL BASIC communities were tantalized by the advent of LINQ [18]--the Language INtegrated Query technology from Microsoft. LINQ represents a set of lan...
Joseph Gil, Keren Lenz
DLS
2009
150views Languages» more  DLS 2009»
13 years 6 months ago
Fast type reconstruction for dynamically typed programming languages
Type inference and type reconstruction derive static types for program elements that have no static type associated with them. They have a wide range of usage, such as helping to ...
Frédéric Pluquet, Antoine Marot, Roe...