Covariant Subtyping Applied to Semantic Predicate Calculi - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

Covariant Subtyping Applied to Semantic Predicate Calculi

William Babonnaud

Résumé

Manipulating type hierarchies in formal semantic frameworks is often performed through a subtyping relation which obeys the contravariant rule for the left argument of a function type, due to the traditional representation of predicates as functions. This approach has however serious drawbacks when handling modifiers for first-order predicates. The present paper adopts an opposite view on subtyping by introducing a predicate calculus with a covariant behaviour, endowed with a categorical semantics in which subtyping coercions behave as generalisations of injective functions, and predicates are assimilated to powerobjects. This calculus is type safe in the sense that it prevents unwanted term applications, and is shown to provide a solution for the difficulties faced by a contravariant subtyping.
Fichier principal
Vignette du fichier
main.pdf (516.72 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03542057 , version 1 (07-02-2022)

Identifiants

  • HAL Id : hal-03542057 , version 1

Citer

William Babonnaud. Covariant Subtyping Applied to Semantic Predicate Calculi. LACL 2021 - Logical Aspects of Computational Linguistics, Dec 2021, Montpellier (online), France. ⟨hal-03542057⟩
85 Consultations
71 Téléchargements

Partager

Gmail Facebook X LinkedIn More