Proceedings of the First International Conference on Formal Structures for Computation and Deduction
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Delia Kesner, Brigitte Pientka
Proceedings of the First International Conference on Formal Structures for Computation and Deduction
FSCD, 2016.

FM
DBLP
Scholar
?EE?
Full names Links ISxN
@proceedings{FSCD-2016,
	editor        = "Delia Kesner and Brigitte Pientka",
	ee            = "http://www.dagstuhl.de/dagpub/978-3-95977-010-1",
	isbn          = "978-3-95977-010-1",
	publisher     = "{Schloss Dagstuhl - Leibniz-Zentrum für Informatik}",
	series        = "{Leibniz International Proceedings in Informatics}",
	title         = "{Proceedings of the First International Conference on Formal Structures for Computation and Deduction}",
	volume        = 52,
	year          = 2016,
}

Contents (36 items)

FSCD-2016-Ahmed #compilation #composition #multi #verification
Compositional Compiler Verification for a Multi-Language World (AA), p. 1.
FSCD-2016-Hasuo #algebra #approach #higher-order
Coalgebras and Higher-Order Computation: a GoI Approach (IH), p. 2.
FSCD-2016-Huet #deduction #education #formal method #functional #programming #type system
Teaching Foundations of Computation and Deduction Through Literate Functional Programming and Type Theory Formalization (GPH), p. 2.
FSCD-2016-Nipkow #analysis #data type #functional
Verified Analysis of Functional Data Structures (TN), p. 2.
FSCD-2016-BarKV #named #online #proving
Globular: An Online Proof Assistant for Higher-Dimensional Rewriting (KB, AK, JV), p. 11.
FSCD-2016-GimenezO #2d #automaton #interactive #interpreter
Interaction Automata and the ia2d Interpreter (SG, DO), p. 11.
FSCD-2016-0001T #confluence #induction #proving
Ground Confluence Prover based on Rewriting Induction (TA0, YT), p. 12.
FSCD-2016-RappM #automation #first-order #linear #term rewriting
Automating the First-Order Theory of Rewriting for Left-Linear Right-Ground Rewrite Systems (FR, AM), p. 12.
FSCD-2016-AkiyoshiT #normalisation #polymorphism #λ-calculus
Strong Normalization for the Parameter-Free Polymorphic Lambda Calculus Based on the Omega-Rule. (RA, KT), p. 15.
FSCD-2016-ArieliA #consistency #logic #nondeterminism #reasoning
Minimal Paradefinite Logics for Reasoning with Incompleteness and Inconsistency (OA, AA), p. 15.
FSCD-2016-BrenasES #correctness #graph grammar #proving #term rewriting
Proving Correctness of Logically Decorated Graph Rewriting Systems (JHB, RE, MS), p. 15.
FSCD-2016-Laird #modelling #relational
Weighted Relational Models for Mobility (JL), p. 15.
FSCD-2016-Vries #on the
On Undefined and Meaningless in Lambda Definability (FJdV), p. 15.
FSCD-2016-AltenkirchK #dependent type #evaluation #normalisation
Normalisation by Evaluation for Dependent Types (TA, AK), p. 16.
FSCD-2016-BenkeSC #first-order #functional #logic #source code #synthesis
Synthesis of Functional Programs with Help of First-Order Intuitionistic Logic (MB, AS, DWC), p. 16.
FSCD-2016-DudenhefnerMR #problem #unification
The Intersection Type Unification Problem (AD, MM, JR), p. 16.
FSCD-2016-SternagelS #automaton #confluence #orthogonal
Certifying Confluence of Almost Orthogonal CTRSs via Exact Tree Automata Completion (CS, TS), p. 16.
FSCD-2016-AristizabalBLP #bisimulation #generative
Environmental Bisimulations for Delimited-Control Operators with Dynamic Prompt Generation (AA, DB, SL, PP), p. 17.
FSCD-2016-Ayala-RinconFN
Nominal Narrowing (MAR, MF, DNS), p. 17.
FSCD-2016-Blot #continuation #modelling
Classical Extraction in Continuation Models (VB), p. 17.
FSCD-2016-KahrsS
Non-Omega-Overlapping TRSs are UN (SK, CS), p. 17.
FSCD-2016-Laurent
Focusing in Orthologic (OL), p. 17.
FSCD-2016-LibalM #higher-order #unification
Functions-as-Constructors Higher-Order Unification (TL, DM0), p. 17.
FSCD-2016-MalbosM #term rewriting
Homological Computations for Term Rewriting Systems (PM, SM), p. 17.
FSCD-2016-Traytel #formal method
Formal Languages, Formally and Coinductively (DT), p. 17.
FSCD-2016-0001PV #term rewriting
Reversible Term Rewriting (NN0, AP, GV), p. 18.
FSCD-2016-Arisaka #calculus #interactive
Structural Interactions and Absorption of Structural Rules in BI Sequent Calculus (RA), p. 18.
FSCD-2016-AvanziniM #complexity #graph grammar
Complexity of Acyclic Term Graph Rewriting (MA, GM), p. 18.
FSCD-2016-BreuvartMPR
New Results on Morris's Observational Theory: The Benefits of Separating the Inseparable (FB, GM, AP, DR), p. 18.
FSCD-2016-ChaudhuriMS #composition #logic #proving
Modular Focused Proof Systems for Intuitionistic Modal Logics (KC, SM, LS), p. 18.
FSCD-2016-CoquandM #independence #markov #type system
The Independence of Markov's Principle in Type Theory (TC, BM), p. 18.
FSCD-2016-GuerrieriPF #proving
Computing Connected Proof(-Structure)s From Their Taylor Expansion (GG, LP, LTdF), p. 18.
FSCD-2016-Hamana #algebra #category theory #higher-order #normalisation
Strongly Normalising Cyclic Data Computation by Iteration Categories of Second-Order Algebraic Theories (MH), p. 18.
FSCD-2016-KopS #complexity #higher-order
Complexity Hierarchies and Higher-Order Cons-Free Rewriting (CK, JGS), p. 18.
FSCD-2016-OostromT #normalisation #random
Normalisation by Random Descent (VvO, YT), p. 18.
FSCD-2016-Timany0 #category theory #coq
Category Theory in Coq 8.5 (AT, BJ0), p. 18.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.