FSCD B

36 papers

YearTitle / Authors
20194th International Conference on Formal Structures for Computation and Deduction, FSCD 2019, Dortmund, Germany, June 24-30, 2019
Herman Geuvers
2019A Fresh Look at the lambda-Calculus (Invited Talk).
Beniamino Accattoli
2019A Generic Framework for Higher-Order Generalizations.
David M. Cerna, Temur Kutsia
2019A Linear Logical Framework in Hybrid (Invited Talk).
Amy P. Felty
2019A Linear-Logical Reconstruction of Intuitionistic Modal Logic S4.
Yosuke Fukuda, Akira Yoshimizu
2019A Lower Bound of the Number of Rewrite Rules Obtained by Homological Methods.
Mirai Ikebuchi
2019Bicategories in Univalent Foundations.
Benedikt Ahrens, Dan Frumin, Marco Maggesi, Niels van der Weide
2019Cubical Syntax for Reflection-Free Extensional Equality.
Jonathan Sterling, Carlo Angiuli, Daniel Gratzer
2019Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting.
Frédéric Blanqui, Guillaume Genestier, Olivier Hermant
2019Deriving an Abstract Machine for Strong Call by Need.
Malgorzata Biernacka, Witold Charatonik
2019Differentials and Distances in Probabilistic Coherence Spaces.
Thomas Ehrhard
2019Extending Maximal Completion (Invited Talk).
Sarah Winkler
2019Front Matter, Table of Contents, Preface, Conference Organization.
2019Gluing for Type Theory.
Ambrus Kaposi, Simon Huber, Christian Sattler
2019Guarded Recursion in Agda via Sized Types.
Niccolò Veltri, Niels van der Weide
2019Hilbert's Tenth Problem in Coq.
Dominique Larchey-Wendling, Yannick Forster
2019Homotopy Canonicity for Cubical Type Theory.
Thierry Coquand, Simon Huber, Christian Sattler
2019Modal Embeddings and Calling Paradigms.
José Espírito Santo, Luís Pinto, Tarmo Uustalu
2019Model Checking Strategy-Controlled Rewriting Systems (System Description).
Rubén Rubio, Narciso Martí-Oliet, Isabel Pita, Alberto Verdejo
2019Modular Specification of Monads Through Higher-Order Presentations.
Benedikt Ahrens, André Hirschowitz, Ambroise Lafont, Marco Maggesi
2019On the Taylor Expansion of Probabilistic lambda-terms.
Ugo Dal Lago, Thomas Leventis
2019Pointers in Recursion: Exploring the Tropics.
Paulin Jacobé de Naurois
2019Polymorphic Higher-Order Termination.
Lukasz Czajka, Cynthia Kop
2019Probabilistic Rewriting: Normalization, Termination, and Unique Normal Forms.
Claudia Faggian
2019Proof Nets for First-Order Additive Linear Logic.
Willem Heijltjes, Dominic J. D. Hughes, Lutz Straßburger
2019Proof Normalisation in a Logic Identifying Isomorphic Propositions.
Alejandro Díaz-Caro, Gilles Dowek
2019Sequence Types for Hereditary Permutators.
Pierre Vial
2019Some Semantic Issues in Probabilistic Programming Languages (Invited Talk).
Hongseok Yang
2019Sparse Tiling Through Overlap Closures for Termination of String Rewriting.
Alfons Geser, Dieter Hofbauer, Johannes Waldmann
2019Template Games, Simple Games, and Day Convolution.
Clovis Eberhart, Tom Hirschowitz, Alexis Laouar
2019The Delta-calculus: Syntax and Types.
Luigi Liquori, Claude Stolze
2019The Discriminating Power of the Let-In Operator in the Lazy Call-by-Name Probabilistic lambda-Calculus.
Simona Kasterovic, Michele Pagani
2019The Sub-Additives: A Proof Theory for Probabilistic Choice extending Linear Logic.
Ross Horne
2019Towards the Average-Case Analysis of Substitution Resolution in Lambda-Calculus.
Maciej Bendkowski
2019Typed Equivalence of Effect Handlers and Delimited Control.
Maciej Piróg, Piotr Polesiuk, Filip Sieczkowski
2019lambda!-calculus, Intersection Types, and Involutions.
Alberto Ciaffaglione, Pietro Di Gianantonio, Furio Honsell, Marina Lenisa, Ivan Scagnetto