FSCD B

39 papers

YearTitle / Authors
20205th International Conference on Formal Structures for Computation and Deduction, FSCD 2020, Paris, France (Virtual Conference), June 29 - July 6, 2020
Zena M. Ariola
2020A Complete Normal-Form Bisimilarity for Algebraic Effects and Handlers.
Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk
2020A Fast Decision Procedure For Uniqueness of Normal Forms w.r.t. Conversion of Shallow Term Rewriting Systems.
Masaomi Yamaguchi, Takahito Aoto
2020A Gentzen-Style Monadic Translation of Gödel's System T.
Chuangjie Xu
2020A Modal Analysis of Metaprogramming, Revisited (Invited Talk).
Brigitte Pientka
2020A Probabilistic Higher-Order Fixpoint Logic.
Yo Mitani, Naoki Kobayashi, Takeshi Tsukada
2020A Profunctorial Scott Semantics.
Zeinab Galal
2020A Reflection on Continuation-Composing Style.
Dariusz Biernacki, Mateusz Pyzik, Filip Sieczkowski
2020A Syntax for Mutual Inductive Families.
Ambrus Kaposi, Jakob von Raumer
2020A Type Checker for a Logical Framework with Union and Intersection Types (System Description).
Claude Stolze, Luigi Liquori
2020Adaptive Non-Linear Pattern Matching Automata.
Rick Erkens, Maurice Laveaux
2020Certifying the Weighted Path Order (Invited Talk).
René Thiemann, Jonas Schöpf, Christian Sternagel, Akihisa Yamada
2020Comprehension and Quotient Structures in the Language of 2-Categories.
Paul-André Melliès, Nicolas Rolland
2020Conditional Bisimilarity for Reactive Systems.
Mathias Hülsbusch, Barbara König, Sebastian Küpper, Lara Stoltenow
2020Constraint Solving over Multiple Similarity Relations.
Besik Dundua, Temur Kutsia, Mircea Marin, Ioana-Cleopatra Pau
2020Data-Flow Analyses as Effects and Graded Monads.
Andrej Ivaskovic, Alan Mycroft, Dominic Orchard
2020Efficient Full Higher-Order Unification.
Petar Vukmirovic, Alexander Bentkamp, Visa Nummelin
2020Encoding Agda Programs Using Rewriting.
Guillaume Genestier
2020Front Matter, Table of Contents, Preface, Conference Organization.
2020Hierarchy Builder: Algebraic hierarchies Made Easy in Coq with Elpi (System Description).
Cyril Cohen, Kazuhiko Sakaguchi, Enrico Tassi
2020Modules over Monads and Operational Semantics.
André Hirschowitz, Tom Hirschowitz, Ambroise Lafont
2020On Average-Case Hardness of Higher-Order Model Checking.
Yoshiki Nakamura, Kazuyuki Asada, Naoki Kobayashi, Ryoma Sin'ya, Takeshi Tsukada
2020Pomsets with Boxes: Protection, Separation, and Locality in Concurrent Kleene Algebra.
Paul Brunet, David J. Pym
2020Quotients in Dependent Type Theory (Invited Talk).
Andrew M. Pitts
2020Rast: Resource-Aware Session Types with Arithmetic Refinements (System Description).
Ankush Das, Frank Pfenning
2020Refining Constructive Hybrid Games.
Rose Bohrer, André Platzer
2020Semi-Axiomatic Sequent Calculus.
Henry DeYoung, Frank Pfenning, Klaas Pruiksma
2020Size-Preserving Translations from Order-(n+1) Word Grammars to Order-n Tree Grammars.
Kazuyuki Asada, Naoki Kobayashi
2020Solvability in a Probabilistic Setting (Invited Talk).
Simona Ronchi Della Rocca, Ugo Dal Lago, Claudia Faggian
2020String Diagrams for Optics.
Guillaume Boisseau
2020Strongly Normalizing Higher-Order Relational Queries.
Wilmer Ricciotti, James Cheney
2020Symbolic Execution Game Semantics.
Yu-Yang Lin, Nikos Tzevelekos
2020The Difference λ-Calculus: A Language for Difference Categories.
Mario Alvarez-Picallo, C.-H. Luke Ong
2020The New Rewriting Engine of Dedukti (System Description).
Gabriel Hondet, Frédéric Blanqui
2020Towards Constructive Hybrid Semantics.
Tim Lukas Diezel, Sergey Goncharov
2020Type Safety of Rewrite Rules in Dependent Types.
Frédéric Blanqui
2020Undecidability of Semi-Unification on a Napkin.
Andrej Dudenhefner
2020Unital Anti-Unification: Type and Algorithms.
David M. Cerna, Temur Kutsia
2020WANDA - a Higher Order Termination Tool (System Description).
Cynthia Kop