Predicative theories of continuous lattices

Subjects: “…Computer Science & IT…”
Get full text

A realizability semantics for inductive formal topologies, Church's Thesis and Axiom of Choice

Subjects: “…Computer Science & IT…”
Get full text

Star Games and Hydras

Subjects: “…Computer Science & IT…”
Get full text

Interface Modeling for Quality and Resource Management

Subjects: “…Computer Science & IT…”
Get full text

Theories of real addition with and without a predicate for integers

Subjects: “…Computer Science & IT…”
Get full text

Presentable signatures and initial semantics

Subjects: “…Computer Science & IT…”
Get full text

Computable analysis and notions of continuity in Coq

Subjects: “…Computer Science & IT…”
Get full text

Partially Ordered Automata and Piecewise Testability

Subjects: “…Computer Science & IT…”
Get full text

Decidability for Entailments of Symbolic Heaps with Arrays

Subjects: “…Computer Science & IT…”
Get full text

Parametric updates in parametric timed automata

Subjects: “…Computer Science & IT…”
Get full text

DRAT and Propagation Redundancy Proofs Without New Variables

Subjects: “…Computer Science & IT…”
Get full text

Failure Trace Semantics for a Process Algebra with Time-outs

Subjects: “…Computer Science & IT…”
Get full text

LNL-FPC: The Linear/Non-linear Fixpoint Calculus

Subjects: “…Computer Science & IT…”
Get full text

Constructing Higher Inductive Types as Groupoid Quotients

Subjects: “…Computer Science & IT…”
Get full text

Reachability Switching Games

Subjects: “…Computer Science & IT…”
Get full text

Logic for exact real arithmetic

Subjects: “…Computer Science & IT…”
Get full text

Algebraic Language Theory for Eilenberg--Moore Algebras

Subjects: “…Computer Science & IT…”
Get full text

Sculptures in Concurrency

Subjects: “…Computer Science & IT…”
Get full text

Direct spectra of Bishop spaces and their limits

Subjects: “…Computer Science & IT…”
Get full text

Semipullbacks of labelled Markov processes

Subjects: “…Computer Science & IT…”
Get full text