In modern Scheme, a macro captures the lexical environment where it is defined. This
creates an opportunity for extending Scheme so that macros are first-class values. The key …

This paper defines a set of type inference rules for resolving over-loading introduced by type
classes. Programs including type classes are transformed into ones which may be typed by …

Types have become ubiquitous in computer science. Because the advantages of typed
programming languages are so obvious, most computer scientists assume that mathematics …

Abstract Types express properties of programs; typechecking is specification checking.
However, the specifications expressed by types in conventional type systems are imprecise …

Based on a useful concept of type-ordering that implicity or explicitly underlies the type of
certain programming languages, it is shown that the type" boolean" can be viewed as a …

Polymorphic type schemes and recursive definitions Page 1 Polymorphic Type Schemes and
Recursive Definitions Alan Mycroft Programming Methodology Group Institutionen f~r …

Modules provide a grouping mechanism in modern programming languages that provide
both syntactic and semantic support for constructing modular programs. Existing languages …

The Scheme of Things Page 1 The Scheme of Things Jonathan Rees (guest columnist)
Computer Science Robotics and Vision Laboratory Cornell University Ithaca, NY 14853 j argos …

Programming language designers have invented a number of features to support the writing
of large programs in a modular way which takes advantage of type-checking. As languages …