A parallel implementation for optimal lambda-calculus reduction


In this paper we present a parallel implementation of L evy's optimal reduction for the -calculus [11]. In a similar approach to Lamping's one in [10], we base our work on a graph reduction technique known as directed virtual reduction [3] which is actually a restriction of Danos-Regnier virtual reduction [4]. The parallel implementation relies on a… (More)
DOI: 10.1145/351268.351270

14 Figures and Tables


  • Presentations referencing similar topics