English
Related papers

Related papers: Cubical Type Theoretic Navya-Ny\=aya

200 papers

We generalise Levy's call-by-push-value (CBPV) to dependent type theory, to gain a better understanding of how to combine dependent types with effects. We define a dependently typed extension of CBPV, dCBPV-, and show that it has a very…

Logic in Computer Science · Computer Science 2016-03-15 Matthijs Vákár

The Algebraic Dichotomy Conjecture states that the Constraint Satisfaction Problem over a fixed template is solvable in polynomial time if the algebra of polymorphisms associated to the template lies in a Taylor variety, and is NP-complete…

Logic in Computer Science · Computer Science 2015-07-01 Libor Barto , Marcin Kozik

Despite being fairly powerful, finite non-deterministic matrices are unable to characterize some logics of formal inconsistency, such as those found between $\textbf{mbCcl}$ and $\textbf{Cila}$. In order to overcome this limitation, we…

Logic · Mathematics 2021-05-26 Marcelo E. Coniglio , Guilherme V. Toledo

Compactified Yang-Mills theories with one universal extra dimension were found [arXiv:1008.4638] to exhibit two types of gauge invariances: the standard gauge transformations (SGTs) and the nonstandard gauge transformations (NSGTs). In the…

High Energy Physics - Phenomenology · Physics 2013-11-01 M. A. López-Osorio , E. Martínez-Pascual , H. Novales-Sánchez , J. J. Toscano

The maximally-decoupled method has been considered as a theory to apply an basic idea of an integrability condition to certain multiple parametrized symmetries. The method is regarded as a mathematical tool to describe a symmetry of a…

Exactly Solvable and Integrable Systems · Physics 2009-01-23 Seiya Nishiyama , Joao da Providencia , Constanca Providencia , Flavio Cordeiro , Takao Komatsu

We present a logic named L_{LF} whose intended use is to formalize properties of specifications developed in the dependently typed lambda calculus LF. The logic is parameterized by the LF signature that constitutes the specification. Atomic…

Logic in Computer Science · Computer Science 2022-04-12 Gopalan Nadathur , Mary Southern

Taha and Nielsen have developed a multi-stage calculus {\lambda}{\alpha} with a sound type system using the notion of environment classifiers. They are special identifiers, with which code fragments and variable declarations are annotated,…

Programming Languages · Computer Science 2015-07-01 Takeshi Tsukada , Atsushi Igarashi

Recent advances in 11 dimensional Horava-Witten M-theory based on non-standard embeddings with torus fibered Calabi-Yau manifolds have allowed the construction of three generation models with Wilson line breaking to the Standard Model gauge…

High Energy Physics - Theory · Physics 2008-11-26 R. Arnowitt , B. Dutta

We study the geometric interpretation of two dimensional rational conformal field theories, corresponding to sigma models on Calabi-Yau manifolds. We perform a detailed study of RCFT's corresponding to T^2 target and identify the Cardy…

High Energy Physics - Theory · Physics 2009-11-07 Sergei Gukov , Cumrun Vafa

We study maximally supersymmetric irrelevant deformations of the D1-D5 CFT that correspond to following the attractor flow in reverse in the dual half-BPS black string solutions of type IIB supergravity on K3. When a single, quadratic…

High Energy Physics - Theory · Physics 2024-08-20 Silvia Georgescu , Monica Guica , Nicolas Kovensky

Large language models (LLMs) exhibit degraded performance under prompt compression, but the mechanisms remain poorly understood. We introduce the Compression-Decay Comprehension Test (CDCT), a benchmark that independently measures…

Computation and Language · Computer Science 2025-12-23 Rahul Baxi

A fundamental issue in the $\lambda$-calculus is to find appropriate notions for meaningfulness. It is well-known that in the call-by-name $\lambda$-calculus (CbN) the meaningful terms can be identified with the solvable ones, and that this…

Logic in Computer Science · Computer Science 2024-02-02 Victor Arrial , Giulio Guerrieri , Delia Kesner

Let $Y$ be a cubic threefold with a non-Eckardt type involution $\tau$. Our first main result is that the $\tau$-equivariant category of the Kuznetsov component $\mathcal{K}u_{\mathbb{Z}_2}(Y)$ determines the isomorphism class of $Y$ for…

Algebraic Geometry · Mathematics 2024-10-22 Sebastian Casalaina-Martin , Xianyu Hu , Xun Lin , Shizhuo Zhang , Zheng Zhang

The conformal affine Toda model coupled to the matter field (CATM) is obtained through a classical reduction of the $sl(2)^{(1)}$ affine two-loop WZNW model. After spontaneously broken the conformal symmetry by means of BRST analysis, we…

High Energy Physics - Theory · Physics 2007-05-23 Harold Blas

The univalence axiom expresses the principle of extensionality for dependent type theory. However, if we simply add the univalence axiom to type theory, then we lose the property of canonicity - that every closed term computes to a…

Logic in Computer Science · Computer Science 2017-03-14 Robin Adams , Marc Bezem , Thierry Coquand

Nominal abstract syntax is an approach to representing names and binding pioneered by Gabbay and Pitts. So far nominal techniques have mostly been studied using classical logic or model theory, not type theory. Nominal extensions to simple,…

Logic in Computer Science · Computer Science 2015-07-01 James Cheney

Gradually typed programming languages, which allow for soundly mixing static and dynamically typed programming styles, present a strong challenge for metatheorists. Even the simplest sound gradually typed languages feature at least…

Programming Languages · Computer Science 2025-07-14 Eric Giovannini , Tingting Ding , Max S. New

Algebraic theories with dependency between sorts form the structural core of Martin-L\"of type theory and similar systems. Their denotational semantics are typically studied using categorical techniques; many different categorical…

Category Theory · Mathematics 2024-12-31 Benedikt Ahrens , Peter LeFanu Lumsdaine , Paige Randall North

This paper presents preliminary work on a general system for integrating dependent types into substructural type systems such as linear logic and linear type theory. Prior work on this front has generally managed to deliver type systems…

Logic in Computer Science · Computer Science 2024-01-30 C. B. Aberlé

Three-way logical question answering (QA) assigns one of $\text{True}$, $\text{False}$, or $\text{Unknown}$ to a hypothesis $H$ given a premise set $S$. We study this task as a compact compositional inference problem: predictions for $H$…

Computation and Language · Computer Science 2026-05-28 Tianyi Huang , Ming Hou , Jiaheng Su , Yutong Zhang , Ziling Zhang
‹ Prev 1 4 5 6 7 8 10 Next ›