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