Related papers: Intersection Subtyping with Constructors
Decorator design pattern is a well known pattern that allows dynamical attachment of additional functionality to an object. Decorators have been proposed as flexible alternative to subclassing for extending functionality. Still, the…
A typoid is a type equipped with an equivalence relation, such that the terms of equivalence between the terms of the type satisfy certain conditions, with respect to a given equivalence relation between them, that generalise the properties…
Consider a collection of vector subspaces of a given vector space and a collection of projectors on these vector spaces, can we decompose the vector space into a product of vector subspaces such that the projectors are isomorphic to…
The lambda calculus with constructors is an extension of the lambda calculus with variadic constructors. It decomposes the pattern-matching a la ML into a case analysis on constants and a commutation rule between case and application…
We propose a means to relate properties of an interconnected system to its separate component systems in the presence of cascade-like phenomena. Building on a theory of interconnection reminiscent of the behavioral approach to systems…
In these notes we investigate BIBDs with $\lambda=1$ that present subdesigns evenly covering both blocks and vertices: we determine some of their basic properties, consequence of already existing results in the literature, with regards to…
Of the complex features of generic nominally-typed OO type systems, wildcard types and variance annotations are probably the hardest to fully grasp. As demonstrated when adding closures (a.k.a., lambdas) and when extending type inference in…
A notion of a coring extension is defined and it is related to the existence of an additive functor between comodule categories that factorises through forgetful functors. This correspondence between coring extensions and factorisable…
Multilevel modeling extends traditional modeling techniques with a potentially unlimited number of abstraction levels. Multilevel models can be formally represented by multilevel typed graphs whose manipulation and transformation are…
Becker (1973) presents a bilateral matching model in which scalar types describe agents. For this framework, he establishes the conditions under which positive sorting between agents' attributes is the unique market outcome. Becker's…
Sized types are a modular and theoretically well-understood tool for checking termination of recursive and productivity of corecursive definitions. The essential idea is to track structural descent and guardedness in the type system to make…
We introduce constructible directed complexes, a combinatorial presentation of higher categories inspired by constructible complexes in poset topology. Constructible directed complexes with a greatest element, called atoms, encompass common…
We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying graph topology, which have recently found numerous applications. Such…
Dependently typed proof assistant rely crucially on definitional equality, which relates types and terms that are automatically identified in the underlying type theory. This paper extends type theory with definitional functor laws,…
We survey the extensions of a group by a group using crossed products instead of exact sequences of groups. The approach has various advantages, one of them being that the crossed product is an universal object. Several new applications are…
We obtain the most general type B 3-fold supersymmetry by solving directly the intertwining relation. We then show that it is a necessary and sufficient condition for a second-order linear differential operator to have three linearly…
Semantic subtyping enables simple, set-theoretical reasoning about types by interpreting a type as the set of its values. Previously, semantic subtyping has been studied primarily in the context of statically typed languages with structural…
We develop an obstruction theory for Hirsch extensions of cbba's with twisted coefficients. This leads to a variety of applications, including a structural theorem for minimal cbba's, a construction of relative minimal models with twisted…
A. Silverberg (IEEE Trans. Inform. Theory 49, 2003) proposed a question on the equivalence of identifiable parent property and traceability property for Reed-Solomon code family. Earlier studies on Silverberg's problem motivate us to think…
In order to apply nonstandard methods to questions of algebraic geometry we continue our investigation from "Enlargements of categories" (Theory Appl. Categ. 14 (2005), No. 16, 357--398) and show how important homotopical constructions…