Skip to main content
Article thumbnail
Location of Repository

References

By Mr (m: B (n, Mauricio (br-brsl) De Moura, Flávio L. C. (br-brsl, Fairouz D. (-hwat-smc, Z. -el-a. Benaissa, D. Briaud, P. Lescanne and J. Rouyer-degli

Abstract

Comparing and implementing calculi of explicit substitutions with eta-reduction. (English summary) Ann. Pure Appl. Logic 134 (2005), no. 1, 5–41. This is a nice paper on rewrite rules for eta-reduction in explicit substitution calculi. The main contributions are: (1) an extension of the suspension calculus with eta rule: this extension is proved to be confluent and strongly normalizing; (2) a comparison of the adequacy of the reduction process in the λσ, λs and suspension calculi extended with eta-reduction; (3) an implementation of the eta rule for the above calculi which does not mix eta-reduction with the other rules. This implementation is shown to effectively simulate eta-reduction of pure lambda terms

Topics: strategies using explicit substitution, in, Programming Languages, Implementations, Logics
Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.4594
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.