Moby Implementation Notes
(Version 0.9.18)

The Moby Project
moby.cs.uchicago.edu

Last revised: May 30, 2004

• Table of Contents
• An overview of the Moby implementation
  • The Moby compiler
  • The Moby run-time system
  • Roadmap
• Lexing and parsing
  • The lexer
  • The prelude parser
  • The Moby parser
• The typed abstract syntax tree
• Environments
  • The environments
  • Compilation environments
• The Moby typechecker
  • Checking Types
  • Sig and Module Checking
  • Signature Manipulation
• The BOL representation
  • BOL types
  • BOL terms
• Translation from typed AST to BOL
  • The translation environment
  • Translating types
  • Exception handling
  • Translating classes and objects
• Compiling Moby patterns
  • Pattern matching in Moby
  • Pettersson's algorithm
  • Extensions to the basic algorithm
  • Choosing the column
  • Related work
• Optimization of the BOL representation
  • Variable substitutions
  • Census
  • Denesting
  • Contraction
  • Cross-module inlining
  • Eta splitting
  • Useless varible elimination
  • Small constant copying
  • Cluster conversion
• Code generation
  • Calling conventions
  • Leaf-procedure optimization
  • Generating PC maps
• PC maps
  • The PC map representation
  • Generating the PC map
  • Interpreting the PC map
• The Moby run-time system
  • Run-time representations
  • Runtime system data structures
  • Garbage collection
  • Multithreading
• The Moby compilation environment
  • Groups and the filemap
  • MBI files
  • MBX files
• The code-generator generator
  • The specification language
  • Generating the rewriting rules
• The gen-mbi tool
  • Overview
  • Parsing
  • Translation
  • Output
• References

This document was translated from L^AT_EX by H^EV^EA and H^AC^HA.