Related papers: Games for Dependent Types
In homotopy type theory (HoTT), all constructions are necessarily stable under homotopy equivalence. This has shortcomings: for example, it is believed that it is impossible to define a type of semi-simplicial types. More generally, it is…
We propose a classification of all one-dimensional discrete statistical models with maximum likelihood degree one based on their rational parametrization. We show how all such models can be constructed from members of a smaller class of…
We consider type inference for guarded recursive data types (GRDTs) -- a recent generalization of algebraic data types. We reduce type inference for GRDTs to unification under a mixed prefix. Thus, we obtain efficient type inference.…
The purpose of this text is to prove all technical aspects of our model for dependent type theory with parametric quantifiers [Nuyts, Vezzosi and Devriese, 2017]. It is well-known that any presheaf category constitutes a model of dependent…
Type systems certify program properties in a compositional way. From a bigger program one can abstract out a part and certify the properties of the resulting abstract program by just using the type of the part that was abstracted away.…
In this paper we provide three new results axiomatizing the core of games in characteristic function form (not necessarily having transferable utility) obeying an innocuous condition (that the set of individually rational pay-off vectors is…
We develop an Integral Transformation Method (ITM) for the study of suitable optimal control and differential game models. This allows for a solution to such dynamic problems to be found through solving a family of optimization problems…
This paper presents two types of results related to hyperarithmetic analysis. First, we introduce new variants of the dependent choice axiom, namely $\mathrm{unique}~\Pi^1_0(\mathrm{resp.}~\Sigma^1_1)\text{-}\mathsf{DC}_0$ and…
The paper studies properties of functional dependencies between strategies of players in Nash equilibria of multi-player strategic games. The main focus is on the properties of functional dependencies in the context of a fixed dependency…
We designed and built a game called \textit{Immersive Text Game}, which allows the player to choose a story and a character, and interact with other characters in the story in an immersive manner of dialogues. The game is based on several…
We study the limits of linear time evaluation of conjunctive queries under constraints expressed as tuple-generating dependencies (TGDs), across several modes of query evaluation: single-testing, all-testing, counting, lexicographic direct…
We prove consistency of intensional Martin-L\"of type theory (MLTT) with formal Church's thesis (CT), which was open for at least fifteen years. The difficulty in proving the consistency is that a standard method of realizability \`{a} la…
We use type-theoretic techniques to present an algebraic theory of $\infty$-categories with strict units. Starting with a known type-theoretic presentation of fully weak $\infty$-categories, in which terms denote valid operations, we extend…
The paper studies properties of functional dependencies between strategies of players in Nash equilibria of multi-player strategic games. The main focus is on the properties of functional dependencies in the context of a fixed dependency…
We study the conditions under which the iterated elimination of strictly dominated strategies is order independent and we identify a class of discontinuous games for which order does not matter. In this way, we answer the open problem…
We present a central limit theorem for stationary random fields that are short-range dependent and asymptotically independent. As an application, we present a central limit theorem for an infinite family of interacting It\^o-type diffusion…
We present a type theory dealing with non-linear, "ordinary" dependent types (which we will call cartesian) and linear types, where both constructs may depend on terms of the former. In the interplay between these, we find new type formers…
In games with a large number of players where players may have overlapping objectives, the analysis of stable outcomes typically depends on player types. A special case is when a large part of the player population consists of imitation…
In imperfect-information games, agents must make decisions based on partial knowledge of the game state. The Belief Stochastic Game model addresses this challenge by delegating state estimation to the game model itself. This allows agents…
We present a type-theoretic framework for reasoning about incorrectness in functional programs that interact with effectful, opaque library APIs. Our approach centers on traces -- temporally-ordered sequences of library API invocations --…