default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2nd FSCD 2017: Oxford, UK
- Dale Miller:
2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017, September 3-9, 2017, Oxford, UK. LIPIcs 84, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-047-7 - Front Matter, Table of Contents, Preface, Steering Committee, Program Committee, External Reviewers. 0:i-0:xiv
- Marco Gaboardi
:
Type Systems for the Relational Verification of Higher Order Programs (Invited Talk). 1:1-1:1 - Georg Moser:
Uniform Resource Analysis by Rewriting: Strenghts and Weaknesses (Invited Talk). 2:1-2:10 - Alexandra Silva:
Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages (Invited Talk). 3:1-3:1 - Christine Tasson:
Quantitative Semantics for Probabilistic Programming (Invited Talk). 4:1-4:1 - Benedikt Ahrens, Peter LeFanu Lumsdaine:
Displayed Categories. 5:1-5:16 - Yohji Akama:
The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type. 6:1-6:19 - Takahito Aoto, Yoshihito Toyama, Yuta Kimura:
Improving Rewriting Induction Approach for Proving Ground Confluence. 7:1-7:18 - Patrick Bahr:
Böhm Reduction in Infinitary Term Graph Rewriting Systems. 8:1-8:20 - Pablo Barenbaum, Eduardo Bonelli:
Optimality and the Linear Substitution Calculus. 9:1-9:16 - Malgorzata Biernacka, Witold Charatonik, Klara Zielinska:
Generalized Refocusing: From Hybrid Strategies to Abstract Machines. 10:1-10:17 - Jasmin Christian Blanchette, Mathias Fleury, Dmitriy Traytel:
Nested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOL. 11:1-11:18 - Simon Castellan, Pierre Clairambault, Glynn Winskel:
Observably Deterministic Concurrent Strategies and Intensional Full Abstraction for Parallel-or. 12:1-12:16 - J. Robin B. Cockett, Jean-Simon Lemay:
There Is Only One Notion of Differentiation. 13:1-13:21 - Lukasz Czajka:
Confluence of an Extension of Combinatory Logic by Boolean Constants. 14:1-14:16 - Andrej Dudenhefner, Jakob Rehof:
The Complexity of Principal Inhabitation. 15:1-15:14 - Marcelo Fiore, Philip Saville:
List Objects with Algebraic Structure. 16:1-16:18 - Stefano Guerrini, Marco Solieri:
Is the Optimal Implementation Inefficient? Elementarily Not. 17:1-17:16 - Daniel Hillerström, Sam Lindley, Robert Atkey, K. C. Sivaramakrishnan:
Continuation Passing Style for Effect Handlers. 18:1-18:19 - Nao Hirokawa, Aart Middeldorp, Christian Sternagel, Sarah Winkler:
Infinite Runs in Abstract Completion. 19:1-19:16 - Benedetto Intrigila, Giulio Manzonetto, Andrew Polonsky:
Refutation of Sallé's Longstanding Conjecture. 20:1-20:18 - Jonas Kaiser, Brigitte Pientka, Gert Smolka:
Relating System F and Lambda2: A Case Study in Coq, Abella and Beluga. 21:1-21:19 - Max I. Kanovich, Stepan L. Kuznetsov, Glyn Morrill, Andre Scedrov:
A Polynomial-Time Algorithm for the Lambek Calculus with Brackets of Bounded Order. 22:1-22:17 - Akitoshi Kawamura, Florian Steinberg:
Polynomial Running Times for Polynomial-Time Oracle Machines. 23:1-23:18 - Delia Kesner, Pierre Vial:
Types as Resources for Classical Natural Deduction. 24:1-24:17 - Daniel R. Licata, Michael Shulman, Mitchell Riley:
A Fibrational Framework for Substructural and Modal Logics. 25:1-25:22 - Benjamin Lichtman, Jan Hoffmann:
Arrays and References in Resource Aware ML. 26:1-26:20 - Tadeusz Litak, Miriam Polzer, Ulrich Rabenstein:
Negative Translations and Normal Modality. 27:1-27:18 - Ian Orton, Andrew M. Pitts:
Models of Type Theory Based on Moore Paths. 28:1-28:16 - Paolo Pistone:
On Dinaturality, Typability and beta-eta-Stable Models. 29:1-29:17 - Cécilia Pradic, Colin Riba:
A Curry-Howard Approach to Church's Synthesis. 30:1-30:16 - Lutz Straßburger:
Combinatorial Flows and Their Normalisation. 31:1-31:17 - Ryota Suzuki, Koichi Fujima, Naoki Kobayashi, Takeshi Tsukada:
Streett Automata Model Checking of Higher-Order Recursion Schemes. 32:1-32:18 - Noam Zeilberger:
A Sequent Calculus for a Semi-Associative Law. 33:1-33:16
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-11 02:23 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:
