Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5th FSCD 2020: Paris, France (Virtual Conference)
- Zena M. Ariola:
5th International Conference on Formal Structures for Computation and Deduction, FSCD 2020, June 29-July 6, 2020, Paris, France (Virtual Conference). LIPIcs 167, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-155-9 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:20
- Simona Ronchi Della Rocca, Ugo Dal Lago, Claudia Faggian:
Solvability in a Probabilistic Setting (Invited Talk). 1:1-1:17 - Brigitte Pientka
:
A Modal Analysis of Metaprogramming, Revisited (Invited Talk). 2:1-2:3 - Andrew M. Pitts:
Quotients in Dependent Type Theory (Invited Talk). 3:1-3:2 - René Thiemann, Jonas Schöpf, Christian Sternagel, Akihisa Yamada:
Certifying the Weighted Path Order (Invited Talk). 4:1-4:20 - Petar Vukmirovic, Alexander Bentkamp, Visa Nummelin:
Efficient Full Higher-Order Unification. 5:1-5:17 - Paul-André Melliès, Nicolas Rolland:
Comprehension and Quotient Structures in the Language of 2-Categories. 6:1-6:18 - Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk:
A Complete Normal-Form Bisimilarity for Algebraic Effects and Handlers. 7:1-7:22 - Paul Brunet, David J. Pym:
Pomsets with Boxes: Protection, Separation, and Locality in Concurrent Kleene Algebra. 8:1-8:16 - Andrej Dudenhefner:
Undecidability of Semi-Unification on a Napkin. 9:1-9:16 - Mathias Hülsbusch, Barbara König, Sebastian Küpper, Lara Stoltenow:
Conditional Bisimilarity for Reactive Systems. 10:1-10:19 - Masaomi Yamaguchi, Takahito Aoto:
A Fast Decision Procedure For Uniqueness of Normal Forms w.r.t. Conversion of Shallow Term Rewriting Systems. 11:1-11:23 - André Hirschowitz, Tom Hirschowitz, Ambroise Lafont:
Modules over Monads and Operational Semantics. 12:1-12:23 - Frédéric Blanqui:
Type Safety of Rewrite Rules in Dependent Types. 13:1-13:14 - Rose Bohrer, André Platzer:
Refining Constructive Hybrid Games. 14:1-14:19 - Andrej Ivaskovic, Alan Mycroft, Dominic Orchard:
Data-Flow Analyses as Effects and Graded Monads. 15:1-15:23 - Zeinab Galal:
A Profunctorial Scott Semantics. 16:1-16:18 - Guillaume Boisseau:
String Diagrams for Optics. 17:1-17:18 - Dariusz Biernacki, Mateusz Pyzik, Filip Sieczkowski:
A Reflection on Continuation-Composing Style. 18:1-18:17 - Yo Mitani, Naoki Kobayashi, Takeshi Tsukada:
A Probabilistic Higher-Order Fixpoint Logic. 19:1-19:22 - Rick Erkens, Maurice Laveaux:
Adaptive Non-Linear Pattern Matching Automata. 20:1-20:21 - Yoshiki Nakamura, Kazuyuki Asada, Naoki Kobayashi, Ryoma Sin'ya, Takeshi Tsukada:
On Average-Case Hardness of Higher-Order Model Checking. 21:1-21:23 - Kazuyuki Asada, Naoki Kobayashi:
Size-Preserving Translations from Order-(n+1) Word Grammars to Order-n Tree Grammars. 22:1-22:22 - Ambrus Kaposi, Jakob von Raumer:
A Syntax for Mutual Inductive Families. 23:1-23:21 - Tim Lukas Diezel, Sergey Goncharov:
Towards Constructive Hybrid Semantics. 24:1-24:19 - Chuangjie Xu:
A Gentzen-Style Monadic Translation of Gödel's System T. 25:1-25:17 - David M. Cerna, Temur Kutsia:
Unital Anti-Unification: Type and Algorithms. 26:1-26:20 - Yu-Yang Lin, Nikos Tzevelekos:
Symbolic Execution Game Semantics. 27:1-27:24 - Wilmer Ricciotti, James Cheney:
Strongly Normalizing Higher-Order Relational Queries. 28:1-28:22 - Henry DeYoung, Frank Pfenning, Klaas Pruiksma:
Semi-Axiomatic Sequent Calculus. 29:1-29:22 - Besik Dundua, Temur Kutsia, Mircea Marin, Ioana-Cleopatra Pau:
Constraint Solving over Multiple Similarity Relations. 30:1-30:19 - Guillaume Genestier:
Encoding Agda Programs Using Rewriting. 31:1-31:17 - Mario Alvarez-Picallo, C.-H. Luke Ong:
The Difference λ-Calculus: A Language for Difference Categories. 32:1-32:21 - Ankush Das, Frank Pfenning:
Rast: Resource-Aware Session Types with Arithmetic Refinements (System Description). 33:1-33:17 - Cyril Cohen, Kazuhiko Sakaguchi, Enrico Tassi:
Hierarchy Builder: Algebraic hierarchies Made Easy in Coq with Elpi (System Description). 34:1-34:21 - Gabriel Hondet, Frédéric Blanqui:
The New Rewriting Engine of Dedukti (System Description). 35:1-35:16 - Cynthia Kop:
WANDA - a Higher Order Termination Tool (System Description). 36:1-36:19 - Claude Stolze, Luigi Liquori:
A Type Checker for a Logical Framework with Union and Intersection Types (System Description). 37:1-37:24
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-26 18:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
