Quantitative semantics of the lambda calculus. Some generalisations of the relational model
From MaRDI portal
Recommendations
Cited in
(25)- Semantics of a relational \(\lambda\)-calculus
- Weighted models for higher-order computation
- Language-theoretic and finite relation models for the (full) Lambek calculus
- Quantitative \(\mu\)-calculus and CTL defined over constraint semirings
- Relational models for the Lambek calculus with intersection and unit
- Relativization of quantifiers in finite models
- What is a model for a semantically linear -calculus?
- From qualitative to quantitative semantics. By change of base
- On the Taylor expansion of -terms and the groupoid structure of their rigid approximants
- Tight typings and split bounds, fully developed
- Convenient antiderivatives for differential linear categories
- Species, profunctors and Taylor expansion weighted by SMCC. A unified framework for modelling nondeterministic, probabilistic and quantum programs
- Weighted relational models of typed lambda-calculi
- A quantitative model for simply typed λ-calculus
- Monoidal reverse differential categories
- scientific article; zbMATH DE number 7756108 (Why is no real title available?)
- On Quantitative Algebraic Higher-Order Theories
- Graded differential categories and graded differential linear logic
- Free commutative monoids in homotopy type theory
- A deep quantitative type system
- The relational quotient completion
- Semantic bounds and multi types, revisited
- Laplace distributors and Laplace transformations for differential categories
- The relational machine calculus
- Coherent Taylor expansion as a bimonad
This page was built for publication: Quantitative semantics of the lambda calculus. Some generalisations of the relational model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5144610)