FSCD 2024
10-13 July 2024
Tallinn - Estonia

FSCD 2024
Tallinn, Estonia, 10-13 July 2024


  • Tao Gu, Jialu Bao, Justin Hsu, Alexandra Silva and Fabio Zanasi. A Categorical Approach to DIBI Models
  • Victor Sannier and Patrick Baillot. A linear Type System for Lp-Metric Sensitivity Analysis
  • René Thiemann and Akihisa Yamada. A verified algorithm for deciding pattern completeness
  • Junyoung Jang, Sophia Roshal, Frank Pfenning and Brigitte Pientka. Adjoint Natural Deduction
  • Maximilian Doré, Evan Cavallo and Anders Mörtberg. Automating Boundary Filling in Cubical Agda
  • Aloÿs Dufour and Damiano Mazza. Böhm and Taylor for All!
  • Samson Abramsky, Serban Cercelescu and Carmen Maria Constantin. Commutation groups and state-independent contextuality
  • Camil Champin, Samuel Mimram and Oleon Emile. Delooping generated groups in homotopy type theory
  • Takahito Aoto, Naoki Nishida and Jonas Schöpf. Equational Theories and Validity for Logically Constrained Term Rewriting
  • Nathan Corbyn, Lukas Heidemann, Nick Hu, Chiara Sarti, Calin Tataru and Jamie Vicary. homotopy.io: a proof assistant for finitely-presented globular n-categories
  • Beniamino Accattoli and Claudio Sacerdoti Coen. IMELL Cut Elimination with Linear Overhead
  • Thiago Felicissimo and Théo Winterhalter. Impredicativity, Cumulativity and Product Covariance in the Logical Framework Dedukti
  • Jean-Simon Lemay and Marie Kerjean. Laplace Distributors and Laplace Transformations for Differential Categories
  • Benoît Guillemet, Matthieu Piquerez and Assia Mahboubi. Machine-Checked Categorical Diagrammatic Reasoning
  • Andrej Dudenhefner and Daniele Pautasso. Mechanized Subject Expansion in Uniform Intersection Types for Perpetual Reductions
  • Beniamino Accattoli and Adrienne Lancelot. Mirroring Call-by-Need, or Values Acting Silly
  • Mateo Torres-Ruiz, Robin Piedeleu, Alexandra Silva and Fabio Zanasi. On Iteration in Discrete Probabilistic Programming
  • Franz Baader and Jürgen Giesl. On the Complexity of the Small Term Reachability Problem for Terminating Term Rewriting Systems
  • Hugo Herbelin and Jad Koleilat. On the logical structure of some maximality and well-foundedness principles equivalent to choice principles
  • Małgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet and Alan Schmitt. Optimizing a Non-Deterministic Abstract Machine with Environments
  • Sohei Ito and Makoto Tatsuta. Representation of Peano Arithmetic in Separation Logic
  • Ambrus Kaposi and Szumi Xie. Second-order generalised algebraic theories: signatures and first-order semantics
  • Kostia Chardonnet, Louis Lemonnier and Benoît Valiron. Semantics for a Turing-complete Reversible Programming Language with Inductive Types
  • Teppei Saito and Nao Hirokawa. Simulating Dependency Pairs by Semantic Labeling
  • Mateus De Oliveira Oliveira and Farhad Vadiee. State Canonization and Early Pruning in Width-Based Automated Theorem Proving
  • Ralph Matthes, Kobe Wullaert and Benedikt Ahrens. Substitution for non-wellfounded syntax with binders through monoidal categories
  • Salvador Lucas. Termination of Generalized Term Rewriting Systems
  • Pablo Donato. The Flower Calculus
  • G. A. Kavvos. Two-dimensional Kripke Semantics
  • Niels van der Weide. Univalent Enriched Categories and the Enriched Rezk Completion

FSCD 2024 page  © Taltech:FSCD 2024