Footnotes:

¹The suffixes .pcc, .pCpp etc. can also be used.

²Alternatively, inheritance may be used.

³for simplicity, we'll use a string representation for atoms instead of a more efficient method.

⁴For efficiency, bounds checking is not performed.

⁵Patterns are discussed in section 4.3.

⁶The implementation has only been tested on Linux, SunOS and Solaris. Please contact the author for details if you'd like to port the collector to your particular platform.

⁷ The current implementation of Prop translates inference into very naive code. This feature will be phased out and replaced by the more general and much faster graph rewriting mechanism.

⁸The variable e is assigned the new copy.

⁹Rewriting of a generic graph structure is not recommended with rewrite.

¹⁰ If an expression argument is not given to a cutrewrite statement, then the redex is left unchanged.

¹¹ To ensure termination of the optimization process, augmented rules will not be further specialized.

¹²The implementation may not be effective.

¹³However, this feature has not been fully tested.

¹⁴An alpha version also works under Solaris. Thanks to Paul Dietz for the patch.

¹⁵In Prop, a special keyword collectable is used to identify garbage collected classes and types. The Prop translator uses this type annotation to derive the appropriate tracing methods.

¹⁶This base class is also inherited from class Mem, so that it adheres to the Prop memory management protocol.