Related papers: Nominal Topology for Data Languages
This is a survey of topological properties of open, complete nonpositively curved manifolds which may have infinite volume. Topics include topology of ends, restrictions on the fundamental group, as well as a review of known examples.
Numerical characteristics of polynomial identities of left nilpotent algebras are examined. Previously, we came up with a construction which, given an infinite binary word, allowed us to build a two-step left nilpotent algebra with…
Holonomic quantum computation makes use of non-abelian geometric phases, associated to the evolution of a subspace of quantum states, to encode logical gates. We identify a special class of subspaces, for which a sequence of rotations…
In the context of ontology-mediated querying with description logics (DLs), we study the data complexity of queries in which selected predicates can be closed (OMQCs). We provide a non-uniform analysis, aiming at a classification of the…
Data trees serve as an abstraction of structured data, such as XML documents. A number of specification formalisms for languages of data trees have been developed, many of them adhering to the paradigm of register automata, which is based…
We study nominal anti-unification, which is concerned with computing least general generalizations for given terms-in-context. In general, the problem does not have a least general solution, but if the set of atoms permitted in…
In low dimensional topology, we have some invariants defined by using solutions of some nonlinear elliptic operators. The invariants could be understood as Euler class or degree in the ordinary cohomology, in infinite dimensional setting.…
Nominal techniques provide a mathematically principled approach to dealing with names and variable binding in programming languages. This paper explores an attempt to make nominal techniques accessible as an Agda library. We aim for a…
Finite quantum groupoids can be described in many equivalent ways: In terms of the weak Hopf C*-algebras of B\"ohm, Nill, and Szlach\'anyi or the finite-dimensional Hopf-von Neumann bimodules of Vallin, and in terms of finite-dimensional…
We study FO+, a fragment of first-order logic on finite words, where monadic predicates can only appear positively. We show that there is an FO-definable language that is monotone in monadic predicates but not definable in FO+. This…
A sound and complete algorithm for nominal unification of higher-order expressions with a recursive let is described, and shown to run in nondeterministic polynomial time. We also explore specializations like nominal letrec-matching for…
Different notions for order convergence have been considered by various authors. Associated to every notion of order convergence corresponds a topology, defined by taking as the closed sets those subsets of the poset satisfying that no net…
For predual categories C and D we establish isomorphisms between opfibrations representing local varieties of languages in C, local pseudovarieties of D-monoids, and finitely generated profinite D-monoids. The global sections of these…
In this paper, we introduce a thinness in sense to a type of relative capacity for weighted variable exponent Sobolev space. Moreover, we reveal some properties of this thinness and consider the relationship with finely open and finely…
Call a semantics for a language with variables absolute when variables map to fixed entities in the denotation. That is, a semantics is absolute when the denotation of a variable a is a copy of itself in the denotation. We give a trio of…
We are motivated by the following question: which data languages admit an active learning algorithm? This question was left open in previous work by the authors, and is particularly challenging for languages recognised by nondeterministic…
The Eilenberg correspondence relates varieties of regular languages to pseudovarieties of finite monoids. Various modifications of this correspondence have been found with more general classes of regular languages on one hand and classes of…
In "Denotational semantics for programming languages, balanced quasi-metrics and fixed points" (International Journal of Computer Mathematics 85 (2008), 623-630), J. Rodr\'{i}guez-L\'{o}pez, S. Romaguera and O. Valero introduced and studied…
The majority of industrial-strength object-oriented (OO) software is written using nominally-typed OO programming languages. Extant domain-theoretic models of OOP developed to analyze OO type systems miss, however, a crucial feature of…
An important theorem in classical complexity theory is that LOGLOGSPACE=REG, i.e. that languages decidable with double-logarithmic space bound are regular. We consider a transfinite analogue of this theorem. To this end, we introduce…