Evaluation and convergence in the computational calculus - Université Paris Cité Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

Evaluation and convergence in the computational calculus

Résumé

In Moggi's computational calculus, reduction is the contextual closure of the rules obtained by orienting three monadic laws. In the literature, evaluation is usually defined as the closure under weak contexts (no reduction under binders): E = | let x := E in M. We show that, when considering all the monadic rules, weak reduction is non-deterministic, non-confluent, and normal forms are not unique. However, when interested in returning a value (convergence), the only necessary monadic rule is β , whose evaluation is deterministic.
Fichier principal
Vignette du fichier
TLLA_2021_paper_6.pdf (186.88 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

lirmm-03271490 , version 1 (25-06-2021)

Licence

Paternité - Pas d'utilisation commerciale

Identifiants

  • HAL Id : lirmm-03271490 , version 1

Citer

Claudia Faggian, Giulio Guerrieri, Riccardo Treglia. Evaluation and convergence in the computational calculus. TLLA 2021 - 5th International Workshop on Trends in Linear Logic and Applications, Jun 2021, Rome (virtual), Italy. ⟨lirmm-03271490⟩
70 Consultations
34 Téléchargements

Partager

Gmail Facebook X LinkedIn More