Portal - FSCD 2017

FSCD 2017	September 3-9, 2017 - Oxford, UK
2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017) Dale Miller (Ed.)
ISBN 978-3-95977-047-7, LIPICS Vol. 84	ISSN 1868-8969

Additional Information

License
Conference Website
Complete volume (PDF, 17 MB)
Search Publication Server

Authors

Biernacka, Malgorzata

Blanchette, Jasmin Christian

Lumsdaine, Peter LeFanu

Sivaramakrishnan, K. C.

Front Matter, Table of Contents, Preface, Steering Committee, Program Committee, External Reviewers

Authors: Miller, Dale

Abstract | Document (357 KB) | BibTeX

Type Systems for the Relational Verification of Higher Order Programs (Invited Talk)

Authors: Gaboardi, Marco

Abstract | Document (200 KB) | BibTeX

Uniform Resource Analysis by Rewriting: Strenghts and Weaknesses (Invited Talk)

Authors: Moser, Georg

Abstract | Document (538 KB) | BibTeX

Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages (Invited Talk)

Authors: Silva, Alexandra

Abstract | Document (202 KB) | BibTeX

Quantitative Semantics for Probabilistic Programming (Invited Talk)

Authors: Tasson, Christine

Abstract | Document (199 KB) | BibTeX

Displayed Categories

Authors: Ahrens, Benedikt ; Lumsdaine, Peter LeFanu

Abstract | Document (524 KB) | BibTeX

The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type

Authors: Akama, Yohji

Abstract | Document (507 KB) | BibTeX

Improving Rewriting Induction Approach for Proving Ground Confluence

Authors: Aoto, Takahito ; Toyama, Yoshihito ; Kimura, Yuta

Abstract | Document (1,042 KB) | BibTeX

Böhm Reduction in Infinitary Term Graph Rewriting Systems

Authors: Bahr, Patrick

Abstract | Document (547 KB) | BibTeX

Optimality and the Linear Substitution Calculus

Authors: Barenbaum, Pablo ; Bonelli, Eduardo

Abstract | Document (657 KB) | BibTeX

Generalized Refocusing: From Hybrid Strategies to Abstract Machines

Authors: Biernacka, Malgorzata ; Charatonik, Witold ; Zielinska, Klara

Abstract | Document (495 KB) | BibTeX

Nested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOL

Authors: Blanchette, Jasmin Christian ; Fleury, Mathias ; Traytel, Dmitriy

Abstract | Document (493 KB) | BibTeX

Observably Deterministic Concurrent Strategies and Intensional Full Abstraction for Parallel-or

Authors: Castellan, Simon ; Clairambault, Pierre ; Winskel, Glynn

Abstract | Document (655 KB) | BibTeX

There Is Only One Notion of Differentiation

Authors: Cockett, J. Robin B. ; Lemay, Jean-Simon

Abstract | Document (571 KB) | BibTeX

Confluence of an Extension of Combinatory Logic by Boolean Constants

Authors: Czajka, Lukasz

Abstract | Document (513 KB) | BibTeX

The Complexity of Principal Inhabitation

Authors: Dudenhefner, Andrej ; Rehof, Jakob

Abstract | Document (568 KB) | BibTeX

List Objects with Algebraic Structure

Authors: Fiore, Marcelo ; Saville, Philip

Abstract | Document (530 KB) | BibTeX

Is the Optimal Implementation Inefficient? Elementarily Not

Authors: Guerrini, Stefano ; Solieri, Marco

Abstract | Document (799 KB) | BibTeX

Continuation Passing Style for Effect Handlers

Authors: Hillerström, Daniel ; Lindley, Sam ; Atkey, Robert ; Sivaramakrishnan, K. C.

Abstract | Document (756 KB) | BibTeX

Infinite Runs in Abstract Completion

Authors: Hirokawa, Nao ; Middeldorp, Aart ; Sternagel, Christian ; Winkler, Sarah

Abstract | Document (602 KB) | BibTeX

Refutation of Sallé's Longstanding Conjecture

Authors: Intrigila, Benedetto ; Manzonetto, Giulio ; Polonsky, Andrew

Abstract | Document (1,108 KB) | BibTeX

Relating System F and Lambda2: A Case Study in Coq, Abella and Beluga

Authors: Kaiser, Jonas ; Pientka, Brigitte ; Smolka, Gert

Abstract | Document (559 KB) | BibTeX

A Polynomial-Time Algorithm for the Lambek Calculus with Brackets of Bounded Order

Authors: Kanovich, Max ; Kuznetsov, Stepan ; Morrill, Glyn ; Scedrov, Andre

Abstract | Document (589 KB) | BibTeX

Polynomial Running Times for Polynomial-Time Oracle Machines

Authors: Kawamura, Akitoshi ; Steinberg, Florian

Abstract | Document (596 KB) | BibTeX

Types as Resources for Classical Natural Deduction

Authors: Kesner, Delia ; Vial, Pierre

Abstract | Document (553 KB) | BibTeX

A Fibrational Framework for Substructural and Modal Logics

Authors: Licata, Daniel R. ; Shulman, Michael ; Riley, Mitchell

Abstract | Document (610 KB) | BibTeX

Arrays and References in Resource Aware ML

Authors: Lichtman, Benjamin ; Hoffmann, Jan

Abstract | Document (611 KB) | BibTeX

Negative Translations and Normal Modality

Authors: Litak, Tadeusz ; Polzer, Miriam ; Rabenstein, Ulrich

Abstract | Document (651 KB) | BibTeX

Models of Type Theory Based on Moore Paths

Authors: Orton, Ian ; Pitts, Andrew M.

Abstract | Document (598 KB) | BibTeX

On Dinaturality, Typability and beta-eta-Stable Models

Authors: Pistone, Paolo

Abstract | Document (524 KB) | BibTeX

A Curry-Howard Approach to Church's Synthesis

Authors: Pradic, Pierre ; Riba, Colin

Abstract | Document (615 KB) | BibTeX

Combinatorial Flows and Their Normalisation

Authors: Straßburger, Lutz

Abstract | Document (622 KB) | BibTeX

Streett Automata Model Checking of Higher-Order Recursion Schemes

Authors: Suzuki, Ryota ; Fujima, Koichi ; Kobayashi, Naoki ; Tsukada, Takeshi

Abstract | Document (1,140 KB) | BibTeX

A Sequent Calculus for a Semi-Associative Law

Authors: Zeilberger, Noam

Abstract | Document (517 KB) | BibTeX

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI

2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017)