On the Taylor expansion of probabilistic λ-terms
From MaRDI portal
(Redirected from Publication:5089013)
Recommendations
Cites work
- A lambda-calculus foundation for universal probabilistic programming
- Differential interaction nets
- Domain theory, testing and simulation for labelled Markov processes
- Full abstraction for probabilistic PCF
- Generalised species of rigid resource terms
- scientific article; zbMATH DE number 4179422 (Why is no real title available?)
- scientific article; zbMATH DE number 1231449 (Why is no real title available?)
- Linear logic
- Logical Approaches to Computational Barriers
- Probabilistic Böhm trees and probabilistic separation
- Revisiting call-by-value Böhm trees in light of their Taylor expansion
- Species, profunctors and Taylor expansion weighted by SMCC. A unified framework for modelling nondeterministic, probabilistic and quantum programs
- The algebraic lambda calculus
- The differential lambda-calculus
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Uniformity and the Taylor expansion of ordinary lambda-terms
Cited in
(9)- Taylor expansion, finiteness and strategies
- Revisiting call-by-value Böhm trees in light of their Taylor expansion
- On the Taylor expansion of -terms and the groupoid structure of their rigid approximants
- scientific article; zbMATH DE number 7089070 (Why is no real title available?)
- Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications
- Resource approximation for the -calculus
- Categorifying non-idempotent intersection types
- Extensional Taylor expansion
- How to play the accordion: uniformity and the (non-)conservativity of the linear approximation of the -calculus
This page was built for publication: On the Taylor expansion of probabilistic λ-terms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089013)