SRC Research Report 1

A Kernel Language for Modules and Abstract Data Types.

R. Burstall and B. Lampson.

A small set of constructs can simulate a wide variety of apparently distinct features in modern programming languages. Using a kernel language called Pebble based on the typed lambda calculus with bindings, declarations, and types as first-class values, we show how to build modules, interfaces and implementations, abstract data types, generic types, recursive types, and unions. Pebble has a concise operational semantics given by inference rules.

Back to the SRC Research Reports main page.

• PostScript compressed with UNIX compress -- 2664 Kbytes
  
• PostScript compressed with GNU compress (gzip) -- 2264 Kbytes
  
• PostScript compressed with ZIP -- 2264 Kbytes
  
• PostScript -- 2840 Kbytes
  
• Portable Document Format (PDF) -- 2192 Kbytes