Diagrammatic Inference - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2009

Diagrammatic Inference

Résumé

Diagrammatic logics were introduced in 2002, with emphasis on the notions of specifications and models. In this paper we improve the description of the inference process, which is seen as a Yoneda functor on a bicategory of fractions. A diagrammatic logic is defined from a morphism of limit sketches (called a propagator) which gives rise to an adjunction, which in turn determines a bicategory of fractions. The propagator, the adjunction and the bicategory provide respectively the syntax, the models and the inference process for the logic. Then diagrammatic logics and their morphisms are applied to the semantics of side effects in computer languages.
Fichier principal
Vignette du fichier
diaginf.pdf (245.87 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00177075 , version 1 (05-10-2007)
hal-00177075 , version 2 (20-11-2009)

Identifiants

Citer

Dominique Duval. Diagrammatic Inference. 2009. ⟨hal-00177075v2⟩
93 Consultations
273 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More