FoSSaCS 2020 Accepted Papers

  • A Curry-style semantics of interaction
        James Laird
  • A duality theoretic view on limits of finite structures
        Mai Gehrke, Tomáš Jakl and Luca Reggio
  • Ambiguity, weakness, and regularity in probabilistic Büchi automata
        Anton Pirogov and Christof Löding
  • An auxiliary logic on trees: on the Tower-hardness of logics featuring reachability and submodel reasoning
        Alessio Mansutti
  • An axiomatic approach to reversible computation
        Ivan Lanese, Iain Phillips and Irek Ulidowski
  • Cartesian difference categories
        Mario Alvarez-Picallo and Jean-Simon Lemay
  • Concurrent Kleene algebra with observations: From hypotheses to completeness
        Tobias Kappé, Paul Brunet, Alexandra Silva, Jana Wagemaker and Fabio Zanasi
  • Constructing infinitary quotient-inductive types
        Marcelo Fiore, Andrew Pitts and Shaun Steenkamp
  • Contextual equivalence for signal flow graphs
        Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski and Fabio Zanasi
  • Controlling a random population
        Thomas Colcombet, Nathanaël Fijalkow and Pierre Ohlmann
  • Correctness of automatic differentiation via diffeologies and categorical gluing
        Mathieu Huot, Sam Staton and Matthijs Vákár
  • Decomposing probabilistic lambda-calculi
        Ugo Dal Lago, Giulio Guerrieri and Willem Heijltjes
  • Deep induction: Induction rules for (truly) nested types
        Patricia Johann and Andrew Polonsky
  • Exponential automatic amortized resource analysis
        David Kahn and Jan Hoffmann
  • Graded algebraic theories
        Satoshi Kura
  • Learning weighted automata over principal ideal domains
        Gerco van Heerdt, Clemens Kupke, Jurriaan Rot and Alexandra Silva
  • Local local reasoning: A BI-hyperdoctrine for full ground store
        Miriam Polzer and Sergey Goncharov
  • Minimal coverability tree construction made complete and efficient
        Alain Finkel, Serge Haddad and Igor Khmelnitsky
  • Non-idempotent intersection types in logical form
        Thomas Ehrhard
  • On computability of data word functions defined by transducers
        Léo Exibard, Emmanuel Filiot and Pierre-Alain Reynier
  • On the k-synchronizability of systems
        Cinzia Di Giusto, Laetitia Laversa and Etienne Lozes
  • On well-founded and recursive coalgebras
        Jiri Adamek, Stefan Milius and Larry Moss
  • Parameterized synthesis for fragments of first-order logic over data words
        Béatrice Bérard, Benedikt Bollig, Mathieu Lehaut and Nathalie Sznajder
  • Quantum programming with inductive datatypes: causality and affine type theory
        Romain Péchoux, Simon Perdrix, Mathys Rennela and Vladimir Zamdzhiev
  • Relative full completeness for bicategorical cartesian closed structure
        Marcelo Fiore and Philip Saville
  • Semantical analysis of contextual types
        Brigitte Pientka and Ulrich Schöpp
  • Spinal atomic lambda-calculus
        David Sherratt, Willem Heijltjes, Michel Parigot and Tom Gundersen
  • Supervised learning as change propagation with delta lenses
        Zinovy Diskin
  • The inconsistent labelling problem of stutter-preserving partial-order reduction
        Thomas Neele, Antti Valmari and Tim Willemse
  • The polynomial complexity of vector addition systems with states
        Florian Zuleger
  • Timed negotiations
        S. Akshay, Blaise Genest, Loic Helouet and Sharvik Mital