Formalisation of Nominal Equational Reasoning - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Formalisation of Nominal Equational Reasoning

Résumé

In contrast to other methods to bind variables, the nominal approach uses atoms and the algebra of atom permutations bringing enlightening implications. This talk will discuss the lessons learned from our experience towards formalising nominal matching and nominal unification modulo C and AC using the proof assistant PVS (Prototype Verification System). Furthermore, the talk will dissect exciting issues that appear during the formalisation of nominal equational reasoning giving rise to surprises regarding the well-known properties of first-order unification and unification modulo C and AC.
Fichier principal
Vignette du fichier
UNIF_2023_Ayala.pdf (371.71 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Licence : CC BY - Paternité

Dates et versions

hal-04137801 , version 1 (22-06-2023)

Licence

Paternité

Identifiants

  • HAL Id : hal-04137801 , version 1

Citer

Mauricio Ayala-Rincón. Formalisation of Nominal Equational Reasoning. UNIF 2023 - 37th International Workshop on Unification, Veena Ravishankar; Christophe Ringeissen, Jul 2023, Rome, Italy. ⟨hal-04137801⟩

Collections

UNIF2023
37 Consultations
9 Téléchargements

Partager

Gmail Facebook X LinkedIn More