default search action
4th FSCD 2019: Dortmund, Germany
- Herman Geuvers
:
4th International Conference on Formal Structures for Computation and Deduction, FSCD 2019, June 24-30, 2019, Dortmund, Germany. LIPIcs 131, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-107-8 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:20
- Beniamino Accattoli:
A Fresh Look at the lambda-Calculus (Invited Talk). 1:1-1:20 - Amy P. Felty
A Linear Logical Framework in Hybrid (Invited Talk). 2:1-2:2 - Sarah Winkler
Extending Maximal Completion (Invited Talk). 3:1-3:15 - Hongseok Yang:
Some Semantic Issues in Probabilistic Programming Languages (Invited Talk). 4:1-4:6 - Benedikt Ahrens
Bicategories in Univalent Foundations. 5:1-5:17 - Benedikt Ahrens
Modular Specification of Monads Through Higher-Order Presentations. 6:1-6:19 - Maciej Bendkowski:
Towards the Average-Case Analysis of Substitution Resolution in Lambda-Calculus. 7:1-7:21 - Malgorzata Biernacka
Deriving an Abstract Machine for Strong Call by Need. 8:1-8:20 - Frédéric Blanqui
Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting. 9:1-9:21 - David M. Cerna
A Generic Framework for Higher-Order Generalizations. 10:1-10:19 - Thierry Coquand, Simon Huber, Christian Sattler:
Homotopy Canonicity for Cubical Type Theory. 11:1-11:23 - Lukasz Czajka
Polymorphic Higher-Order Termination. 12:1-12:18 - Ugo Dal Lago
On the Taylor Expansion of Probabilistic lambda-terms. 13:1-13:16 - Alejandro Díaz-Caro
Proof Normalisation in a Logic Identifying Isomorphic Propositions. 14:1-14:23 - Alberto Ciaffaglione, Pietro Di Gianantonio
lambda!-calculus, Intersection Types, and Involutions. 15:1-15:16 - Clovis Eberhart, Tom Hirschowitz
Template Games, Simple Games, and Day Convolution. 16:1-16:19 - Thomas Ehrhard
Differentials and Distances in Probabilistic Coherence Spaces. 17:1-17:17 - José Espírito Santo
Modal Embeddings and Calling Paradigms. 18:1-18:20 - Claudia Faggian:
Probabilistic Rewriting: Normalization, Termination, and Unique Normal Forms. 19:1-19:25 - Yosuke Fukuda
A Linear-Logical Reconstruction of Intuitionistic Modal Logic S4. 20:1-20:24 - Alfons Geser, Dieter Hofbauer, Johannes Waldmann:
Sparse Tiling Through Overlap Closures for Termination of String Rewriting. 21:1-21:21 - Willem Heijltjes
Proof Nets for First-Order Additive Linear Logic. 22:1-22:22 - Ross Horne
The Sub-Additives: A Proof Theory for Probabilistic Choice extending Linear Logic. 23:1-23:16 - Mirai Ikebuchi:
A Lower Bound of the Number of Rewrite Rules Obtained by Homological Methods. 24:1-24:17 - Ambrus Kaposi
Gluing for Type Theory. 25:1-25:19 - Simona Kasterovic
The Discriminating Power of the Let-In Operator in the Lazy Call-by-Name Probabilistic lambda-Calculus. 26:1-26:20 - Dominique Larchey-Wendling
Hilbert's Tenth Problem in Coq. 27:1-27:20 - Luigi Liquori, Claude Stolze:
The Delta-calculus: Syntax and Types. 28:1-28:20 - Paulin Jacobé de Naurois:
Pointers in Recursion: Exploring the Tropics. 29:1-29:18 - Maciej Piróg
Typed Equivalence of Effect Handlers and Delimited Control. 30:1-30:16 - Jonathan Sterling
Cubical Syntax for Reflection-Free Extensional Equality. 31:1-31:25 - Niccolò Veltri
Guarded Recursion in Agda via Sized Types. 32:1-32:19 - Pierre Vial:
Sequence Types for Hereditary Permutators. 33:1-33:15 - Rubén Rubio
Model Checking Strategy-Controlled Rewriting Systems (System Description). 34:1-34:18
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 2024-12-16 22:15 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: