Littérature scientifique sur le sujet « Semiring Monads »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Semiring Monads ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "Semiring Monads"
Kidney, Donnacha Oisín, et Nicolas Wu. « Algebras for weighted search ». Proceedings of the ACM on Programming Languages 5, ICFP (22 août 2021) : 1–30. http://dx.doi.org/10.1145/3473577.
Texte intégralGehrke, Mai, Daniela Petrişan et Luca Reggio. « Quantifiers on languages and codensity monads ». Mathematical Structures in Computer Science 30, no 10 (novembre 2020) : 1054–88. http://dx.doi.org/10.1017/s0960129521000074.
Texte intégralBonchi, Filippo, et Alessio Santamaria. « Convexity via Weak Distributive Laws ». Logical Methods in Computer Science Volume 18, Issue 4 (23 novembre 2022). http://dx.doi.org/10.46298/lmcs-18(4:8)2022.
Texte intégralKock, Joachim. « Categorification of Hopf algebras of rooted trees ». Open Mathematics 11, no 3 (1 janvier 2013). http://dx.doi.org/10.2478/s11533-012-0152-1.
Texte intégralLabai, Nadia, et Johann Makowsky. « Tropical Graph Parameters ». Discrete Mathematics & ; Theoretical Computer Science DMTCS Proceedings vol. AT,..., Proceedings (1 janvier 2014). http://dx.doi.org/10.46298/dmtcs.2406.
Texte intégralThèses sur le sujet "Semiring Monads"
Munnich, Nicolas. « Operational and categorical models of PCF : addressing machines and distributing semirings ». Electronic Thesis or Diss., Paris 13, 2024. http://www.theses.fr/2024PA131015.
Texte intégralDespite being introduced over 60 years ago, PCF remains of interest. Though the quest for a satisfactory fully abstract model of PCF was resolved around the turn of the millennium, new models of PCF still frequently appear in the literature, investigating unexplored avenues or using PCF as a lens or tool to investigate some other mathematical construct. In this thesis, we build upon our knowledge of models of PCF in two distinct ways: Constructing a brand new model, and building upon existing models. Addressing Machines are a relatively new type of abstract machine taking inspiration from Turing Machines. These machines have been previously shown to model the full untyped ?- calculus. We build upon these machines to construct Extended Addressing Machines (EAMs) and endow them with a type system. We then show that these machines can be used to obtain a new and distinct fully abstract model of PCF: We show that the machines faithfully simulatePCF in such a way that a PCF term terminates in a numeral exactly when the corresponding Extended Addressing Machine terminates in the same numeral. Likewise, we show that every typed Extended Addressing Machine can be transformed into a PCF program with the same observational behaviour. From these two results, it follows that the model of PCF obtained by quotienting typable EAMs by a suitable logical relation is fully abstract. There exist a plethora of sound categorical models of PCF, due to its close relationship with the ?-calculus. We consider two similar models (which are also models of Linear Logic) that are based on semirings: Weighted models, using semirings to quantify some internal value, and Multiplicity models, using semirings to linearly model functions (model the exponential !). We investigate the intersection between these two models by investigating the conditions under which two monads derived from specific semirings distribute. We discover that whether or not a semiring has an idempotent sum makes a large difference in its ability to distribute. Our investigation leads us to discover the notion of an unnatural distribution, which forms a monad on a Kleislicategory. Finally, we present precise conditions under which a particular distribution can form between two semirings
Reggio, Luca. « Quantifiers and duality ». Thesis, Sorbonne Paris Cité, 2018. http://www.theses.fr/2018USPCC210/document.
Texte intégralThe unifying theme of the thesis is the semantic meaning of logical quantifiers. In their basic form quantifiers allow to state theexistence, or non-existence, of individuals satisfying a property. As such, they encode the richness and the complexity of predicate logic, as opposed to propositional logic. We contribute to the semantic understanding of quantifiers, from the viewpoint of duality theory, in three different areas of mathematics and theoretical computer science. First, in formal language theory through the syntactic approach provided by logic on words. Second, in intuitionistic propositional logic and in the study of uniform interpolation. Third, in categorical topology and categorical semantics for predicate logic
Chapitres de livres sur le sujet "Semiring Monads"
Močkoř, Jiří. « Applications of Monads in Semiring-Valued Fuzzy Sets ». Dans Information Processing and Management of Uncertainty in Knowledge-Based Systems, 320–31. Cham : Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-08971-8_27.
Texte intégralBonchi, Filippo, et Alessio Santamaria. « Combining Semilattices and Semimodules ». Dans Lecture Notes in Computer Science, 102–23. Cham : Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-71995-1_6.
Texte intégralWehrung, Friedrich. « Constructions Involving Involutary Semirings and Rings ». Dans Refinement Monoids, Equidecomposability Types, and Boolean Inverse Semigroups, 185–219. Cham : Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-61599-8_6.
Texte intégralAsudeh, Ash, et Gianluca Giorgolo. « Uncertainty and conjunction fallacies ». Dans Enriched Meanings, 95–124. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780198847854.003.0006.
Texte intégralActes de conférences sur le sujet "Semiring Monads"
Rivas, Exequiel, Mauro Jaskelioff et Tom Schrijvers. « From monoids to near-semirings ». Dans PPDP '15 : 17th International Symposium on Principles and Practice of Declarative Programming. New York, NY, USA : ACM, 2015. http://dx.doi.org/10.1145/2790449.2790514.
Texte intégral