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

Kenji Maillard 1 Étienne Miquey 2, 3 Xavier Montillet 2, 3 Guillaume Munch-Maccagnoni 3, 2 Gabriel Scherer 4
2 GALLINETTE - Gallinette : vers une nouvelle génération d'assistant à la preuve
Inria Rennes – Bretagne Atlantique , LS2N - Laboratoire des Sciences du Numérique de Nantes
4 PARSIFAL - Proof search and reasoning with logic specifications
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
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.
Liste complète des métadonnées

https://hal.inria.fr/hal-01992294
Contributor : Guillaume Munch-Maccagnoni <>
Submitted on : Thursday, January 24, 2019 - 1:09:48 PM
Last modification on : Wednesday, March 27, 2019 - 4:41:29 PM

Identifiers

  • HAL Id : hal-01992294, version 1

Citation

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⟩

Share

Metrics

Record views

125