Encoding Strategies in the Lambda Calculus with Interaction Nets

Abstract : Interaction nets are a graphical paradigm of computation based on graph rewriting. They have proven to be both useful and enlightening in the encoding of linear logic and the λ-calculus. This paper offers new techniques for the theory of interaction nets, with applications to the encoding of specific strategies in the λ-calculus. In particular we show how to recover the usual call-by-value and call-by-name reduction strategies from general encodings.
Type de document :
Communication dans un congrès
Andrew Butterfield and Clemens Gelck and Franck Huck. Implementation and Application of Functional Languages, 17th International Workshop, IFL 2005, Dublin, Ireland, September 19-21, Sep 2005, Dublin, Ireland, Springer-Verlag, 4015, pp.19--36, 2005, Lecture Notes in Computer Science. 〈10.1007/11964681_2〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00133323
Contributeur : Ian Mackie <>
Soumis le : dimanche 25 février 2007 - 17:04:54
Dernière modification le : jeudi 10 mai 2018 - 02:07:00

Identifiants

Collections

Citation

Ian Mackie. Encoding Strategies in the Lambda Calculus with Interaction Nets. Andrew Butterfield and Clemens Gelck and Franck Huck. Implementation and Application of Functional Languages, 17th International Workshop, IFL 2005, Dublin, Ireland, September 19-21, Sep 2005, Dublin, Ireland, Springer-Verlag, 4015, pp.19--36, 2005, Lecture Notes in Computer Science. 〈10.1007/11964681_2〉. 〈inria-00133323〉

Partager

Métriques

Consultations de la notice

835