Linked e-resources
Details
Table of Contents
Semantics
Non-angelic Concurrent Game Semantics
A Trace Semantics for System F Parametric Polymorphism
Categorical Combinatorics for Non Deterministic Strategies on Simple Games
A Syntactic View of Computational Adequacy
Linearity
A New Linear Logic for Deadlock-Free Session-Typed Processes
A Double Category Theoretic Analysis of Graded Linear Exponential Comonads
Depending on Session-Typed Processes
FabULous Interoperability for ML and a Linear Language
Concurrency
Automata for True Concurrency Properties
A Theory of Encodings and Expressiveness
A Framework for Parameterized Monitorability
Logics for Bisimulation and Divergence
Lambda-Calculi and Types
Call-by-need, Neededness and All That
Fitch-Style Modal Lambda Calculi
Realizability Interpretation and Normalization of Typed Call-by-Need
Quotient Inductive-Inductive Types
Category Theory and Quantum Control
Guarded Traced Categories
Proper Semirings and Proper Convex Functors
From Symmetric Pattern-Matching to Quantum Control
Quantitative Models
The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes
A Hierarchy of Scheduler Classes for Stochastic Automata
Symbolically Quantifying Response Time in Stochastic Models using Moments and Semirings
Comparator Automata in Quantitative Verification
Logics and Equational Theories
Modular Tableaux Calculi for Separation Theories
Differential Calculus with Imprecise Input and its Logical Framework
The Effects of Adding Reachability Predicates in Propositional Separation Logic
The Equational Theory of the Natural Join and of Inner Union is Decidable
Graphs and Automata
Minimization of Graph Weighted Models over Circular Strings
Games on Graphs with a Public Signal Monitoring
WQO Dichotomy for 3-Graphs
Verifying Higher-Order Functions with Tree Automata.
Non-angelic Concurrent Game Semantics
A Trace Semantics for System F Parametric Polymorphism
Categorical Combinatorics for Non Deterministic Strategies on Simple Games
A Syntactic View of Computational Adequacy
Linearity
A New Linear Logic for Deadlock-Free Session-Typed Processes
A Double Category Theoretic Analysis of Graded Linear Exponential Comonads
Depending on Session-Typed Processes
FabULous Interoperability for ML and a Linear Language
Concurrency
Automata for True Concurrency Properties
A Theory of Encodings and Expressiveness
A Framework for Parameterized Monitorability
Logics for Bisimulation and Divergence
Lambda-Calculi and Types
Call-by-need, Neededness and All That
Fitch-Style Modal Lambda Calculi
Realizability Interpretation and Normalization of Typed Call-by-Need
Quotient Inductive-Inductive Types
Category Theory and Quantum Control
Guarded Traced Categories
Proper Semirings and Proper Convex Functors
From Symmetric Pattern-Matching to Quantum Control
Quantitative Models
The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes
A Hierarchy of Scheduler Classes for Stochastic Automata
Symbolically Quantifying Response Time in Stochastic Models using Moments and Semirings
Comparator Automata in Quantitative Verification
Logics and Equational Theories
Modular Tableaux Calculi for Separation Theories
Differential Calculus with Imprecise Input and its Logical Framework
The Effects of Adding Reachability Predicates in Propositional Separation Logic
The Equational Theory of the Natural Join and of Inner Union is Decidable
Graphs and Automata
Minimization of Graph Weighted Models over Circular Strings
Games on Graphs with a Public Signal Monitoring
WQO Dichotomy for 3-Graphs
Verifying Higher-Order Functions with Tree Automata.