You have Guest access.
Log In
Xavier Leroy and Atsushi Ohori
Front matter
1-8
Introduction
9-27
Compiling Java to a typed lambda-calculus: A preliminary report
28-52
Stack-based Typed Assembly Language
53-77
How generic is a generic back end? using MLRISC as a back end for the TIL compiler Preliminary Report
78-96
A toolkit for constructing type- and constraint-based program analyses
97-115
Optimizing ML using a hierarchy of monadic types
116-135
Type-directed continuation allocation
136-155
Polymorphic equality — No tags required
156-177
Optimal type lifting
178-193
Formalizing resource allocation in a compiler
194-214
An approach to improve locality using sandwich types
215-239
Garbage collection via dynamic type inference - A formal treatment -
240-252
Strong normalization by type-directed partial evaluation and run-time code generation
253-271
Determination of dynamic method dispatches using run-time code generation
272
Type-based analysis of concurrent programs
273-297
A type-based semantics for user-defined marshalling in polymorphic languages
Xavier Leroy
Andrew Wright, Suresh Jagannathan, Cristian Ungureanu and Aaron Hertzmann
Greg Morrisett, Karl Crary, Neal Glew and David Walker
Andrew Bernard, Robert Harper and Peter Lee
Alexander Aiken, Manuel Fähndrich, Jeffrey S. Foster and Zhendong Su
Andrew Tolmach
Zhong Shao and Valery Trifonov
Martin Elsman
Bratin Saha and Zhong Shao
Peter Thiemann
Daniela Genius, Martin Trapp and Wolf Zimmermann
Haruo Hosoya and Akinori Yonezawa
Vincent Balat and Olivier Danvy
Nobuhisa Fujinami
Naoki Kobayashi
Dominic Duggan
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info