Academic Journal

COINDUCTIVE STREAMS IN MONOIDAL CATEGORIES.

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: COINDUCTIVE STREAMS IN MONOIDAL CATEGORIES.
Συγγραφείς: DI LAVORE, ELENA, DE FELICE, GIOVANNI, ROMÁN, MARIO
Πηγή: Logical Methods in Computer Science (LMCS); 2025, Vol. 21 Issue 3, p1-52, 52p
Θεματικοί όροι: Monoidal categories, Stochastic processes, Data flow computing, Flowgraphs, Stream measurements
Περίληψη: We introduce monoidal streams. Monoidal streams are a generalization of causal stream functions, which can be defined in cartesian monoidal categories, to arbitrary symmetric monoidal categories. In the same way that streams provide semantics to dataflow programming with pure functions, monoidal streams provide semantics to dataflow programming with arbitrary processes. Monoidal streams also form a feedback monoidal category. In the same way that the coinductive stream calculus reasons about signal flow graphs, coinductive string diagrams reason about feedback monoidal categories, with semantics in monoidal streams. We highlight the probabilistic case, characterizing probabilistic streams as causal stochastic processes. [ABSTRACT FROM AUTHOR]
Copyright of Logical Methods in Computer Science (LMCS) is the property of Logical Methods in Computer Science and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Βάση Δεδομένων: Complementary Index
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://resolver.ebsco.com/c/fiv2js/result?sid=EBSCO:edb&genre=article&issn=18605974&ISBN=&volume=21&issue=3&date=20250701&spage=1&pages=1-52&title=Logical Methods in Computer Science (LMCS)&atitle=COINDUCTIVE%20STREAMS%20IN%20MONOIDAL%20CATEGORIES.&aulast=DI%20LAVORE%2C%20ELENA&id=DOI:10.46298/LMCS-21(3:18)2025
    Name: Full Text Finder (for New FTF UI) (ns324271)
    Category: fullText
    Text: Full Text Finder
    MouseOverText: Full Text Finder
Header DbId: edb
DbLabel: Complementary Index
An: 188771838
RelevancyScore: 994
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 993.554321289063
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: COINDUCTIVE STREAMS IN MONOIDAL CATEGORIES.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22DI+LAVORE%2C+ELENA%22">DI LAVORE, ELENA</searchLink><br /><searchLink fieldCode="AR" term="%22DE+FELICE%2C+GIOVANNI%22">DE FELICE, GIOVANNI</searchLink><br /><searchLink fieldCode="AR" term="%22ROMÁN%2C+MARIO%22">ROMÁN, MARIO</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: Logical Methods in Computer Science (LMCS); 2025, Vol. 21 Issue 3, p1-52, 52p
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Monoidal+categories%22">Monoidal categories</searchLink><br /><searchLink fieldCode="DE" term="%22Stochastic+processes%22">Stochastic processes</searchLink><br /><searchLink fieldCode="DE" term="%22Data+flow+computing%22">Data flow computing</searchLink><br /><searchLink fieldCode="DE" term="%22Flowgraphs%22">Flowgraphs</searchLink><br /><searchLink fieldCode="DE" term="%22Stream+measurements%22">Stream measurements</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: We introduce monoidal streams. Monoidal streams are a generalization of causal stream functions, which can be defined in cartesian monoidal categories, to arbitrary symmetric monoidal categories. In the same way that streams provide semantics to dataflow programming with pure functions, monoidal streams provide semantics to dataflow programming with arbitrary processes. Monoidal streams also form a feedback monoidal category. In the same way that the coinductive stream calculus reasons about signal flow graphs, coinductive string diagrams reason about feedback monoidal categories, with semantics in monoidal streams. We highlight the probabilistic case, characterizing probabilistic streams as causal stochastic processes. [ABSTRACT FROM AUTHOR]
– Name: Abstract
  Label:
  Group: Ab
  Data: <i>Copyright of Logical Methods in Computer Science (LMCS) is the property of Logical Methods in Computer Science and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edb&AN=188771838
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.46298/LMCS-21(3:18)2025
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 52
        StartPage: 1
    Subjects:
      – SubjectFull: Monoidal categories
        Type: general
      – SubjectFull: Stochastic processes
        Type: general
      – SubjectFull: Data flow computing
        Type: general
      – SubjectFull: Flowgraphs
        Type: general
      – SubjectFull: Stream measurements
        Type: general
    Titles:
      – TitleFull: COINDUCTIVE STREAMS IN MONOIDAL CATEGORIES.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: DI LAVORE, ELENA
      – PersonEntity:
          Name:
            NameFull: DE FELICE, GIOVANNI
      – PersonEntity:
          Name:
            NameFull: ROMÁN, MARIO
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 07
              Text: 2025
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 18605974
          Numbering:
            – Type: volume
              Value: 21
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: Logical Methods in Computer Science (LMCS)
              Type: main
ResultId 1