相关论文: Intersection Types and Lambda Theories
Lattice theoretical generalizations of some classical linear algebra results are formulated. A vector space is replaced by its subspace lattice and a linear map is replaced by the induced lattice map. This map is a complete join…
We introduce the Delta-framework, LF-Delta, a dependent type theory based on the Edinburgh Logical Framework LF, extended with the strong proof-functional connectives, i.e. strong intersection, minimal relevant implication and strong union.…
We prove an extensionality theorem for the "type-in-type" dependent type theory with Sigma-types. We suggest that the extensional equality type be identified with the logical equivalence relation on the free term model of type theory.
We prove a generalization of Fulton's conjecture which relates intersection theory on an arbitrary flag variety to invariant theory.
Driven by the interest of reasoning about probabilistic programming languages, we set out to study a notion of unicity of normal forms for them. To provide a tractable proof method for it, we define a property of distribution confluence…
We use machine learning to classify examples of braids (or flat braids) as trivial or non-trivial. Our ML takes form of supervised learning using neural networks (multilayer perceptrons). When they achieve good results in classification, we…
In our previous papers, together with J. Paseka we introduced so-called sectionally pseudocomplemented lattices and posets and illuminated their role in algebraic constructions. We believe that - similar to relatively pseudocomplemented…
Coincidence site lattices of oblique planar lattices are algebraically characterized using as basic tool the Cartan-Dieudonn\'e theorem, that is, the decomposition of an orthogonal transformation as a product of reflections. The case of…
Humans have a remarkable ability to use physical commonsense and predict the effect of collisions. But do they understand the underlying factors? Can they predict if the underlying factors have changed? Interestingly, in most cases humans…
We introduce new formulations of aperiodicity and cofinality for finitely aligned higher-rank graphs \Lambda, and prove that C*(\Lambda) is simple if and only if \Lambda is aperiodic and cofinal. The main advantage of our versions of…
Let $\Lambda$ be a finite-dimensional associative algebra. The torsion classes of $mod\, \Lambda$ form a lattice under containment, denoted by $tors\, \Lambda$. In this paper, we characterize the cover relations in $tors\, \Lambda$ by…
Statistical modeling is a key component in the extraction of physical results from lattice field theory calculations. Although the general models used are often strongly motivated by physics, many model variations can frequently be…
We introduce a notion of a filtered model structure and use this notion to produce various model structures on pro-categories. This framework generalizes several known examples. We give several examples, including a homotopy theory for…
Following the types-as-sets paradigm, we present a mechanized embedding of dependent function types with a hierarchy of universes into schematic first-order logic with equality, with axiom schemas of Tarski-Grothendieck set theory. We carry…
A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…
Intertwiners between \ade lattice models are presented and the general theory developed. The intertwiners are discussed at three levels: at the level of the adjacency matrices, at the level of the cell calculus intertwining the face…
This text is devoted to the theory of varieties, which provides an important tool, based in universal algebra, for the classification of regular languages. In the introductory section, we present a number of examples that illustrate and…
In this paper we present local Sternberg conjugation theorems near attracting fixed points for lattice systems. The interactions are spatially decaying and are not restricted to finite distance. The conjugations obtained retain the same…
We study Milner's lambda-calculus with partial substitutions. Particularly, we show confluence on terms and metaterms, preservation of \b{eta}-strong normalisation and characterisation of strongly normalisable terms via an intersection…
We show that all finite lattices, including non-distributive lattices, arise as stable matching lattices when all agents have path-independent choice functions. This result answers an open question of Blair~\cite{blair1988lattice}. In the…