Bibliographies thématiques / Categorical soundness

Sommaire

Articles de revues
Thèses
Livres
Chapitres de livres

Littérature scientifique sur le sujet « Categorical soundness »

Auteur : Grafiati

Publié le 2 juin 2025

Mis à jour le 31 juillet 2025

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

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 « Categorical soundness ».

À 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 "Categorical soundness"

Aguirre, Alejandro, Gilles Barthe, Marco Gaboardi, Deepak Garg, Shin-ya Katsumata, and Tetsuya Sato. "Higher-order probabilistic adversarial computations: categorical semantics and program logics." Proceedings of the ACM on Programming Languages 5, ICFP (2021): 1–30. http://dx.doi.org/10.1145/3473598.

Texte intégral

Résumé :

Adversarial computations are a widely studied class of computations where resource-bounded probabilistic adversaries have access to oracles, i.e., probabilistic procedures with private state. These computations arise routinely in several domains, including security, privacy and machine learning. In this paper, we develop program logics for reasoning about adversarial computations in a higher-order setting. Our logics are built on top of a simply typed λ-calculus extended with a graded monad for probabilities and state. The grading is used to model and restrict the memory footprint and the cost

Styles APA, Harvard, Vancouver, ISO, etc.

HAGHVERDI, ESFANDIAR, and PHILIP SCOTT. "Towards a typed Geometry of Interaction." Mathematical Structures in Computer Science 20, no. 3 (2010): 473–521. http://dx.doi.org/10.1017/s096012951000006x.

Texte intégral

Résumé :

Girard's Geometry of Interaction (GoI) develops a mathematical framework for modelling the dynamics of cut elimination. We introduce a typed version of GoI, called Multiobject GoI for both multiplicative linear logic (MLL) and multiplicative exponential linear logic (MELL) with units. We present a categorical setting that includes our previous (untyped) GoI models, as well as more general models based on monoidal *-categories. Our development of multiobject GoI depends on a new theory of partial traces and trace classes, which we believe is of independent interest, as well as an abstract notio

Styles APA, Harvard, Vancouver, ISO, etc.

Cowhey, Maureen, Seung Jung Lee, Thomas Popeck Spiller, and Cindy M. Vojtech. "Sentiment in Bank Examination Reports and Bank Outcomes." Finance and Economics Discussion Series, no. 2022-077 (November 2022): 1–46. http://dx.doi.org/10.17016/feds.2022.077.

Texte intégral

Résumé :

We investigate whether the bank examination process provides useful insight into bank future outcomes. We do this by conducting textual analysis on about 5,500 small to medium-sized commercial bank examination reports from 2004 to 2016. These confidential examination reports provide textual context to the components of supervisory ratings: capital adequacy, asset quality, management, earnings, and liquidity. Each component is given a categorical rating, and each bank is assigned an overall composite rating, which are used to determine the safety and soundness of banks. We find that, controllin

Styles APA, Harvard, Vancouver, ISO, etc.

Kellison, Ariel E., Laura Zielinski, David Bindel, and Justin Hsu. "Bean: A Language for Backward Error Analysis." Proceedings of the ACM on Programming Languages 9, PLDI (2025): 1838–62. https://doi.org/10.1145/3729324.

Texte intégral

Résumé :

Backward error analysis offers a method for assessing the quality of numerical programs in the presence of floating-point rounding errors. However, techniques from the numerical analysis literature for quantifying backward error require substantial human effort, and there are currently no tools or automated methods for statically deriving sound backward error bounds. To address this gap, we propose Bean, a typed first-order programming language designed to express quantitative bounds on backward error. Bean’s type system combines a graded coeffect system with strict linearity to soundly track

Styles APA, Harvard, Vancouver, ISO, etc.

Kura, Satoshi, and Hiroshi Unno. "Automated Verification of Higher-Order Probabilistic Programs via a Dependent Refinement Type System." Proceedings of the ACM on Programming Languages 8, ICFP (2024): 973–1002. http://dx.doi.org/10.1145/3674662.

Texte intégral

Résumé :

Verification of higher-order probabilistic programs is a challenging problem. We present a verification method that supports several quantitative properties of higher-order probabilistic programs. Usually, extending verification methods to handle the quantitative aspects of probabilistic programs often entails extensive modifications to existing tools, reducing compatibility with advanced techniques developed for qualitative verification. In contrast, our approach necessitates only small amounts of modification, facilitating the reuse of existing techniques and implementations. On the theoreti

Styles APA, Harvard, Vancouver, ISO, etc.

Abreu, L. R. A., L. F. M. Mota, T. A. Ferreira, et al. "Genetic evaluation of bodyweight, scrotal circumference, and visual appraisal scores in Bos indicus cattle." Animal Production Science 58, no. 9 (2018): 1584. http://dx.doi.org/10.1071/an16548.

Texte intégral

Résumé :

Our objective was to estimate genetic parameters, and genetic and phenotypic trends for bodyweight (BW; measured at birth, 120, 205 (weaning age), 365, 450 and 550 days of age), scrotal circumference, and visual appraisal scores of body conformation in Guzerat cattle. Data regarding body structure, finishing precocity, muscling, sheath and navel, breed characteristics, limbs (soundness of feet and legs), and sexuality, which were visually appraised, were obtained from the Brazilian Association of Zebu Breeders, recorded between 1970 and 2013 in five Brazilian states. Variance components and he

Styles APA, Harvard, Vancouver, ISO, etc.

ElBannan, Mona A. "Do consolidation and foreign ownership affect bank risk taking in an emerging economy? An empirical investigation." Managerial Finance 41, no. 9 (2015): 874–907. http://dx.doi.org/10.1108/mf-12-2013-0342.

Texte intégral

Résumé :

Purpose – The purpose of this paper is to examine the effect of bank consolidation and foreign ownership on bank risk taking in the Egyptian banking sector. Design/methodology/approach – Following prior studies (e.g. Yeyati and Micco, 2007; Barry et al., 2011), this study uses pooled Ordinary Least Squares regression models under two main analyses to test the relation between concentration and foreign ownership on one hand and bank risk-taking behavior on the other hand, where observations are pooled across banks and years for the 2000-2011 period. The reform plan was launched in 2004 and resu

Styles APA, Harvard, Vancouver, ISO, etc.

Urabe, Natsuki, and Ichiro Hasuo. "Coalgebraic Infinite Traces and Kleisli Simulations." Logical Methods in Computer Science Volume 14, Issue 3 (September 5, 2018). https://doi.org/10.23638/lmcs-14(3:15)2018.

Texte intégral

Résumé :

Kleisli simulation is a categorical notion introduced by Hasuo to verify finite trace inclusion. They allow us to give definitions of forward and backward simulation for various types of systems. A generic categorical theory behind Kleisli simulation has been developed and it guarantees the soundness of those simulations with respect to finite trace semantics. Moreover, those simulations can be aided by forward partial execution (FPE)---a categorical transformation of systems previously introduced by the authors. In this paper, we give Kleisli simulation a theoretical foundation that assures i

Styles APA, Harvard, Vancouver, ISO, etc.

Pym, David, Eike Ritter, and Edmund Robinson. "Categorical Proof-theoretic Semantics." Studia Logica, May 3, 2024. http://dx.doi.org/10.1007/s11225-024-10101-9.

Texte intégral

Résumé :

AbstractIn proof-theoretic semantics, model-theoretic validity is replaced by proof-theoretic validity. Validity of formulae is defined inductively from a base giving the validity of atoms using inductive clauses derived from proof-theoretic rules. A key aim is to show completeness of the proof rules without any requirement for formal models. Establishing this for propositional intuitionistic logic raises some technical and conceptual issues. We relate Sandqvist’s (complete) base-extension semantics of intuitionistic propositional logic to categorical proof theory in presheaves, reconstructing

Styles APA, Harvard, Vancouver, ISO, etc.

Glück, Robert, and Robin Kaarsgaard. "A categorical foundation for structured reversible flowchart languages: Soundness and adequacy." Logical Methods in Computer Science Volume 14, Issue 3 (September 5, 2018). https://doi.org/10.23638/lmcs-14(3:16)2018.

Texte intégral

Résumé :

Structured reversible flowchart languages is a class of imperative reversible programming languages allowing for a simple diagrammatic representation of control flow built from a limited set of control flow structures. This class includes the reversible programming language Janus (without recursion), as well as more recently developed reversible programming languages such as R-CORE and R-WHILE. In the present paper, we develop a categorical foundation for this class of languages based on inverse categories with joins. We generalize the notion of extensivity of restriction categories to one tha

Styles APA, Harvard, Vancouver, ISO, etc.

Plus de sources

Thèses sur le sujet "Categorical soundness"

Ranjineh, Khojasteh Enayatollah. "Geostatistical three-dimensional modeling of the subsurface unconsolidated materials in the Göttingen area." Doctoral thesis, 2013. http://hdl.handle.net/11858/00-1735-0000-0001-BB9A-B.

Texte intégral

Résumé :

Das Ziel der vorliegenden Arbeit war die Erstellung eines dreidimensionalen Untergrundmodells der Region Göttingen basierend auf einer geotechnischen Klassifikation der unkosolidierten Sedimente. Die untersuchten Materialen reichen von Lockersedimenten bis hin zu Festgesteinen, werden jedoch in der vorliegenden Arbeit als Boden, Bodenklassen bzw. Bodenkategorien bezeichnet. Diese Studie evaluiert verschiedene Möglichkeiten durch geostatistische Methoden und Simulationen heterogene Untergründe zu erfassen. Derartige Modellierungen stellen ein fundamentales Hilfswerkzeug u.a. in der Geotechnik,

Styles APA, Harvard, Vancouver, ISO, etc.

Livres sur le sujet "Categorical soundness"

Herman, Barbara. Kantian Commitments. Oxford University Press, 2022. http://dx.doi.org/10.1093/oso/9780192844965.001.0001.

Texte intégral

Résumé :

The ten essays collected here represent a series of efforts to rethink many of the fundamentals of Kant’s ethics and to draw out some implications for moral theory and practice. The five essays of Part One revisit and revise several core pieces of Kant’s moral framework, offering a new understanding of the formulas of the categorical imperative, revisiting the idea of making exceptions, and deepening the contrast between Kant’s project and other deontologies (especially recent contractualisms). The key is to take seriously the idea that what Kant gives us is a theory of moral reasoning, with s

Styles APA, Harvard, Vancouver, ISO, etc.

Chapitres de livres sur le sujet "Categorical soundness"

Kura, Satoshi. "A General Semantic Construction of Dependent Refinement Type Systems, Categorically." In Lecture Notes in Computer Science. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-71995-1_21.

Texte intégral

Résumé :

AbstractDependent refinement types are types equipped with predicates that specify preconditions and postconditions of underlying functional languages. We propose a general semantic construction of dependent refinement type systems from underlying type systems and predicate logic, that is, a construction of liftings of closed comprehension categories from given (underlying) closed comprehension categories and posetal fibrations for predicate logic. We give sufficient conditions to lift structures such as dependent products, dependent sums, computational effects, and recursion from the underlyi

Styles APA, Harvard, Vancouver, ISO, etc.

Schneider Luc. "The Ontological Square and its Logic." In Frontiers in Artificial Intelligence and Applications. IOS Press, 2008. https://doi.org/10.3233/978-1-58603-923-3-36.

Texte intégral

Résumé :

The Ontological Square is a four-categorial scheme that is obtained by crossing two formal distinctions which underpin conceptual modelling languages and top-level ontologies alike: that between types (or universals) and tokens (or particulars) on the one hand, and that between characters (or features) and their bearers (or substrates) on the other hand. Thus the Ontological Square consists of particular substrates, called substances, and universal substrates, called kinds, as well as particular characters, called modes or moments, and universal characters, called attributes. In this article,

Styles APA, Harvard, Vancouver, ISO, etc.

Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!