Related papers: Ticking clocks as dependent right adjoints: Denota…
In this paper a procedure is described which allows to identify new systems of nonlinear recursions whose solutions are controllable and which may be asymptotically isochronous as functions of the independent variable (considered a ticking…
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…
In this paper we combine the principled approach to modalities from multimodal type theory (MTT) with the computationally well-behaved realization of identity types from cubical type theory (CTT). The result -- cubical modal type theory…
In this paper we introduce Commutative/Non-Commutative Logic (CNC logic) and two categorical models for CNC logic. This work abstracts Benton's Linear/Non-Linear Logic by removing the existence of the exchange structural rule. One should…
Languages may encode similar meanings using different sentence structures. This makes it a challenge to provide a single set of formal rules that can derive meanings from sentences in many languages at once. To overcome the challenge, we…
A temporal logic is presented for reasoning about the correctness of timed concurrent constraint programs. The logic is based on modalities which allow one to specify what a process produces as a reaction to what its environment inputs.…
Type classes are an elegant extension to traditional, Hindley-Milner based typing systems. They are used in modern, typed languages such as Haskell to support controlled overloading of symbols. Haskell 98 supports only single-parameter and…
Let $T$ be an infinitely generated tilting module of projective dimension at most one over an arbitrary associative ring $A$, and let $B$ be the endomorphism ring of $T$. In this paper, we prove that if $T$ is good then there exists a ring…
The central role of the lexicon in Meaning-Text Theory (MTT) and other dependency-based linguistic theories cannot be replicated in linguistic theories based on context-free grammars (CFGs). We describe Tree Adjoining Grammar (TAG) as a…
We propose an extension of pure type systems with an algebraic presentation of inductive and co-inductive type families with proper indices. This type theory supports coercions toward from smaller sorts to bigger sorts via explicit type…
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…
A typical way of analyzing the time complexity of functional programs is to extract a recurrence expressing the running time of the program in terms of the size of its input, and then to solve the recurrence to obtain a big-O bound. For…
This thesis is concerned with type-logical grammars and their practical applicability as tools of reasoning about sentence syntax and semantics. The focal point is narrowed to Dutch, a language exhibiting a large degree of word order…
We give a construction of triangulated categories as quotients of exact categories where the subclass of objects sent to zero is defined by a triple of functors. This includes the cases of homotopy and stable module categories. These…
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.…
There are many category-theoretic notions of algebraic theory, including Lawvere theories, monads, PROPs and operads. The first central notion of this thesis is a common generalisation of these, which we call a proto-theory. In order to…
Let A be an algebra with a countable basis and let B be, say, a Frechet algebra that contains A as a dense subalgebra. This embedding induces a functor from the derived category of B-modules to the derived category of A-modules. In many…
The expressiveness of dependent type theory can be extended by identifying types modulo some additional computation rules. But, for preserving the decidability of type-checking or the logical consistency of the system, one must make sure…
An important result in tilting theory states that a class of modules over a ring is a tilting class if and only if it is the Ext-orthogonal class to a set of compact modules of bounded projective dimension. Moreover, cotilting classes are…
Quantile clocks are defined as convolutions of subordinators $L$, with quantile functions of positive random variables. We show that quantile clocks can be chosen to be strictly increasing and continuous and discuss their practical modeling…