bibliographer a curated TCS bibliography
  • obsidian
  • tags
  • authors
  • no doi
  • no pdf
  • bad author
  • add item
  • librarian

Making progress: Reducibility Candidates and Cut Elimination in the Ill-founded Realm Gianluca Curzi Graham E. Leigh [github]
Computational expressivity of (circular) proofs with fixed points Gianluca Curzi Anupam Das [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]

Library Size: 13G (3 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A badge
[show logs] [hide logs]