CSL18: COMPUTER SCIENCE LOGIC 2018

A
Abramsky, Samson	Whither Semantics? Relating Structure and Power: Comonadic Semantics for Computational Resources
Abu Zaid, Faried	Climbing up the elementary complexity classes with theories of automatic structures
Ahrens, Benedikt	High-level arities and initial semantics
Alcolei, Aurore	The True Concurrency of Herbrand's Theorem
Altenkirch, Thorsten	The Partiality Monad
Angiuli, Carlo	Cartesian Cubical Computational Type Theory: Constructive Reasoning with Paths and Equalities
Ariola, Zena	Beyond Polarity: Towards A Multi-Discipline Intermediate Language with Sharing
Atserias, Albert	Definable Inapproximability: New Challenges for Duplicator
Avron, Arnon	Safety, Absoluteness, and Computability
B
Baillot, Patrick	Combining Linear Logic and Size Types for Implicit Complexity
Basset, Nicolas	Beyond admissibility: Dominance between chains of strategies
Behr, Nicolas	Rule Algebras for Adhesive Categories
Bodirsky, Manuel	Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains
Bonchi, Filippo	Graphical Conjunctive Queries
Bouyer, Patricia	Finite bisimulations for dynamical systems with overlapping trajectories
Bérard, Béatrice	Finite bisimulations for dynamical systems with overlapping trajectories
C
Chadha, Rohit	Approximating Probabilistic Automata
Chouquet, Jules	An application of parallel cut elimination in unit-free multiplicative linear logic to the Taylor expansion of proof nets
Clairambault, Pierre	The True Concurrency of Herbrand's Theorem Fully abstract models of the probabilistic lambda-calculus
Coecke, Bob	From Quantum to Cognition via Pictures
Cohen, Liron	Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent
D
Das, Anupam	A recursion-theoretic characterisation of the positive polynomial-time functions Non-wellfounded proof theory for (Kleene+action)(algebras+lattices)
Dawar, Anuj	Definable Inapproximability: New Challenges for Duplicator Symmetric Circuits for Rank Logic
Doumane, Amina	Ackermann Award Lecture
Downen, Paul	Beyond Polarity: Towards A Multi-Discipline Intermediate Language with Sharing
F
Ferrarotti, Flavio	Expressivity within second-order transitive-closure logic
Fijalkow, Nathanaël	Quantifying Bounds in Strategy Logic
Filiot, Emmanuel	Specification and Computation of Word Transductions
G
Gehrke, Mai	Sheaves over domains
Ghyselen, Alexis	Combining Linear Logic and Size Types for Implicit Complexity
Gowers, W. John	A Fully Abstract Game Semantics for Countable Nondeterminism
Grädel, Erich	Dependency Concepts up to Equivalence
H
Harper, Robert	Cartesian Cubical Computational Type Theory: Constructive Reasoning with Paths and Equalities
Hirschowitz, André	High-level arities and initial semantics
Ho, Weng Kin	A Domain-Theoretic Silk Road
Hoelzel, Matthias	Dependency Concepts up to Equivalence
Hou Favonia, Kuen-Bang	Cartesian Cubical Computational Type Theory: Constructive Reasoning with Paths and Equalities
Huth, Michael	Achim Jung: a way above scholar on "way below"
Hyland, Martin	The True Concurrency of Herbrand's Theorem
J
Jecker, Ismaël	Beyond admissibility: Dominance between chains of strategies
Jugé, Vincent	Finite bisimulations for dynamical systems with overlapping trajectories
K
Kawata, Tor	A Contextual Reconstruction of Monadic Reflection
Krebs, Andreas	An algebraic decision procedure for two-variable logic with a between relation
Kuske, Dietrich	Climbing up the elementary complexity classes with theories of automatic structures
L
Lafont, Ambroise	High-level arities and initial semantics
Laird, James	A Fully Abstract Game Semantics for Countable Nondeterminism
Lawson, Jimmie	Looking for beauty in domain theory
Lev, Shahar	Safety, Absoluteness, and Computability
Levi, Nissan	Safety, Absoluteness, and Computability
Lindner, Peter	Climbing up the elementary complexity classes with theories of automatic structures
Lodaya, Kamal	An algebraic decision procedure for two-variable logic with a between relation
Lopez, Aliaume	Basic operational preorders for algebraic effects in general, and for combined probability and nondeterminism in particular
Lück, Martin	Canonical Models and the Complexity of Modal Team Logic
M
Madhusudan, P.	A Decidable Fragment of Second Order Logic With Applications to Synthesis
Maggesi, Marco	High-level arities and initial semantics
Mamino, Marcello	Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains
Marsden, Dan	Quantitative Foundations for Resource Theories
Mathur, Umang	A Decidable Fragment of Second Order Logic With Applications to Synthesis
Maubert, Bastien	Quantifying Bounds in Strategy Logic
McCusker, Guy	On compositionality of dinatural transformations
Mislove, Michael	Domains and Quantum Programming Languages
Murano, Aniello	Quantifying Bounds in Strategy Logic
N
Neider, Daniel	Synthesizing Optimally Resilient Controllers
Nollet, Rémi	Local validity for circular proofs in linear logic with fixed points
O
Oitavem, Isabel	A recursion-theoretic characterisation of the positive polynomial-time functions
P
Palamidessi, Catuscia	Fixed Points in Information Flow and in Privacy
Pandya, Paritosh	An algebraic decision procedure for two-variable logic with a between relation
Paquet, Hugo	Fully abstract models of the probabilistic lambda-calculus
Pauly, Arno	Beyond admissibility: Dominance between chains of strategies
Pfenning, Frank	Adjoint Logic
Pous, Damien	Non-wellfounded proof theory for (Kleene+action)(algebras+lattices)
R
Raskin, Jean-Francois	Beyond admissibility: Dominance between chains of strategies
Rowe, Reuben	Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent
Rubin, Sasha	Quantifying Bounds in Strategy Logic
S
Saha, Shambwaditya	A Decidable Fragment of Second Order Logic With Applications to Synthesis
Santamaria, Alessio	On compositionality of dinatural transformations
Saurin, Alexis	Local validity for circular proofs in linear logic with fixed points
Schewe, Sven	Parity Games with Weights
Seeber, Jens	Graphical Conjunctive Queries
Shah, Nihil	Relating Structure and Power: Comonadic Semantics for Computational Resources
Simpson, Alex	Functionals on probability valuations Basic operational preorders for algebraic effects in general, and for combined probability and nondeterminism in particular
Sistla, A. Prasad	Approximating Probabilistic Automata
Sobocinski, Pawel	Rule Algebras for Adhesive Categories Graphical Conjunctive Queries
Straubing, Howard	An algebraic decision procedure for two-variable logic with a between relation
T
Tasson, Christine	A linear logic approach to the semantics of probabilistic programs Local validity for circular proofs in linear logic with fixed points
Terui, Kazushige	MacNeille completion and Buchholz' Omega rule for parameter-free second order logics
Toruńczyk, Szymon	Some applications of Model Theory in Computer Science
V
Van den Bogaard, Marie	Beyond admissibility: Dominance between chains of strategies
Van den Bussche, Jan	Expressivity within second-order transitive-closure logic
Vaux Auclair, Lionel	An application of parallel cut elimination in unit-free multiplicative linear logic to the Taylor expansion of proof nets
Viola, Caterina	Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains
Virtema, Jonni	Expressivity within second-order transitive-closure logic
Viswanathan, Mahesh	A Decidable Fragment of Second Order Logic With Applications to Synthesis Approximating Probabilistic Automata
W
Weinert, Alexander	Parity Games with Weights Synthesizing Optimally Resilient Controllers
Wilsenach, Gregory	Symmetric Circuits for Rank Logic
Winskel, Glynn	The True Concurrency of Herbrand's Theorem
Z
Zimmermann, Martin	Parity Games with Weights Synthesizing Optimally Resilient Controllers
Zwart, Maaike	Quantitative Foundations for Resource Theories

Disclaimer | Powered by EasyChair Smart Program