Several recent studies have introduced lightweight versions of Java: reduced languages in
which complex features like threads and reflection are dropped to enable rigorous …

We motivate the design of typed assembly language (TAL) and present a type-preserving
ttranslation from Systemn F to TAL. The typed assembly language we pressent is based on a …

Milner, Parrow, and Walker's π-calculus [MPW92, Mil91] generalizes the channel-based
communication of CCS and its relatives by allowing channels to be passed as data along …

Several recent studies have introduced lightweight versions of Java: reduced languages in
which complex features like threads and reflection are dropped to enable rigorous …

Recent years have seen the development of several foundational models for statically typed
object-oriented programming. But despite their intuitive similarity, differences in the technical …

A new theory of concurrent objects is presented. The theory has the important advantage of
being based directly on a simple logic called rewriting logic in which concurrent object …

F≤ is a typed λ-calculus with subty** and bounded second-order polymorphism. First
proposed by Cardelli and Wegner, it has been widely studied as a core calculus for type …

StmngtalPM is a typechecker for a downwanlcompatible Smalltalk dialect. It is designed for
large-scale production software development, and incorpomtes a strong, modern structuml …

Giving types to binary methods causes significant problems for object‐oriented language
designers and programmers. This paper offers a comprehensive description of the problems …

Language prototy** provides a means to generate language implementations
automatically from high-level language definitions. This volume presents an algebraic …