Types in compilation : Second International Workshop, TIC 98 Kyoto, Japan, March 25 27, 1998 : proceedings
This book constitutes the thoroughly refereed post-workshop proceedings of the Second International Workshop on Types in Compilation, TIC '98, held in Kyoto, Japan in March 1998. The book presents 13 revised full papers carefully selected during an iterated reviewing process together with three...
Na minha lista:
| Autor Corporativo: | |
|---|---|
| Outros Autores: | , |
| Formato: | Livre numérique |
| Idioma: | Anglais |
| Publicado em: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Colecção: | Lecture notes in computer science
1473 |
| Assuntos: | |
| Acesso em linha: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Types in compilation, Second International Workshop, TIC'98, Kyoto, Japan, March 1998, proceedings, Xavier Leroy, Atsushi Ohori (eds), 1998, New York, Springer, 1 vol. (VIII-297 p.), Lecture notes in computer science, 3-540-64925-5 • Types in Compilation, Texte imprimé, 9783662170991 |
Sumário:
- Compiling Java to a typed lambda-calculus: A preliminary report
- Stack-based Typed Assembly Language
- How generic is a generic back end? using MLRISC as a back end for the TIL compiler
- A toolkit for constructing type- and constraint-based program analyses
- Optimizing ML using a hierarchy of monadic types
- Type-directed continuation allocation
- Polymorphic equality No tags required
- Optimal type lifting
- Formalizing resource allocation in a compiler
- An approach to improve locality using sandwich types
- Garbage collection via dynamic type inference - A formal treatment -
- Strong normalization by type-directed partial evaluation and run-time code generation
- Determination of dynamic method dispatches using run-time code generation
- Type-based analysis of concurrent programs
- A type-based semantics for user-defined marshalling in polymorphic languages.