Path semantics

Abstract

Knowledge of order of evaluation of expressions is useful for compile-time optimizations for lazy sequential functional programs. We present path semantics, a non-standard semantics that describes order of evaluation for a first-order functional language with lazy evaluation. We also provide an effective abstraction of path semantics that provides compile-time information. We show how path semantics may be used in strictness analysis, process scheduling in parallel systems, and optimized self-modifying thunks.