Sciweavers

1154 search results - page 9 / 231
» Implementing Typed Intermediate Languages
Sort
View
PADL
2007
Springer
14 years 1 months ago
Rewriting Haskell Strings
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...
Duncan Coutts, Don Stewart, Roman Leshchinskiy
TLDI
2003
ACM
108views Formal Methods» more  TLDI 2003»
14 years 24 days ago
Inferring annotated types for inter-procedural register allocation with constructor flattening
We introduce an annotated type system for a compiler intermediate language. The type system is designed to support inter-procedural register allocation and the representation of t...
Torben Amtoft, Robert Muller
APLAS
2004
ACM
13 years 11 months ago
McJava - A Design and Implementation of Java with Mixin-Types
A programming construct mixin was invented to implement uniform extensions and modifications to classes. Although mixin-based programming has been extensively studied both on the m...
Tetsuo Kamina, Tetsuo Tamai
POPL
2010
ACM
14 years 5 months ago
Integrating Typed and Untyped Code in a Scripting Language
Many large software systems originate from untyped scripting language code. While good for initial development, the lack of static type annotations can impact code-quality and per...
Francesco Zappa Nardelli, Jan Vitek, Johan Ös...
POPL
2008
ACM
14 years 7 months ago
The design and implementation of typed scheme
When scripts in untyped languages grow into large programs, maintaining them becomes difficult. A lack of types in typical scripting languages means that programmers must (re)disc...
Sam Tobin-Hochstadt, Matthias Felleisen