A preview of a tutorial on L (polarized μμ-tilde) - Archive ouverte HAL Access content directly
Conference Papers Year :

A preview of a tutorial on L (polarized μμ-tilde)

(1) , (2, 3) , (2, 3) , (3, 2) , (4)
1
2
3
4

Abstract

We are working on a new tutorial presentation of L, the polarized version of Curien-Herbelin’s μμ̃ -calculus. The calculus μμ̃ was introduced in Curien and Herbelin [2000] as a good term calculus for classical logic, which in particular reveals a perfect symmetry (in the classical setting) between call-by-value and call-by-name evaluation. Its polarized version, L, restricts the reduction rules according to a type- or polarity-based evaluation order; as Call-By-Push-Value [Levy 1999], it can express and mix both call-by-name and call-by-value terms in the same program, and is an interesting vehicle to study side-effects. We would like to offer a presentation of a fragment of our in-progress tutorial to the HOPE audience, as an act of popularization for newcomers, and as the best way to get feedback on our approach from newcomers and experts alike.
Not file

Dates and versions

hal-01992294 , version 1 (24-01-2019)

Identifiers

  • HAL Id : hal-01992294 , version 1

Cite

Kenji Maillard, Étienne Miquey, Xavier Montillet, Guillaume Munch-Maccagnoni, Gabriel Scherer. A preview of a tutorial on L (polarized μμ-tilde). HOPE 2018 - 7th ACM SIGPLAN Workshop on Higher-Order Programming with Effects, Sep 2018, St. Louis, United States. ⟨hal-01992294⟩
236 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More