Relevant bibliographies by topics / Categorical soundness / Journal articles
To see the other types of publications on this topic, follow the link: Categorical soundness.

Journal articles on the topic 'Categorical soundness'

Author: Grafiati
Published: 2 June 2025
Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 18 journal articles for your research on the topic 'Categorical soundness.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

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.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
3

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.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
5

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.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
6

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.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
7

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.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
8

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.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
9

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.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
10

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.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
11

Braüner, Torben. "A General Adequacy Result for a Linear Functional Language." BRICS Report Series 1, no. 22 (1994). http://dx.doi.org/10.7146/brics.v1i22.21645.

Full text
Abstract:
A main concern of the paper will be a Curry-Howard interpretation of Intuitionistic Linear Logic. It will be extended with recursion, and the resulting functional programming language will be given operational as well as categorical semantics. The two semantics will be related by soundness and adequacy results. The main features of the categorical semantics are that convergence/divergence behaviour is modelled by a strong monad, and that recursion is modelled by ``linear fixpoints'' induced by CPO structure on the hom-sets. The ``linear fixpoints'' correspond to ordinary fixpoints in the categ
APA, Harvard, Vancouver, ISO, and other styles
12

Docherty, Simon, and David Pym. "Stone-Type Dualities for Separation Logics." Logical Methods in Computer Science Volume 15, Issue 1 (March 14, 2019). https://doi.org/10.23638/lmcs-15(1:27)2019.

Full text
Abstract:
Stone-type duality theorems, which relate algebraic and relational/topological models, are important tools in logic because -- in addition to elegant abstraction -- they strengthen soundness and completeness to a categorical equivalence, yielding a framework through which both algebraic and topological methods can be brought to bear on a logic. We give a systematic treatment of Stone-type duality for the structures that interpret bunched logics, starting with the weakest systems, recovering the familiar BI and Boolean BI (BBI), and extending to both classical and intuitionistic Separation Logi
APA, Harvard, Vancouver, ISO, and other styles
13

Kursa, Miron Bartosz. "Kendall transformation brings a robust categorical representation of ordinal data." Scientific Reports 12, no. 1 (2022). http://dx.doi.org/10.1038/s41598-022-12224-2.

Full text
Abstract:
AbstractKendall transformation is a conversion of an ordered feature into a vector of pairwise order relations between individual values. This way, it preserves ranking of observations and represents it in a categorical form. Such transformation allows for generalisation of methods requiring strictly categorical input, especially in the limit of small number of observations, when quantisation becomes problematic. In particular, many approaches of information theory can be directly applied to Kendall-transformed continuous data without relying on differential entropy or any additional parameter
APA, Harvard, Vancouver, ISO, and other styles
14

Katsumata, Shin-ya, Xavier Rival, and Jérémy Dubut. "A Categorical Framework for Program Semantics and Semantic Abstraction." Electronic Notes in Theoretical Informatics and Computer Science Volume 3 - Proceedings of... (November 23, 2023). http://dx.doi.org/10.46298/entics.12288.

Full text
Abstract:
Categorical semantics of type theories are often characterized as structure-preserving functors. This is because in category theory both the syntax and the domain of interpretation are uniformly treated as structured categories, so that we can express interpretations as structure-preserving functors between them. This mathematical characterization of semantics makes it convenient to manipulate and to reason about relationships between interpretations. Motivated by this success of functorial semantics, we address the question of finding a functorial analogue in abstract interpretation, a genera
APA, Harvard, Vancouver, ISO, and other styles
15

Nygaard, Mikkel, and Glynn Winskel. "Domain Theory for Concurrency." BRICS Report Series 10, no. 43 (2003). http://dx.doi.org/10.7146/brics.v10i43.21815.

Full text
Abstract:
A simple domain theory for concurrency is presented. Based on a categorical model of linear logic and associated comonads, it highlights the role of linearity in concurrent computation. Two choices of comonad yield two expressive metalanguages for higher-order processes, both arising from canonical constructions in the model. Their denotational semantics are fully abstract with respect to contextual equivalence. One language derives from an exponential of linear logic; it supports a straightforward operational semantics with simple proofs of soundness and adequacy. The other choice of comonad
APA, Harvard, Vancouver, ISO, and other styles
16

Emmerson, Parker. "Anterolateral Lite 2." Journal of Liberated Mathematics, May 25, 2025. https://doi.org/10.5281/zenodo.15510371.

Full text
Abstract:
The \emph{Anterolateral Lite 2} formalism arises from a need to robustly track analytic and symbolic distinctions that are often lost in traditional algebraic and geometric frameworks, especially in contexts involving multi-branched solutions and subtle phase phenomena, such as Lorentzian and radical expressions. Classical algebraic structures, which treat coordinates as atomic or globally coherent entities, are prone to \emph{branch collapse}: the unwanted identification of distinct solution branches through singularities, degenerate loci, or insufficiently expressive type systems. Building o
APA, Harvard, Vancouver, ISO, and other styles
17

Kasie, Fentahun Moges, and Glen Bright. "Application of Neutrosophic Case-Based Reasoning and Neutrosophic Best-Worst Method for Product Cost Estimation." Contemporary Mathematics, March 24, 2025, 2063–88. https://doi.org/10.37256/cm.6220255503.

Full text
Abstract:
The problem of product cost estimation is one of the crucial issues in contemporary manufacturing systems when new products arrive as customer orders. Product cost estimation determines the success of manufacturers. An overestimation causes them to lose sales and competitiveness and an underestimation results in a financial crisis. This should be done at the early of production to reduce the potential costs that can be incurred in the production, distribution, consumption, and disposal of products. In previous studies, this problem was addressed using different mathematical, heuristics, multip
APA, Harvard, Vancouver, ISO, and other styles
18

Oussalah, Mourad, and Muhidin Mohamed. "Knowledge-based sentence semantic similarity: algebraical properties." Progress in Artificial Intelligence, August 21, 2021. http://dx.doi.org/10.1007/s13748-021-00248-0.

Full text
Abstract:
AbstractDetermining the extent to which two text snippets are semantically equivalent is a well-researched topic in the areas of natural language processing, information retrieval and text summarization. The sentence-to-sentence similarity scoring is extensively used in both generic and query-based summarization of documents as a significance or a similarity indicator. Nevertheless, most of these applications utilize the concept of semantic similarity measure only as a tool, without paying importance to the inherent properties of such tools that ultimately restrict the scope and technical soun
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography