Related papers: Positionality of Dumont--Thomas numeration systems…
Much recent work has shown how cross-linguistic variation is constrained by competing pressures from efficient communication. However, little attention has been paid to the role of the systematicity of forms (regularity), a key property of…
Integrating diverse formalisms into modular knowledge representation systems offers increased expressivity, modeling convenience and computational benefits. We introduce concepts of abstract modules and abstract modular systems to study…
Compositionality proofs in higher-order languages are notoriously involved, and general semantic frameworks guaranteeing compositionality are hard to come by. In particular, Turi and Plotkin's bialgebraic abstract GSOS framework, which…
For general non-classical systems, we study the different classical representations that fulfill the specific context dependence imposed by the hidden measurement system formalism introduced in quant-ph/0008061. We show that the collection…
Extending the lambda-calculus with a construct for sharing, such as let expressions, enables a special representation of terms: iterated applications are decomposed by introducing sharing points in between any two of them, reducing to the…
Symmetries in the Lagrangian formalism of arbitrary order are analysed with the help of the so-called Anderson-Duchamp-Krupka equations. For the case of second order equations and a scalar field we establish a polynomial structure in the…
The apparent positions of planets are determined by means of the fundamental ephemerides, the precession-nutation models of the Earth, the gravitational effects and aberrations et al. Around 2000, many astrometrical conceptions, models and…
Higher-order representations of objects such as programs, proofs, formulas and types have become important to many symbolic computation tasks. Systems that support such representations usually depend on the implementation of an intensional…
We introduce a new technique for constructing a finite state deterministic automaton from a regular expression, based on the idea of marking a suitable set of positions inside the expression, intuitively representing the possible points…
Anderson localization provides a challenge to numerical approaches due to the inherent randomness, and hence absence of simple symmetries, in its discrete Hamiltonian representation. Numerous algorithmic approaches have been developed or…
Logics and automata models for languages over infinite alphabets, such as Freeze LTL and register automata, serve the verification of processes or documents with data. They relate tightly to formalisms over nominal sets, such as…
Self-adjusting computation offers a language-based approach to writing programs that automatically respond to dynamically changing data. Recent work made significant progress in developing sound semantics and associated implementations of…
We study multidimensional configurations (infinite words) and subshifts of low pattern complexity using tools of algebraic geometry. We express the configuration as a multivariate formal power series over integers and investigate the setup…
We present an Angluin-style algorithm to learn nominal automata, which are acceptors of languages over infinite (structured) alphabets. The abstract approach we take allows us to seamlessly extend known variations of the algorithm to this…
Since the introduction of strong anticipation by D.~Dubois the numerous investigations of concrete systems have been proposed. In proposed paper the new examples of discrete dynamical systems with anticipation are considered. The…
Motivated by the study of Fibonacci-like Wang shifts, we define a numeration system for $\mathbb{Z}$ and $\mathbb{Z}^2$ based on the binary alphabet $\{0,1\}$. We introduce a set of 16 Wang tiles that admits a valid tiling of the plane…
In this article, we investigate the decoding of the rank metric Reed--Muller codes introduced by Augot, Couvreur, Lavauzelle and Neri in 2021. These codes are defined from Abelian Galois extensions extending the construction of Gabidulin…
We present semantic correctness proofs of forward-mode Automatic Differentiation (AD) for languages with sources of partiality such as partial operations, lazy conditionals on real parameters, iteration, and term and type recursion. We…
We define a general notion of transition system where states and action labels can be from arbitrary nominal sets, actions may bind names, and state predicates from an arbitrary logic define properties of states. A Hennessy-Milner logic for…
Computation models and specification methods seem to be worlds apart. The project on abstract state machines (in short ASMs, also known as evolving algebras) started as an attempt to bridge the gap by improving on Turing's thesis. We sought…