HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Interaction systems II : the practice of optimal reductions

Abstract : Lamping's optimal graph reduction technique for the l-calculus is generalized to a new class of higher order rewriting systems, called interaction systems. Interaction systems provide a nice integration of the functional paradigm with a rich class of data structures (all inductive types) and some basic control flow constructs such as conditionals and (primitive or general) recursion. We describe a uniform and optimal implementation in Lamping's style, for all these features. The paper is natural continuation where we focused on the theoretical aspects of optimal reductions in interaction systems (family relation, labeling, extraction, ...).
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 4:03:35 PM
Last modification on : Friday, February 4, 2022 - 3:21:50 AM
Long-term archiving on: : Tuesday, April 12, 2011 - 3:58:27 PM


  • HAL Id : inria-00074671, version 1



Andrea Asperti, Cosimo Laneve. Interaction systems II : the practice of optimal reductions. [Research Report] RR-2001, INRIA. 1993. ⟨inria-00074671⟩



Record views


Files downloads