Portal - FSCD 2019

FSCD 2019	June 24-30, 2019, Dortmund, Germany
4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019) Herman Geuvers (Ed.)
ISBN 978-3-95977-107-8, LIPICS Vol. 131	ISSN 1868-8969

Additional Information

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

Authors

Biernacka, Malgorzata

Blanqui, Frédéric

Cerna, David M.

Charatonik, Witold

Ciaffaglione, Alberto

Di Gianantonio, Pietro

Hughes, Dominic J. D.

Ikebuchi, Mirai

Jacobé de Naurois, Paulin

Larchey-Wendling, Dominique

Front Matter, Table of Contents, Preface, Conference Organization

Authors: Geuvers, Herman

Abstract | Document (339 KB) | BibTeX

A Fresh Look at the lambda-Calculus (Invited Talk)

Authors: Accattoli, Beniamino

Abstract | Document (478 KB) | BibTeX

A Linear Logical Framework in Hybrid (Invited Talk)

Authors: Felty, Amy P.

Abstract | Document (208 KB) | BibTeX

Extending Maximal Completion (Invited Talk)

Authors: Winkler, Sarah

Abstract | Document (505 KB) | BibTeX

Some Semantic Issues in Probabilistic Programming Languages (Invited Talk)

Authors: Yang, Hongseok

Abstract | Document (352 KB) | BibTeX

Bicategories in Univalent Foundations

Authors: Ahrens, Benedikt ; Frumin, Dan ; Maggesi, Marco ; van der Weide, Niels

Abstract | Document (575 KB) | BibTeX

Modular Specification of Monads Through Higher-Order Presentations

Authors: Ahrens, Benedikt ; Hirschowitz, André ; Lafont, Ambroise ; Maggesi, Marco

Abstract | Document (652 KB) | BibTeX

Towards the Average-Case Analysis of Substitution Resolution in Lambda-Calculus

Authors: Bendkowski, Maciej

Abstract | Document (617 KB) | BibTeX

Deriving an Abstract Machine for Strong Call by Need

Authors: Biernacka, Malgorzata ; Charatonik, Witold

Abstract | Document (543 KB) | BibTeX

Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting

Authors: Blanqui, Frédéric ; Genestier, Guillaume ; Hermant, Olivier

Abstract | Document (607 KB) | BibTeX

A Generic Framework for Higher-Order Generalizations

Authors: Cerna, David M. ; Kutsia, Temur

Abstract | Document (550 KB) | BibTeX

Homotopy Canonicity for Cubical Type Theory

Authors: Coquand, Thierry ; Huber, Simon ; Sattler, Christian

Abstract | Document (654 KB) | BibTeX

Polymorphic Higher-Order Termination

Authors: Czajka, Lukasz ; Kop, Cynthia

Abstract | Document (550 KB) | BibTeX

On the Taylor Expansion of Probabilistic lambda-terms

Authors: Dal Lago, Ugo ; Leventis, Thomas

Abstract | Document (615 KB) | BibTeX

Proof Normalisation in a Logic Identifying Isomorphic Propositions

Authors: Díaz-Caro, Alejandro ; Dowek, Gilles

Abstract | Document (553 KB) | BibTeX

lambda!-calculus, Intersection Types, and Involutions

Authors: Ciaffaglione, Alberto ; Di Gianantonio, Pietro ; Honsell, Furio ; Lenisa, Marina ; Scagnetto, Ivan

Abstract | Document (523 KB) | BibTeX

Template Games, Simple Games, and Day Convolution

Authors: Eberhart, Clovis ; Hirschowitz, Tom ; Laouar, Alexis

Abstract | Document (527 KB) | BibTeX

Differentials and Distances in Probabilistic Coherence Spaces

Authors: Ehrhard, Thomas

Abstract | Document (628 KB) | BibTeX

Modal Embeddings and Calling Paradigms

Authors: Espírito Santo, José ; Pinto, Luís ; Uustalu, Tarmo

Abstract | Document (559 KB) | BibTeX

Probabilistic Rewriting: Normalization, Termination, and Unique Normal Forms

Authors: Faggian, Claudia

Abstract | Document (1,100 KB) | BibTeX

A Linear-Logical Reconstruction of Intuitionistic Modal Logic S4

Authors: Fukuda, Yosuke ; Yoshimizu, Akira

Abstract | Document (1,197 KB) | BibTeX

Sparse Tiling Through Overlap Closures for Termination of String Rewriting

Authors: Geser, Alfons ; Hofbauer, Dieter ; Waldmann, Johannes

Abstract | Document (631 KB) | BibTeX

Proof Nets for First-Order Additive Linear Logic

Authors: Heijltjes, Willem B. ; Hughes, Dominic J. D. ; Straßburger, Lutz

Abstract | Document (684 KB) | BibTeX

The Sub-Additives: A Proof Theory for Probabilistic Choice extending Linear Logic

Authors: Horne, Ross

Abstract | Document (672 KB) | BibTeX

A Lower Bound of the Number of Rewrite Rules Obtained by Homological Methods

Authors: Ikebuchi, Mirai

Abstract | Document (623 KB) | BibTeX

Gluing for Type Theory

Authors: Kaposi, Ambrus ; Huber, Simon ; Sattler, Christian

Abstract | Document (504 KB) | BibTeX

The Discriminating Power of the Let-In Operator in the Lazy Call-by-Name Probabilistic lambda-Calculus

Authors: Kasterovic, Simona ; Pagani, Michele

Abstract | Document (632 KB) | BibTeX

Hilbert's Tenth Problem in Coq

Authors: Larchey-Wendling, Dominique ; Forster, Yannick

Abstract | Document (608 KB) | BibTeX

The Delta-calculus: Syntax and Types

Authors: Liquori, Luigi ; Stolze, Claude

Abstract | Document (594 KB) | BibTeX

Pointers in Recursion: Exploring the Tropics

Authors: Jacobé de Naurois, Paulin

Abstract | Document (488 KB) | BibTeX

Typed Equivalence of Effect Handlers and Delimited Control

Authors: Piróg, Maciej ; Polesiuk, Piotr ; Sieczkowski, Filip

Abstract | Document (489 KB) | BibTeX

Cubical Syntax for Reflection-Free Extensional Equality

Authors: Sterling, Jonathan ; Angiuli, Carlo ; Gratzer, Daniel

Abstract | Document (760 KB) | BibTeX

Guarded Recursion in Agda via Sized Types

Authors: Veltri, Niccolò ; van der Weide, Niels

Abstract | Document (515 KB) | BibTeX

Sequence Types for Hereditary Permutators

Authors: Vial, Pierre

Abstract | Document (586 KB) | BibTeX

Model Checking Strategy-Controlled Rewriting Systems (System Description)

Authors: Rubio, Rubén ; Martí-Oliet, Narciso ; Pita, Isabel ; Verdejo, Alberto

Abstract | Document (522 KB) | BibTeX

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

4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019)