Linked e-resources
Details
Table of Contents
Types
Comprehensive parametric polymorphism: categorical models and type theory
Guarded Dependent Type Theory with Coinductive Types
Dependent Types and Fibred Computational Effects
Game Semantics for Bounded Polymorphism
Recursion and Fixed-Points Join Inverse Categories as Models of Reversible Recursion
A Coalgebraic View of Bar Recursion and Bar Induction
A New Foundation for Finitary Corecursion
Fixed-point elimination in the Intuitionistic Propositional Calculus
Verification and Program Analysis. A Theory of Monitors
Contextual approximation and higher-order procedures
A Theory of Slicing for Probabilistic Control Flow Graphs
Verification of parameterized communicating automata via split-width
Automata, Logic, Games
Robust Equilibria in Mean-Payoff Games
Quantifier Alternation for Infinite Words.-Synchronizing automata over nested words
On Freeze LTL with Ordered Attributes
Regular transformations of data words through origin information
Probabilistic and Timed Systems
Trace Refinement in Labelled Markov Decision Processes
Qualitative Analysis of VASS-Induced MDPs
Metric Temporal Logic with Counting
Distributed Synthesis in Continuous Time
Proof Theory and Lambda Calculus Unary Resolution: Characterizing Ptime
Focused and Synthetic Nested Sequents
Strong Normalizability as a Finiteness Structure via the Taylor Expansion of lambda-terms
Reasoning about call-by-need by means of types
Algorithms for Infinite Systems Coverability Trees for Petri Nets with Unordered Data
Shortest paths in one-counter systems
The Invariance Problem for Matrix Semigroups
Order-Sorted Rewriting and Congruence Closure
Monads
Towards a formal theory of graded monads
Profinite Monads, Profinite Equations, and Reiterman's Theorem.
Comprehensive parametric polymorphism: categorical models and type theory
Guarded Dependent Type Theory with Coinductive Types
Dependent Types and Fibred Computational Effects
Game Semantics for Bounded Polymorphism
Recursion and Fixed-Points Join Inverse Categories as Models of Reversible Recursion
A Coalgebraic View of Bar Recursion and Bar Induction
A New Foundation for Finitary Corecursion
Fixed-point elimination in the Intuitionistic Propositional Calculus
Verification and Program Analysis. A Theory of Monitors
Contextual approximation and higher-order procedures
A Theory of Slicing for Probabilistic Control Flow Graphs
Verification of parameterized communicating automata via split-width
Automata, Logic, Games
Robust Equilibria in Mean-Payoff Games
Quantifier Alternation for Infinite Words.-Synchronizing automata over nested words
On Freeze LTL with Ordered Attributes
Regular transformations of data words through origin information
Probabilistic and Timed Systems
Trace Refinement in Labelled Markov Decision Processes
Qualitative Analysis of VASS-Induced MDPs
Metric Temporal Logic with Counting
Distributed Synthesis in Continuous Time
Proof Theory and Lambda Calculus Unary Resolution: Characterizing Ptime
Focused and Synthetic Nested Sequents
Strong Normalizability as a Finiteness Structure via the Taylor Expansion of lambda-terms
Reasoning about call-by-need by means of types
Algorithms for Infinite Systems Coverability Trees for Petri Nets with Unordered Data
Shortest paths in one-counter systems
The Invariance Problem for Matrix Semigroups
Order-Sorted Rewriting and Congruence Closure
Monads
Towards a formal theory of graded monads
Profinite Monads, Profinite Equations, and Reiterman's Theorem.