default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID6th FSCD 2021: Buenos Aires, Argentina (Virtual Conference)
- Naoki Kobayashi
:
6th International Conference on Formal Structures for Computation and Deduction, FSCD 2021, Buenos Aires, Argentina (Virtual Conference), July 17-24, 2021. LIPIcs 195, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-191-7 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:16
- Paul Downen, Zena M. Ariola:
Duality in Action (Invited Talk). 1:1-1:32 - Nao Hirokawa:
Completion and Reduction Orders (Invited Talk). 2:1-2:9 - Elaine Pimentel, Carlos Olarte, Vivek Nigam:
Process-As-Formula Interpretation: A Substructural Multimodal View (Invited Talk). 3:1-3:21 - Sam Staton:
Some Formal Structures in Probability (Invited Talk). 4:1-4:4 - Jakob Grue Simonsen:
The Expressive Power of One Variable Used Once: The Chomsky Hierarchy and First-Order Monadic Constructor Rewriting. 5:1-5:17 - Rick Statman:
Church's Semigroup Is Sq-Universal. 6:1-6:6 - Axel Kerinec, Giulio Manzonetto, Simona Ronchi Della Rocca:
Call-By-Value, Again! 7:1-7:18 - Tom de Jong, Martín Hötzel Escardó:
Predicative Aspects of Order Theory in Univalent Foundations. 8:1-8:18 - Thibaut Balabonski, Antoine Lanco, Guillaume Melquiond:
A Strong Call-By-Need Calculus. 9:1-9:22 - Zeinab Galal:
A Bicategorical Model for Finite Nondeterminism. 10:1-10:17 - Kenji Saotome, Koji Nakazawa, Daisuke Kimura:
Failure of Cut-Elimination in the Cyclic Proof System of Bunched Logic with Inductive Propositions. 11:1-11:14 - Youyou Cong, Chiaki Ishio, Kaho Honda, Kenichi Asai:
A Functional Abstraction of Typed Invocation Contexts. 12:1-12:18 - Didier Galmiche, Marta Gawek, Daniel Méry:
Beth Semantics and Labelled Deduction for Intuitionistic Sentential Calculus with Identity. 13:1-13:21 - Anupam Das, Alex A. Rice:
New Minimal Linear Inferences in Boolean Logic Independent of Switch and Medial. 14:1-14:19 - Deepak Kapur:
A Modular Associative Commutative (AC) Congruence Closure Algorithm. 15:1-15:21 - Maika Fujii, Kenichi Asai:
Derivation of a Virtual Machine For Four Variants of Delimited-Control Operators. 16:1-16:19 - Lison Blondeau-Patissier, Pierre Clairambault:
Positional Injectivity for Innocent Strategies. 17:1-17:22 - Dominique Larchey-Wendling:
Synthetic Undecidability of MSELL via FRACTRAN Mechanised in Coq. 18:1-18:20 - Dohan Kim, Christopher Lynch:
An RPO-Based Ordering Modulo Permutation Equations and Its Applications to Rewrite Systems. 19:1-19:17 - Frédéric Blanqui, Gilles Dowek, Émilie Grienenberger, Gabriel Hondet, François Thiré:
Some Axioms for Mathematics. 20:1-20:19 - Joseph W. N. Paulus, Daniele Nantes-Sobrinho, Jorge A. Pérez:
Non-Deterministic Functions as Non-Deterministic Processes. 21:1-21:22 - Niccolò Veltri:
Type-Theoretic Constructions of the Final Coalgebra of the Finite Powerset Functor. 22:1-22:18 - Ugo Dal Lago, Francesco Gavazzo:
Resource Transition Systems and Full Abstraction for Linear Higher-Order Effectful Programs. 23:1-23:19 - Vincent van Oostrom:
Z; Syntax-Free Developments. 24:1-24:22 - Cristina Matache, Sean K. Moss, Sam Staton:
Recursion and Sequentiality in Categories of Sheaves. 25:1-25:22 - Pieter J. W. Hofstra, Jason Parker, Philip J. Scott:
Polymorphic Automorphisms and the Picard Group. 26:1-26:17 - Paolo Pistone, Luca Tranchini:
What's Decidable About (Atomic) Polymorphism? 27:1-27:23 - Hans-Peter Deifel, Stefan Milius, Thorsten Wißmann:
Coalgebra Encoding for Efficient Minimization. 28:1-28:19 - Anupam Das:
On the Logical Strength of Confluence and Normalisation for Cyclic Proofs. 29:1-29:23 - Nathanael Arkor, Dylan McDermott:
Abstract Clones for Abstract Syntax. 30:1-30:19 - Cynthia Kop, Deivid Vale:
Tuple Interpretations for Higher-Order Complexity. 31:1-31:22 - Ken Sakayori, Takeshi Tsukada:
Output Without Delay: A π-Calculus Compatible with Categorical Semantics. 32:1-32:22
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 2026-07-24 23:23 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
