Diagrammatic Inference

Details Diagrammatic Inference Diagrammatic Inference

2007-10-05

arxiv.org/abs/0710.1208v2

Computer Science

Logic in Computer Science

16 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Diagrammatic Inference does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Diagrammatic Inference, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Diagrammatic Inference will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-329059