Pairs of points : antigonal, isogonal, and inverse

J. IJzeren, van

    Research output: Contribution to journalArticleProfessional

    3 Downloads (Pure)

    Abstract

    Final coalgebras capture system behaviours such as streams, infinite trees and processes. Algebraic operations on a final coalgebra can be defined by distributive laws (of a syntax functor S over a behaviour functor F). Such distributive laws correspond to abstract specification formats. One such format is a generalisation of the GSOS rules known from structural operational semantics of processes. We show that given an abstract GSOS specification ¿ that defines operations s on a final F-coalgebra, we can systematically construct a GSOS specification ¿ that defines the pointwise extension s of s on a final FA-coalgebra. The construction relies on the addition of a family of auxiliary ‘buffer’ operations to the syntax. These buffer operations depend only on A, so the construction is uniform for all s and F.
    Original languageEnglish
    Pages (from-to)339-347
    Number of pages41
    JournalMathematics Magazine
    Volume65
    Issue number5
    DOIs
    Publication statusPublished - 1992

    Fingerprint

    Isogonal
    Coalgebra
    Distributive law
    Specification
    Functor
    Buffer
    Structural Operational Semantics
    Fatty Acids

    Cite this

    IJzeren, van, J. / Pairs of points : antigonal, isogonal, and inverse. In: Mathematics Magazine. 1992 ; Vol. 65, No. 5. pp. 339-347.
    @article{e50117ae503049989cf0a75bfa0a3c0e,
    title = "Pairs of points : antigonal, isogonal, and inverse",
    abstract = "Final coalgebras capture system behaviours such as streams, infinite trees and processes. Algebraic operations on a final coalgebra can be defined by distributive laws (of a syntax functor S over a behaviour functor F). Such distributive laws correspond to abstract specification formats. One such format is a generalisation of the GSOS rules known from structural operational semantics of processes. We show that given an abstract GSOS specification ¿ that defines operations s on a final F-coalgebra, we can systematically construct a GSOS specification ¿ that defines the pointwise extension s of s on a final FA-coalgebra. The construction relies on the addition of a family of auxiliary ‘buffer’ operations to the syntax. These buffer operations depend only on A, so the construction is uniform for all s and F.",
    author = "{IJzeren, van}, J.",
    year = "1992",
    doi = "10.2307/2691249",
    language = "English",
    volume = "65",
    pages = "339--347",
    journal = "Mathematics Magazine",
    issn = "0025-570X",
    publisher = "Mathematical Association of America",
    number = "5",

    }

    Pairs of points : antigonal, isogonal, and inverse. / IJzeren, van, J.

    In: Mathematics Magazine, Vol. 65, No. 5, 1992, p. 339-347.

    Research output: Contribution to journalArticleProfessional

    TY - JOUR

    T1 - Pairs of points : antigonal, isogonal, and inverse

    AU - IJzeren, van, J.

    PY - 1992

    Y1 - 1992

    N2 - Final coalgebras capture system behaviours such as streams, infinite trees and processes. Algebraic operations on a final coalgebra can be defined by distributive laws (of a syntax functor S over a behaviour functor F). Such distributive laws correspond to abstract specification formats. One such format is a generalisation of the GSOS rules known from structural operational semantics of processes. We show that given an abstract GSOS specification ¿ that defines operations s on a final F-coalgebra, we can systematically construct a GSOS specification ¿ that defines the pointwise extension s of s on a final FA-coalgebra. The construction relies on the addition of a family of auxiliary ‘buffer’ operations to the syntax. These buffer operations depend only on A, so the construction is uniform for all s and F.

    AB - Final coalgebras capture system behaviours such as streams, infinite trees and processes. Algebraic operations on a final coalgebra can be defined by distributive laws (of a syntax functor S over a behaviour functor F). Such distributive laws correspond to abstract specification formats. One such format is a generalisation of the GSOS rules known from structural operational semantics of processes. We show that given an abstract GSOS specification ¿ that defines operations s on a final F-coalgebra, we can systematically construct a GSOS specification ¿ that defines the pointwise extension s of s on a final FA-coalgebra. The construction relies on the addition of a family of auxiliary ‘buffer’ operations to the syntax. These buffer operations depend only on A, so the construction is uniform for all s and F.

    U2 - 10.2307/2691249

    DO - 10.2307/2691249

    M3 - Article

    VL - 65

    SP - 339

    EP - 347

    JO - Mathematics Magazine

    JF - Mathematics Magazine

    SN - 0025-570X

    IS - 5

    ER -