FSCD 2020: INTERNATIONAL CONFERENCE ON FORMAL STRUCTURES FOR COMPUTATION AND DEDUCTION

A
Alvarez-Picallo, Mario	The difference lambda-calculus: a language for difference categories.
Aoto, Takahito	A Fast Decision Procedure for Uniqueness of Normal Forms w.r.t. Conversion of Shallow Term Rewriting Systems
Asada, Kazuyuki	On Average-Case Hardness of Higher-Order Model Checking Size-Preserving Translations from Order-(n+1) Word Grammars to Order-n Tree Grammars
B
Bentkamp, Alexander	Efficient Full Higher-Order Unification *** Best paper by junior researchers
Biernacki, Dariusz	A Reflection on Continuation-Composing Style A Complete Normal-Form Bisimilarity for Algebraic Effects and Handlers
Blanqui, Frédéric	Type safety of rewriting rules in dependent types The new rewriting engine of Dedukti - System description
Bohrer, Brandon	Refining Constructive Hybrid Games
Boisseau, Guillaume	String diagrams for optics
Brunet, Paul	Pomsets with Boxes: Protection, Separation, and Locality in Concurrent Kleene Algebra
C
Cerna, David	Unital Anti-unification: Type and Algorithms
Cheney, James	Strongly Normalizing Higher-Order Relational Queries
Cohen, Cyril	Hierarchy Builder: algebraic hierarchies made easy in Coq with Elpi - System description
D
Das, Ankush	Resource-Aware Session Types with Arithmetic Refinements *** Best system description by a junior researcher
DeYoung, Henry	Semi-Axiomatic Sequent Calculus
Diezel, Tim Lukas	Towards Constructive Hybrid Semantics
Dudenhefner, Andrej	Undecidability of Semi-unification on a Napkin *** Best paper by a junior researcher
Dundua, Besik	Constraint Solving over Multiple Similarity Relations
E
Erkens, Rick	Adaptive Non-linear Pattern Matching Automata
G
Galal, Zeinab	A Profunctorial Scott Semantics
Genestier, Guillaume	Encoding Agda Programs using Rewriting
Goncharov, Sergey	Towards Constructive Hybrid Semantics
H
Harrison, John	Adventures in Verifying Arithmetic
Hirschowitz, André	Modules over monads and operational semantics
Hirschowitz, Tom	Modules over monads and operational semantics
Hondet, Gabriel	The new rewriting engine of Dedukti - System description
Hülsbusch, Mathias	Conditional Bisimilarity for Reactive Systems
I
Ivaskovic, Andrej	Data-flow analyses as effects and graded monads
K
Kaposi, Ambrus	A Syntax for Mutual Inductive Families
Kobayashi, Naoki	A Probabilistic Higher-order Fixpoint Logic On Average-Case Hardness of Higher-Order Model Checking Size-Preserving Translations from Order-(n+1) Word Grammars to Order-n Tree Grammars
Kop, Cynthia	WANDA - a Higher Order Termination Tool - System description
Kutsia, Temur	Unital Anti-unification: Type and Algorithms Constraint Solving over Multiple Similarity Relations
König, Barbara	Conditional Bisimilarity for Reactive Systems
Küpper, Sebastian	Conditional Bisimilarity for Reactive Systems
L
Lafont, Ambroise	Modules over monads and operational semantics
Laveaux, Maurice	Adaptive Non-linear Pattern Matching Automata
Lenglet, Sergueï	A Complete Normal-Form Bisimilarity for Algebraic Effects and Handlers
Lin, Yu-Yang	Symbolic Execution Game Semantics
Liquori, Luigi	A Type Checker for a Logical Framework with Union and Intersection Types - System description
M
Marin, Mircea	Constraint Solving over Multiple Similarity Relations
Melliès, Paul-André	Comprehension and quotient structures in the language of 2-categories
Mitani, Yo	A Probabilistic Higher-order Fixpoint Logic
Mycroft, Alan	Data-flow analyses as effects and graded monads
N
Nakamura, Yoshiki	On Average-Case Hardness of Higher-Order Model Checking
Nummelin, Visa	Efficient Full Higher-Order Unification *** Best paper by junior researchers
O
Ong, C.-H. Luke	The difference lambda-calculus: a language for difference categories.
Orchard, Dominic	Data-flow analyses as effects and graded monads
P
Pau, Cleopatra	Constraint Solving over Multiple Similarity Relations
Pfenning, Frank	Semi-Axiomatic Sequent Calculus Resource-Aware Session Types with Arithmetic Refinements *** Best system description by a junior researcher
Pientka, Brigitte	A Modal Analysis of Metaprogramming
Pitts, Andrew	Quotients in Dependent Type Theory
Platzer, André	Refining Constructive Hybrid Games
Polesiuk, Piotr	A Complete Normal-Form Bisimilarity for Algebraic Effects and Handlers
Pruiksma, Klaas	Semi-Axiomatic Sequent Calculus
Pym, David	Pomsets with Boxes: Protection, Separation, and Locality in Concurrent Kleene Algebra
Pyzik, Mateusz	A Reflection on Continuation-Composing Style
R
Ricciotti, Wilmer	Strongly Normalizing Higher-Order Relational Queries
Rolland, Nicolas	Comprehension and quotient structures in the language of 2-categories
Ronchi Della Rocca, Simona	A foundational lambda calculus for probabilistic computation
S
Sakaguchi, Kazuhiko	Hierarchy Builder: algebraic hierarchies made easy in Coq with Elpi - System description
Sieczkowski, Filip	A Reflection on Continuation-Composing Style
Sin'Ya, Ryoma	On Average-Case Hardness of Higher-Order Model Checking
Stoltenow, Lars	Conditional Bisimilarity for Reactive Systems
Stolze, Claude	A Type Checker for a Logical Framework with Union and Intersection Types - System description
T
Tassi, Enrico	Hierarchy Builder: algebraic hierarchies made easy in Coq with Elpi - System description
Thiemann, René	Certifying Termination Proofs: From Term Rewriting to SMT Solving and Back
Tsukada, Takeshi	A Probabilistic Higher-order Fixpoint Logic On Average-Case Hardness of Higher-Order Model Checking
Tzevelekos, Nikos	Symbolic Execution Game Semantics
V
von Raumer, Jakob	A Syntax for Mutual Inductive Families
Vukmirović, Petar	Efficient Full Higher-Order Unification *** Best paper by junior researchers
X
Xu, Chuangjie	A Gentzen-style monadic translation of Goedel's System T
Y
Yamaguchi, Masaomi	A Fast Decision Procedure for Uniqueness of Normal Forms w.r.t. Conversion of Shallow Term Rewriting Systems

Disclaimer | Powered by EasyChair Smart Program