Recursive Functions with Pattern Matching in Interaction Nets

  • Authors:
  • Maribel Fernández;Ian Mackie;Shinya Sato;Matthew Walker

  • Affiliations:
  • King's College London, Department of Computer Science, Strand, London WC2R 2LS, U.K. and LIX, École Polytechnique, 91128 Palaiseau Cedex, France and Faculty of Econoinformatics, Himeji Dokkyo ...;King's College London, Department of Computer Science, Strand, London WC2R 2LS, U.K. and LIX, École Polytechnique, 91128 Palaiseau Cedex, France and Faculty of Econoinformatics, Himeji Dokkyo ...;King's College London, Department of Computer Science, Strand, London WC2R 2LS, U.K. and LIX, École Polytechnique, 91128 Palaiseau Cedex, France and Faculty of Econoinformatics, Himeji Dokkyo ...;King's College London, Department of Computer Science, Strand, London WC2R 2LS, U.K. and LIX, École Polytechnique, 91128 Palaiseau Cedex, France and Faculty of Econoinformatics, Himeji Dokkyo ...

  • Venue:
  • Electronic Notes in Theoretical Computer Science (ENTCS)
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We compile functional languages with pattern-matching features into interaction nets, extending the well-known efficient evaluation strategies developed for the pure @l-calculus. We give direct translations of recursion and pattern matching for languages with a strict matching semantics, implementing an evaluation strategy that is natural in interaction nets and has a high degree of sharing.