Skip to main content
    • Aa
    • Aa

Call-by-name extensionality and confluence


Designing rewriting systems that respect functional extensionality for call-by-name languages with effects turns out to be surprisingly challenging. Simply interpreting extensional laws like η as reduction rules easily breaks confluence. We explore these issues in the setting of a sequent calculus. Building on an insight that appears in different aspects of the theory of call-by-name functional languages—confluent rewriting for two independent control calculi and sound continuation-passing style transformations—we give a confluent reduction system for lazy extensional functions. Finally, we consider limitations to this approach when used for strict evaluation and types beyond functions.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

K.-etsu Fujita (2003) A sound and complete CPS-translation for λμ-calculus. In Typed Lambda Calculi and Applications. M. Hofmann (ed), LNCS, vol. 2701. Berlin Heidelberg: Springer, pp. 120134.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Journal of Functional Programming
  • ISSN: 0956-7968
  • EISSN: 1469-7653
  • URL: /core/journals/journal-of-functional-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 8 *
Loading metrics...

Abstract views

Total abstract views: 67 *
Loading metrics...

* Views captured on Cambridge Core between 27th February 2017 - 29th March 2017. This data will be updated every 24 hours.