default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3rd FSCD 2018: Oxford, UK
- Hélène Kirchner:
3rd International Conference on Formal Structures for Computation and Deduction, FSCD 2018, Oxford, UK, July 9-12, 2018. LIPIcs 108, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-077-4 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xx
- Stéphanie Delaune:
Analysing Privacy-Type Properties in Cryptographic Protocols (Invited Talk). 1:1-1:21 - Grigore Rosu:
Formal Design, Implementation and Verification of Blockchain Languages (Invited Talk). 2:1-2:6 - Peter Selinger:
Challenges in Quantum Programming Languages (Invited Talk). 3:1-3:2 - Valeria Vignudelli:
Proof Techniques for Program Equivalence in Probabilistic Higher-Order Languages (Invited Talk). 4:1-4:2 - Sandra Alves, Sabine Broda:
A Unifying Framework for Type Inhabitation. 5:1-5:16 - Nirina Andrianarivelo, Pierre Réty:
Confluence of Prefix-Constrained Rewrite Systems. 6:1-6:15 - Mauricio Ayala-Rincón
, Maribel Fernández, Daniele Nantes-Sobrinho:
Fixed-Point Constraints for Nominal Equational Unification. 7:1-7:16 - Patrick Bahr:
Strict Ideal Completions of the Lambda Calculus. 8:1-8:16 - Alexander Baumgartner, Temur Kutsia, Jordi Levy, Mateu Villaret:
Term-Graph Anti-Unification. 9:1-9:17 - Gianluigi Bellin, Willem Heijltjes:
Proof Nets for Bi-Intuitionistic Linear Logic. 10:1-10:18 - Maciej Bendkowski, Pierre Lescanne:
Counting Environments and Closures. 11:1-11:16 - David M. Cerna, Temur Kutsia:
Higher-Order Equational Pattern Anti-Unification. 12:1-12:17 - Lukasz Czajka:
Term Rewriting Characterisation of LOGSPACE for Finite and Infinite Data. 13:1-13:19 - Jörg Endrullis, Jan Willem Klop, Roy Overbeek:
Decreasing Diagrams with Two Labels Are Complete for Confluence of Countable Systems. 14:1-14:15 - Simon Forest, Samuel Mimram:
Coherence of Gray Categories via Rewriting. 15:1-15:16 - Thomas Genet:
Completeness of Tree Automata Completion. 16:1-16:20 - Amar Hadzihasanovic, Giovanni de Felice, Kang Feng Ng:
A Diagrammatic Axiomatisation of Fermionic Quantum Circuits. 17:1-17:20 - Mirai Ikebuchi, Keisuke Nakano:
On Repetitive Right Application of B-Terms. 18:1-18:15 - Rohan Jacob-Rao, Brigitte Pientka, David Thibodeau:
Index-Stratified Types. 19:1-19:17 - Ambrus Kaposi, András Kovács:
A Syntax for Higher Inductive-Inductive Types. 20:1-20:18 - Jean-Simon Pacaud Lemay:
Lifting Coalgebra Modalities and IMELL Model Structure to Eilenberg-Moore Categories. 21:1-21:20 - Daniel R. Licata, Ian Orton, Andrew M. Pitts, Bas Spitters:
Internal Universes in Models of Homotopy Type Theory. 22:1-22:17 - Bassel Mannaa, Rasmus Ejlers Møgelberg:
The Clocks They Are Adjunctions Denotational Semantics for Clocked Type Theory. 23:1-23:17 - Max S. New, Daniel R. Licata:
Call-by-Name Gradual Type Theory. 24:1-24:17 - Lê Thành Dung Nguyên:
Unique perfect matchings and proof nets. 25:1-25:20 - Naoki Nishida, Yuya Maeda:
Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems. 26:1-26:20 - Pawel Parys:
Homogeneity Without Loss of Generality. 27:1-27:15 - Manfred Schmidt-Schauß, David Sabel:
Nominal Unification with Atom and Context Variables. 28:1-28:20 - Amin Timany, Matthieu Sozeau:
Cumulative Inductive Types In Coq. 29:1-29:16 - Sarah Winkler, Aart Middeldorp:
Completion for Logically Constrained Rewriting. 30:1-30:18 - Christina Kohl, Aart Middeldorp:
ProTeM: A Proof Term Manipulator (System Description). 31:1-31:8 - Takahito Aoto, Makoto Hamana, Nao Hirokawa, Aart Middeldorp, Julian Nagele, Naoki Nishida, Kiraku Shintani, Harald Zankl:
Confluence Competition 2018. 32:1-32:5
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 2025-11-28 12:43 CET 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:
