E-Books durchsuchen
Foundations of Software Science and Computation Structures [2021]
- 1
-
Constructing a universe for the setoid model
- 2
-
Nominal Equational Problems
- 3
-
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy
- 4
-
Fixpoint Theory – Upside Down
- 5
-
“Most of” leads to undecidability: Failure of adding frequencies to LTL
- 6
-
Combining Semilattices and Semimodules
- 7
-
One-way Resynchronizability of Word Transducers
- 8
-
Fair Refinement for Asynchronous Session Types
- 9
-
Running Time Analysis of Broadcast Consensus Protocols
- 10
-
Leafy automata for higher-order concurrency
- 11
-
Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logic
- 12
-
Generalized Bounded Linear Logic and its Categorical Semantics
- 13
-
Focused Proof-search in the Logic of Bunched Implications
- 14
-
Interpolation and Amalgamation for Arrays with MaxDiff
- 15
-
Adjoint Reactive GUI Programming
- 16
-
On the Expressiveness of Büchi Arithmetic
- 17
-
Parametricity for Primitive Nested Types
- 18
-
The Spirit of Node Replication
- 19
-
Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages
- 20
-
Certifying Inexpressibility
- 21
-
A General Semantic Construction of Dependent Refinement Type Systems, Categorically
- 22
-
Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP
- 23
-
Nondeterministic Syntactic Complexity
- 24
-
A String Diagrammatic Axiomatisation of Finite-State Automata
- 25
-
Work-sensitive Dynamic Complexity of Formal Languages
- 26
-
Learning Pomset Automata
- 27
-
The Structure of Sum-Over-Paths, its Consequences, and Completeness for Clifford
- 28
-
A Quantified Coalgebraic van Benthem Theorem