Zobrazeno 1 - 10
of 6 506
pro vyhledávání: '"Milius A"'
Formal languages over infinite alphabets serve as abstractions of structures and processes carrying data. Automata models over infinite alphabets, such as classical register automata or, equivalently, nominal orbit-finite automata, tend to have compu
Externí odkaz:
http://arxiv.org/abs/2408.03658
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 provides off-t
Externí odkaz:
http://arxiv.org/abs/2405.16708
Autor:
Wißmann, Thorsten, Milius, Stefan
The initial algebra for an endofunctor F provides a recursion and induction scheme for data structures whose constructors are described by F. The initial-algebra construction by Ad\'amek (1974) starts with the initial object (e.g. the empty set) and
Externí odkaz:
http://arxiv.org/abs/2405.09504
Logical relations constitute a key method for reasoning about contextual equivalence of programs in higher-order languages. They are usually developed on a per-case basis, with a new theory required for each variation of the language or of the desire
Externí odkaz:
http://arxiv.org/abs/2402.00625
Many important computational structures involve an intricate interplay between algebraic features (given by operations on the underlying set) and relational features (taking account of notions such as order or distance). This paper investigates algeb
Externí odkaz:
http://arxiv.org/abs/2401.08445
We propose a novel topological perspective on data languages recognizable by orbit-finite nominal monoids. For this purpose, we introduce pro-orbit-finite nominal topological spaces. Assuming globally bounded support sizes, they coincide with nominal
Externí odkaz:
http://arxiv.org/abs/2304.13337
Positive data languages are languages over an infinite alphabet closed under possibly non-injective renamings of data values. Informally, they model properties of data words expressible by assertions about equality, but not inequality, of data values
Externí odkaz:
http://arxiv.org/abs/2304.12947
The Vietoris space of compact subsets of a given Hausdorff space yields an endofunctor $\mathscr V$ on the category of Hausdorff spaces. Vietoris polynomial endofunctors on that category are built from $\mathscr V$, the identity and constant functors
Externí odkaz:
http://arxiv.org/abs/2303.11071
Higher-order abstract GSOS is a recent extension of Turi and Plotkin's framework of Mathematical Operational Semantics to higher-order languages. The fundamental well-behavedness property of all specifications within the framework is that coalgebraic
Externí odkaz:
http://arxiv.org/abs/2302.08200
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 has been succe
Externí odkaz:
http://arxiv.org/abs/2210.13387