Sciweavers

1154 search results - page 8 / 231
» Implementing Typed Intermediate Languages
Sort
View
HASKELL
2009
ACM
15 years 4 months ago
Types are calling conventions
It is common for compilers to derive the calling convention of a function from its type. Doing so is simple and modular but misses many optimisation opportunities, particularly in...
Maximilian C. Bolingbroke, Simon L. Peyton Jones
76
Voted
HICSS
2003
IEEE
132views Biometrics» more  HICSS 2003»
15 years 3 months ago
Experience with ANSI C Markup Language for a Cross-Referencer
The purpose of this paper is twofold: (1) to examine the properties of our ANSI C Markup Language (ACML) as a domain-specific language (DSL); and (2) to show that ACML is useful ...
Hayato Kawashima, Katsuhiko Gondow
JFP
2002
108views more  JFP 2002»
14 years 9 months ago
A calculus with polymorphic and polyvariant flow types
We present CIL , a typed -calculus which serves as the foundation for a typed intermediate language for optimizing compilers for higher-order polymorphic programming languages. Th...
J. B. Wells, Allyn Dimock, Robert Muller, Franklyn...
54
Voted
APLAS
2004
ACM
15 years 3 months ago
An Implementation of Subtyping Among Regular Expression Types
Kenny Zhuo Ming Lu, Martin Sulzmann
ESOP
2006
Springer
15 years 1 months ago
Haskell Is Not Not ML
We present a typed calculus IL ("intermediate language") which supports the embedding of ML-like (strict, eager) and Haskell-like (non-strict, lazy) languages, without fa...
Ben Rudiak-Gould, Alan Mycroft, Simon L. Peyton Jo...