Proceedings of the Fourth 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

Herman Geuvers
Proceedings of the Fourth International Conference on Formal Structures for Computation and Deduction
FSCD, 2019.

FM
DBLP
Scholar
?EE?
Full names Links ISxN
@proceedings{FSCD-2019,
	editor        = "Herman Geuvers",
	ee            = "http://www.dagstuhl.de/dagpub/978-3-95977-107-8",
	isbn          = "978-3-95977-107-8",
	publisher     = "{Schloss Dagstuhl - Leibniz-Zentrum für Informatik}",
	series        = "{Leibniz International Proceedings in Informatics}",
	title         = "{Proceedings of the Fourth International Conference on Formal Structures for Computation and Deduction}",
	volume        = 131,
	year          = 2019,
}

Contents (34 items)

FSCD-2019-Felty #framework #hybrid #linear #logic
A Linear Logical Framework in Hybrid (Invited Talk) (APF), p. 2.
FSCD-2019-Yang #probability #programming language #semantics
Some Semantic Issues in Probabilistic Programming Languages (Invited Talk) (HY), p. 6.
FSCD-2019-Vial #sequence
Sequence Types for Hereditary Permutators (PV), p. 15.
FSCD-2019-Winkler
Extending Maximal Completion (Invited Talk) (SW), p. 15.
FSCD-2019-CiaffaglioneGHL #calculus #exclamation
lambda!-calculus, Intersection Types, and Involutions (AC, PDG, FH, ML, IS), p. 16.
FSCD-2019-Horne #linear #logic #probability #proving
The Sub-Additives: A Proof Theory for Probabilistic Choice extending Linear Logic (RH), p. 16.
FSCD-2019-LagoL #on the #probability #λ-calculus
On the Taylor Expansion of Probabilistic lambda-terms (UDL, TL), p. 16.
FSCD-2019-PirogPS #equivalence
Typed Equivalence of Effect Handlers and Delimited Control (MP, PP, FS), p. 16.
FSCD-2019-AhrensFMW
Bicategories in Univalent Foundations (BA, DF, MM, NvdW), p. 17.
FSCD-2019-Ehrhard #probability
Differentials and Distances in Probabilistic Coherence Spaces (TE), p. 17.
FSCD-2019-Ikebuchi #bound
A Lower Bound of the Number of Rewrite Rules Obtained by Homological Methods (MI), p. 17.
FSCD-2019-0001K #higher-order #polymorphism #termination
Polymorphic Higher-Order Termination (LC0, CK), p. 18.
FSCD-2019-Naurois #pointer #recursion
Pointers in Recursion: Exploring the Tropics (PJdN), p. 18.
FSCD-2019-RubioMPV #model checking #term rewriting
Model Checking Strategy-Controlled Rewriting Systems (System Description) (RR, NMO, IP, AV), p. 18.
FSCD-2019-AhrensHLM #composition #higher-order #monad #specification
Modular Specification of Monads Through Higher-Order Presentations (BA, AH, AL, MM), p. 19.
FSCD-2019-CernaK #framework #higher-order
A Generic Framework for Higher-Order Generalizations (DMC, TK), p. 19.
FSCD-2019-EberhartHL #game studies
Template Games, Simple Games, and Day Convolution (CE, TH, AL), p. 19.
FSCD-2019-KaposiHS #type system
Gluing for Type Theory (AK, SH, CS), p. 19.
FSCD-2019-VeltriW #recursion
Guarded Recursion in Agda via Sized Types (NV, NvdW), p. 19.
FSCD-2019-Accattoli #fresh look #λ-calculus
A Fresh Look at the lambda-Calculus (Invited Talk) (BA), p. 20.
FSCD-2019-BiernackaC #automaton #call-by
Deriving an Abstract Machine for Strong Call by Need (MB, WC), p. 20.
FSCD-2019-KasterovicP #call-by #lazy evaluation #power of #probability #λ-calculus
The Discriminating Power of the Let-In Operator in the Lazy Call-by-Name Probabilistic lambda-Calculus (SK, MP), p. 20.
FSCD-2019-Larchey-Wendling #coq #problem
Hilbert's Tenth Problem in Coq (DLW, YF0), p. 20.
FSCD-2019-LiquoriS #calculus #syntax
The Delta-calculus: Syntax and Types (LL, CS), p. 20.
FSCD-2019-SantoPU #paradigm
Modal Embeddings and Calling Paradigms (JES, LP, TU), p. 20.
FSCD-2019-Bendkowski #analysis #towards #λ-calculus
Towards the Average-Case Analysis of Substitution Resolution in Lambda-Calculus (MB), p. 21.
FSCD-2019-BlanquiGH #dependence #dependent type #modulo theories #termination #type system
Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting (FB, GG, OH), p. 21.
FSCD-2019-GeserHW #string #termination
Sparse Tiling Through Overlap Closures for Termination of String Rewriting (AG, DH, JW), p. 21.
FSCD-2019-HeijltjesHS #first-order #linear #logic #proving
Proof Nets for First-Order Additive Linear Logic (WH, DJDH, LS), p. 22.
FSCD-2019-CoquandHS #type system
Homotopy Canonicity for Cubical Type Theory (TC, SH, CS), p. 23.
FSCD-2019-Diaz-CaroD #identification #logic #normalisation #proving
Proof Normalisation in a Logic Identifying Isomorphic Propositions (ADC, GD), p. 23.
FSCD-2019-FukudaY #logic #re-engineering
A Linear-Logical Reconstruction of Intuitionistic Modal Logic S4 (YF0, AY), p. 24.
FSCD-2019-Faggian #normalisation #probability #termination
Probabilistic Rewriting: Normalization, Termination, and Unique Normal Forms (CF), p. 25.
FSCD-2019-SterlingAG #similarity #syntax
Cubical Syntax for Reflection-Free Extensional Equality (JS, CA, DG), p. 25.

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.