相关论文: Constructing the Propositional Truncation using No…

In Constructive Type Theory, recursive and corecursive definitions are subject to syntactic restrictions which guarantee termination for recursive functions and productivity for corecursive functions. However, many terminating and…

Resolvent compositions were recently introduced as monotonicity-preserving operations that combine a set-valued monotone operator and a bounded linear operator. They generalize in particular the notion of a resolvent average. We analyze the…

We develop the homotopy theory of semisimplicial sets constructively and without reference to point-set topology to obtain a constructive model for $\omega$-groupoids. Most of the development is folklore, but for a few results the author is…

The study of equality types is central to homotopy type theory. Characterizing these types is often tricky, and various strategies, such as the encode-decode method, have been developed. We prove a theorem about equality types of…

We introduce an operational rewriting-based semantics for strictly positive nested higher-order (co)inductive types. The semantics takes into account the "limits" of infinite reduction sequences. This may be seen as a refinement and…

We describe a mathematical structure that can give extensional denotational semantics to higher-order probabilistic programs. It is not limited to discrete probabilities, and it is compatible with integration in a way the models that have…

We introduce the Learning Hyperplane Tree (LHT), a novel oblique decision tree model designed for expressive and interpretable classification. LHT fundamentally distinguishes itself through a non-iterative, statistically-driven approach to…

Prompt-based methods have been used extensively across NLP to build zero- and few-shot label predictors. Many NLP tasks are naturally structured: that is, their outputs consist of multiple labels which constrain each other. Annotating data…

Let T be a general complex tensor of format $(n_1,...,n_d)$. When the fraction $\prod_in_i/[1+\sum_i(n_i-1)]$ is an integer, and a natural inequality (called balancedness) is satisfied, it is expected that T has finitely many minimal…

Higher-dimensional rewriting systems are tools to analyse the structure of formally reducing terms to normal forms, as well as comparing the different reduction paths that lead to those normal forms. This higher structure can be captured by…

This essay aims to propose construction theory, a new domain of theoretical research on machine construction, and use it to shed light on a fundamental relationship between living and computational systems. Specifically, we argue that…

Given a type A in homotopy type theory (HoTT), we can define the free infinity-group on A as the loop space of the suspension of A+1. Equivalently, this free higher group can be defined as a higher inductive type F(A) with constructors unit…

Hamiltonian Truncation Effective Theory is a framework that aims to improve the results of Hamiltonian truncation in a systematic, order-by-order fashion using Effective Field Theory methodology. The result is a truncated effective…

Cubical type theories are designed around an abstract unit interval from which types of paths, used to represent equalities, are defined. Varying the operations available on this interval yields different type theories. A reversal is an…

In higher-order topological insulators (HOTIs), topologically nontrivial phases are usually associated with the shift of Wannier centers to topologically nontrivial positions on the edges of the unit cells, and the emergence of fractional…

In this paper, we outline the prototype of an automated inference tool, called QUIP, which provides a uniform implementation for several nonmonotonic reasoning formalisms. The theoretical basis of QUIP is derived from well-known results…

We introduce a new formulation of the axiom of dependent choice that can be viewed as an abstract termination principle, which generalises the recursive path orderings used to establish termination of rewrite systems. We consider several…

Generally, natural scientific problems are so complicated that one has to establish some effective perturbation or nonperturbation theories with respect to some associated ideal models. In this Letter, a new theory that combines…

Computational paths treat propositional equality as explicit paths built from labelled deduction steps and rewrite rules. This view originates in work by de Queiroz and collaborators [1] and yields a weak groupoid structure for equality,…

We present a way of constructing a Quillen model structure on a full subcategory of an elementary topos, starting with an interval object with connections and a certain dominance. The advantage of this method is that it does not require the…