Search Results - "Theory of computation Formal languages and automata theory Formalisms"

A Relational Theory of Monadic Rewriting Systems, Part I by Gavazzo, Francesco, Faggian, Claudia

“…Motivated by the study of effectful programming languages and computations, we introduce a relational theory of monadic rewriting systems. The latter are…”
Get full text

Parikh's theorem for infinite alphabets by Hofman, Piotr, Juzepczuk, Marta, Lasota, Slawomir, Pattathurajan, Mohnish

“…We investigate commutative images of languages recognised by register automata and grammars. Semi-linear and rational sets can be naturally extended to this…”
Get full text

Positive First-order Logic on Words by Kuperberg, Denis

“…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…”
Get full text

Incremental Context-free Grammar Inference in Black Box Settings by Li, Feifei, Chen, Xiao, Xiao, Xi, Sun, Xiaoyu, Chen, Chuan, Wang, Shaohua, Han, Jitao

“…Black-box context-free grammar inference presents a significant challenge in many practical settings due to limited access to example programs. The…”
Get full text

SD-Regular Transducer Expressions for Aperiodic Transformations by Dartois, Luc, Gastin, Paul, Krishna, Shankara Narayanan

“…FO transductions, aperiodic deterministic two-way transducers, as well as aperiodic streaming string transducers are all equivalent models for first order…”
Get full text

Behavioural Preorders via Graded Monads by Ford, Chase, Milius, Stefan, Schroder, Lutz

“…Like notions of process equivalence, behavioural preorders on processes come in many flavours, ranging from fine-grained comparisons such as ready simulation…”
Get full text

Combining Nondeterminism, Probability, and Termination: Equational and Metric Reasoning by Mio, Matteo, Sarkis, Ralph, Vignudelli, Valeria

“…We study monads resulting from the combination of nondeterministic and probabilistic behaviour with the possibility of termination, which is essential in…”
Get full text

A Database Dependent Framework for K-Input Maximum Fanout-Free Window Rewriting by Zhu, Xuliang, Tang, Ruofei, Chen, Lei, Li, Xing, Huang, Xin, Yuan, Mingxuan, Sheng, Weihua, Xu, Jianliang

“…Rewriting is a widely used logic optimization approach incorporated in most commercial logic synthesis tools. In this paper, we present a new rewriting method…”
Get full text

Fixed-Points for Quantitative Equational Logics by Mardare, Radu, Panangaden, Prakash, Plotkin, Gordon

“…We develop a fixed-point extension of quantitative equational logic and give semantics in one-bounded complete quantitative algebras. Unlike previous related…”
Get full text

The Smash Product of Monoidal Theories by Hadzihasanovic, Amar

“…The tensor product of props was defined by Hackney and Robertson as an extension of the Boardman-Vogt product of operads to more general monoidal theories…”
Get full text

Constraint Satisfaction Problems over Finite Structures by Barto, Libor, DeMeo, William, Mottet, Antoine

“…We initiate a systematic study of the computational complexity of the Constraint Satisfaction Problem (CSP) over finite structures that may contain both…”
Get full text

Types Are Internal ∞-Groupoids by Finster, Eric, Allioux, Antoine, Sozeau, Matthieu

“…By extending type theory with a universe of definitionally associative and unital polynomial monads, we show how to arrive at a definition of opetopic type…”
Get full text

An Algebraic Characterisation of First-Order Logic with Neighbour by Manuel, Amaldev, Nevatia, Dhruv

“…We give an algebraic characterisation of first-order logic with the neighbour relation, on finite words. For this, we consider languages of finite words over…”
Get full text

Varieties of Languages in a Category by Adamek, Jiri, Myers, Robert S. R., Urbat, Henning, Milius, Stefan

“…Eilenberg's variety theorem, a centerpiece of algebraic automata theory, establishes a bijective correspondence between varieties of languages and…”
Get full text

Monadic Second-Order Logic and Bisimulation Invariance for Coalgebras by Enqvist, Sebastian, Seifan, Fatemeh, Venema, Yde

“…Generalizing standard monadic second-order logic for Kripke models, we introduce monadic second-order logic MSO(T) interpreted over co algebras for an…”
Get full text

Programs for Cheap by Hackett, Jennifer, Hutton, Graham

“…Write down the definition of a recursion operator on a piece of paper. Tell me its type, but be careful not to let me see the operator's definition. I will…”
Get full text

Term rewriting and lambda calculus by Klop, Jan Willem

Get full text

Graph rewriting and transformation (GReAT): a solution for the model integrated computing (MIC) bottleneck by Agrawal, Aditya

“…Graph grammars and transformations (GGT) have been a field of theoretical study for over two decades. However, it has produced only a handful of practical…”
Get full text

Normalization for Cubical Type Theory by Sterling, Jonathan, Angiuli, Carlo

“…We prove normalization for (univalent, Cartesian) cubical type theory, closing the last major open problem in the syntactic metatheory of cubical type theory…”
Get full text

Comonadic semantics for guarded fragments by Abramsky, Samson, Marsden, Dan

“…In previous work ([1], [2], [3]), it has been shown how a range of model comparison games which play a central role in finite model theory, including…”
Get full text