Zobrazeno 1 - 10
of 82
pro vyhledávání: '"URBAT, HENNING"'
Levy's call-by-push-value is a comprehensive programming paradigm that combines elements from functional and imperative programming, supports computational effects and subsumes both call-by-value and call-by-name evaluation strategies. In the present
Externí odkaz:
http://arxiv.org/abs/2410.17045
Regular languages - the languages accepted by deterministic finite automata - are known to be precisely the languages recognized by finite monoids. This characterization is the origin of algebraic language theory. In the present paper, we generalize
Externí odkaz:
http://arxiv.org/abs/2410.12569
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
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
Publikováno v:
FoSSaCS 2024. Lecture Notes in Computer Science, vol 14574. Springer, Cham
Extensions of Stone-type dualities have a long history in algebraic logic and have also been instrumental for proving results in algebraic language theory. We show how to extend abstract categorical dualities via monoidal adjunctions, subsuming vario
Externí odkaz:
http://arxiv.org/abs/2401.08219
Publikováno v:
Electronic Notes in Theoretical Informatics and Computer Science, Volume 4 - Proceedings of MFPS XL (December 11, 2024) entics:14598
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 present a systematic approach to logical predicates based on universal coalgebra and higher-order abstract GSOS, thus making a first step towards a unifying theory of logical relations. We first observe that logical predicates are special cases of
Externí odkaz:
http://arxiv.org/abs/2401.05872
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