: Convergent term rewriting systems can be used for program transformation.
: Modular first-order specifications of operational semantics.
: Strictness detection in non-flat domains.
: Strictness computation using special lambda-expressions.
: The structure of a self-applicable partial evaluator.
: Listlessness is better than laziness II: composing listless functions.
: From interpreter to compiler: a representational derivation.