English
Related papers

Related papers: Parametricity via Cohesion

200 papers

Unimodularity is localized to a complete stationary type, and its properties are analysed. Some variants of unimodularity for definable and type-definable sets are introduced, and the relationship between these different notions is studied.…

Logic · Mathematics 2016-10-06 Darío García , Frank Olaf Wagner

In this paper, we initiate a systematic study of the parametrised complexity in the field of Dependence Logics which finds its origin in the Dependence Logic of V\"a\"an\"anen from 2007. We study a propositional variant of this logic (PDL)…

Logic in Computer Science · Computer Science 2020-06-16 Yasir Mahmood , Arne Meier

A common theme in all the above areas is designing a dynamical system to accomplish desired objectives, possibly in some predefined optimal way. Since control theory advances the idea of suitably modifying the behavior of a dynamical…

Optimization and Control · Mathematics 2024-07-03 Revati Gunjal , Syed Shadab Nayyer , Sushama Wagh , Navdeep Singh

Often in Software Engineering, a modeling formalism has to support scenarios of inconsistency in which several requirements either reinforce or contradict each other. Paraconsistent transition systems are proposed in this paper as one such…

Logic in Computer Science · Computer Science 2023-03-24 Ana Cruz , Alexandre Madeira , LuÂ-Ã-s Soares Barbosa

In this paper, we develop the notion of presentability in the parametrised homotopy theory framework of Barwick-Dotto-Glasman-Nardin-Shah over orbital categories. We formulate and prove a characterisation of parametrised presentable…

Algebraic Topology · Mathematics 2024-01-04 Kaif Hilman

We prove normalization for MTT, a general multimodal dependent type theory capable of expressing modal type theories for guarded recursion, internalized parametricity, and various other prototypical modal situations. We prove that deciding…

Logic in Computer Science · Computer Science 2026-03-25 Daniel Gratzer

We provide a mechanism of gauging a theory based on a particular way to embed a theory on a target space such that a nontrivial fibration is produced. A connection over a nontrivial fibration with monodromy provides a natural framework for…

High Energy Physics - Theory · Physics 2011-07-19 Maria Pilar Garcia del Moral

Metamorphic testing has recently been used to check the safety of neural NLP models. Its main advantage is that it does not rely on a ground truth to generate test cases. However, existing studies are mostly concerned with robustness-like…

Computation and Language · Computer Science 2022-04-27 Edoardo Manino , Julia Rozanova , Danilo Carvalho , Andre Freitas , Lucas Cordeiro

In the context of elasticity theory, rigidity theorems allow to derive global properties of a deformation from local ones. This paper presents a new asymptotic version of rigidity, applicable to elastic bodies with sufficiently stiff…

Analysis of PDEs · Mathematics 2019-09-04 Fabian Christowiak , Carolin Kreisbeck

We define am axiomatic timeless framework for asynchronous distributed systems, together with well-formedness and consistency axioms, which unifies and generalizes the expressive power of current approaches. 1) It combines classic…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-11-26 Paulo Sérgio Almeida

Recent progress in time-series forecasting has led to rapidly increasing architectural complexity, yet many reported State-of-the-Art gains are statistically fragile or misattributed. We argue that progress requires a shift from model…

A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…

Logic in Computer Science · Computer Science 2026-05-07 Matthijs Vákár

We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the problem's combinatorial explosion, beyond the number of…

Logic in Computer Science · Computer Science 2009-12-31 Antonis Achilleos , Michael Lampis , Valia Mitsou

The notion of a natural model of type theory is defined in terms of that of a representable natural transfomation of presheaves. It is shown that such models agree exactly with the concept of a category with families in the sense of Dybjer,…

Category Theory · Mathematics 2017-01-10 Steve Awodey

Component-based design paradigm is of paramount importance due to prolific growth in the complexity of modern-day systems. Since the components are developed primarily by multi-party vendors and often assembled to realize the overall…

Software Engineering · Computer Science 2022-05-31 Aritra Hazra

We present a conceptual framework that unifies a variety of evaluation metrics for different structured prediction tasks (e.g. event and relation extraction, syntactic and semantic parsing). Our framework requires representing the outputs…

Computation and Language · Computer Science 2023-10-24 Yunmo Chen , William Gantt , Tongfei Chen , Aaron Steven White , Benjamin Van Durme

Suppose we are given a graph and want to show a property for all its cycles (closed chains). Induction on the length of cycles does not work since sub-chains of a cycle are not necessarily closed. This paper derives a principle reminiscent…

Logic · Mathematics 2020-07-01 Nicolai Kraus , Jakob von Raumer

One of the prime motivation for topology was Homotopy theory, which captures the general idea of a continuous transformation between two entities, which may be spaces or maps. In later decades, an algebraic formulation of topology was…

Category Theory · Mathematics 2025-11-24 Suddhasattwa Das

Complexity science offers a wide range of measures for quantifying unpredictability, structure, and information. Yet, a systematic conceptual organization of these measures is still missing. We present a unified framework that locates…

Machine Learning · Computer Science 2025-05-13 Nima Dehghani

The role of types in categorical models of meaning is investigated. A general scheme for how typed models of meaning may be used to compare sentences, regardless of their grammatical structure is described, and a toy example is used as an…

Computation and Language · Computer Science 2013-03-14 Peter Hines
‹ Prev 1 4 5 6 7 8 10 Next ›