default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID1st FSCD 2016: Porto, Portugal
- Delia Kesner, Brigitte Pientka:
1st International Conference on Formal Structures for Computation and Deduction, FSCD 2016, Porto, Portugal, June 22-26, 2016. LIPIcs 52, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-010-1 - Front Matter, Table of Contents, Preface, Steering Committee, Program Committee, External Reviewers, Organising Commitee. 0:i-0:xviii
- Amal Ahmed:
Compositional Compiler Verification for a Multi-Language World. 1:1-1:1 - Ichiro Hasuo
:
Coalgebras and Higher-Order Computation: a GoI Approach. 2:1-2:2 - Gérard P. Huet:
Teaching Foundations of Computation and Deduction Through Literate Functional Programming and Type Theory Formalization. 3:1-3:2 - Tobias Nipkow:
Verified Analysis of Functional Data Structures. 4:1-4:2 - Ryota Akiyoshi, Kazushige Terui:
Strong Normalization for the Parameter-Free Polymorphic Lambda Calculus Based on the Omega-Rule.. 5:1-5:15 - Thorsten Altenkirch, Ambrus Kaposi:
Normalisation by Evaluation for Dependent Types. 6:1-6:16 - Ofer Arieli, Arnon Avron:
Minimal Paradefinite Logics for Reasoning with Incompleteness and Inconsistency. 7:1-7:15 - Ryuta Arisaka:
Structural Interactions and Absorption of Structural Rules in BI Sequent Calculus. 8:1-8:18 - Andrés Aristizábal, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk:
Environmental Bisimulations for Delimited-Control Operators with Dynamic Prompt Generation. 9:1-9:17 - Martin Avanzini, Georg Moser:
Complexity of Acyclic Term Graph Rewriting. 10:1-10:18 - Mauricio Ayala-Rincón, Maribel Fernández, Daniele Nantes-Sobrinho:
Nominal Narrowing. 11:1-11:17 - Marcin Benke, Aleksy Schubert, Daria Walukiewicz-Chrzaszcz:
Synthesis of Functional Programs with Help of First-Order Intuitionistic Logic. 12:1-12:16 - Valentin Blot:
Classical Extraction in Continuation Models. 13:1-13:17 - Jon Haël Brenas, Rachid Echahed, Martin Strecker:
Proving Correctness of Logically Decorated Graph Rewriting Systems. 14:1-14:15 - Flavien Breuvart, Giulio Manzonetto, Andrew Polonsky, Domenico Ruoppolo:
New Results on Morris's Observational Theory: The Benefits of Separating the Inseparable. 15:1-15:18 - Kaustuv Chaudhuri, Sonia Marin, Lutz Straßburger:
Modular Focused Proof Systems for Intuitionistic Modal Logics. 16:1-16:18 - Thierry Coquand, Bassel Mannaa:
The Independence of Markov's Principle in Type Theory. 17:1-17:18 - Fer-Jan de Vries:
On Undefined and Meaningless in Lambda Definability. 18:1-18:15 - Andrej Dudenhefner, Moritz Martens, Jakob Rehof:
The Intersection Type Unification Problem. 19:1-19:16 - Giulio Guerrieri, Luc Pellissier, Lorenzo Tortora de Falco:
Computing Connected Proof(-Structure)s From Their Taylor Expansion. 20:1-20:18 - Makoto Hamana:
Strongly Normalising Cyclic Data Computation by Iteration Categories of Second-Order Algebraic Theories. 21:1-21:18 - Stefan Kahrs, Connor Smith:
Non-Omega-Overlapping TRSs are UN. 22:1-22:17 - Cynthia Kop, Jakob Grue Simonsen:
Complexity Hierarchies and Higher-Order Cons-Free Rewriting. 23:1-23:18 - James Laird:
Weighted Relational Models for Mobility. 24:1-24:15 - Olivier Laurent:
Focusing in Orthologic. 25:1-25:17 - Tomer Libal, Dale Miller:
Functions-as-Constructors Higher-Order Unification. 26:1-26:17 - Philippe Malbos, Samuel Mimram:
Homological Computations for Term Rewriting Systems. 27:1-27:17 - Naoki Nishida, Adrián Palacios, Germán Vidal:
Reversible Term Rewriting. 28:1-28:18 - Christian Sternagel, Thomas Sternagel:
Certifying Confluence of Almost Orthogonal CTRSs via Exact Tree Automata Completion. 29:1-29:16 - Amin Timany, Bart Jacobs:
Category Theory in Coq 8.5. 30:1-30:18 - Dmitriy Traytel:
Formal Languages, Formally and Coinductively. 31:1-31:17 - Vincent van Oostrom, Yoshihito Toyama:
Normalisation by Random Descent. 32:1-32:18 - Takahito Aoto, Yoshihito Toyama:
Ground Confluence Prover based on Rewriting Induction. 33:1-33:12 - Krzysztof Bar, Aleks Kissinger, Jamie Vicary:
Globular: An Online Proof Assistant for Higher-Dimensional Rewriting. 34:1-34:11 - Stéphane Gimenez, David Obwaller:
Interaction Automata and the ia2d Interpreter. 35:1-35:11 - Franziska Rapp, Aart Middeldorp:
Automating the First-Order Theory of Rewriting for Left-Linear Right-Ground Rewrite Systems. 36:1-36:12
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-08-06 22:37 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.
