Related papers: Functions out of Higher Truncations

We address the problem of complementing higher-order patterns without repetitions of existential variables. Differently from the first-order case, the complement of a pattern cannot, in general, be described by a pattern, or even by a…

We construct the homotopy pullback of $A_n$-spaces and show some universal property of it. As the first application, we review the Zabrodsky's result which states that for each prime $p$, there is a finite CW complex which admits an…

Consider the following curious puzzle: call an n-tuple X=(X_1, ..., X_n) of sets smaller than another n-tuple Y if it has fewer //unordered sections//. We show that equivalence classes for this preorder are very easy to describe and…

In homotopy type theory we can define the join of maps as a binary operation on maps with a common co-domain. This operation is commutative, associative, and the unique map from the empty type into the common codomain is a neutral element.…

Motivated by applications in automated verification of higher-order functional programs, we develop a notion of constrained Horn clauses in higher-order logic and a decision problem concerning their satisfiability. We show that, although…

We extend the theory of d-categories, by providing an explicit description of the right mapping spaces of the d-homotopy category of an $\infty$-category. Using this description, we deduce an invariant $\infty$-categorical characterization…

To ensure decidability and consistency of its type theory, a proof assistant should only accept terminating recursive functions and productive corecursive functions. Most proof assistants enforce this through syntactic conditions, which can…

We introduce a category of locally constant $n$-operads which can be considered as the category of higher braided operads. For $n=1,2,\infty$ the homotopy category of locally constant $n$-operads is equivalent to the homotopy category of…

We explain how the simplicial higher-order unstable homotopy operations defined in [BBS2] may be composed and inserted one in another, thus forming a coherent if complicated algebraic structure.

The paper considers truncation errors for functions of the form $f(x_1,x_2,\dots)=g(\sum_{j=1}^\infty x_j\,\xi_j)$, i.e., errors of approximating $f$ by $f_k(x_1,\dots,x_k)=g(\sum_{j=1}^k x_j\,\xi_j)$, where the numbers $\xi_j$ converge to…

Like categories, small 2-categories have well-understood classifying spaces. In this paper, we deal with homotopy types represented by 2-diagrams of 2-categories. Our results extend to homotopy colimits of 2-functors lower categorical…

As the groupoid model of Hofmann and Streicher proves, identity proofs in intensional Martin-L\"of type theory cannot generally be shown to be unique. Inspired by a theorem by Hedberg, we give some simple characterizations of types that do…

Field theories with weakly coupled holographic duals, such as large N gauge theories, have a natural separation of their operators into `single-trace operators' (dual to single-particle states) and `multi-trace operators' (dual to…

Some type-based approaches to termination use sized types: an ordinal bound for the size of a data structure is stored in its type. A recursive function over a sized type is accepted if it is visible in the type system that recursive calls…

We exhibit a way of "forcing a functional to be an effective operation" for arbitrary partial combinatory algebras (pcas). This gives a method of defining new pcas from old ones for some fixed functional, where the new partial functions can…

We discuss the extent to which it is necessary to include higher-derivative operators in the effective field theory of general scalar-tensor theories. We explore the circumstances under which it is correct to restrict to second-order…

This paper presents a new type analysis for logic programs. The analysis is performed with a priori type definitions; and type expressions are formed from a fixed alphabet of type constructors. Non-discriminative union is used to join type…

Homotopy type theory is an interpretation of Martin-L\"of's constructive type theory into abstract homotopy theory. There results a link between constructive mathematics and algebraic topology, providing topological semantics for…

Methods are developed to relate the action of a principal fibration to relative Whitehead products in order to determine the homotopy type of certain spaces. The methods are applied to thoroughly analyze the homotopy type of the based loops…

In classical set theory, there are many equivalent ways to introduce ordinals. In a constructive setting, however, the different notions split apart, with different advantages and disadvantages for each. We consider three different notions…