bibliographer - Michele Pagani

bibliographer a curated TCS bibliography

obsidian
tags
authors
no doi
no pdf
bad author
add item
librarian

Variable Elimination as Rewriting in a Linear Lambda Calculus Thomas Ehrhard Claudia Faggian Michele Pagani [github]

The Benefit of Being Non-Lazy in Probabilistic łambda-Calculus: Applicative Bisimulation is Fully Abstract for Non-Lazy Probabilistic Call-by-Name Gianluca Curzi Michele Pagani [github]

Revisiting Call-by-value Bohm trees in light of their Taylor expansion Emma Kerinec Giulio Manzonetto Michele Pagani [github]

Modelling Coeffects in the Relational Semantics of Linear Logic Flavien Breuvart Michele Pagani [github]

The Computational Meaning of Probabilistic Coherence Spaces Thomas Ehrhard Michele Pagani Christine Tasson [github]

Measurable cones and stable, measurable functions: a model for probabilistic higher-order programming Thomas Ehrhard Michele Pagani Christine Tasson [github]

Full Abstraction for Probabilistic PCF Thomas Ehrhard Michele Pagani Christine Tasson [github]

Backpropagation in the simply typed lambda-calculus with linear negation Aloïs Brunel Damiano Mazza Michele Pagani [github]

Automatic differentiation in PCF Damiano Mazza Michele Pagani [github]

Library Size: 13G (9 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A

[show logs] [hide logs]