The lambda calculus is quantifiable

DOI10.4230/LIPICS.CSL.2025.34MaRDI QIDQ7261446zbMATH OpenFDO

Authors Valentin Maestracci, Paolo Pistone

Publication date 9 June 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CSL.2025.34

zbMATH Keywords

Böhm treeslambda-calculuspartial metric spacesScott semanticsTaylor expansion

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cites work

• A characterization of partial metrizability: Domains are quantifiable.
• A partial metric semantics of higher-order types and approximate program transformations
• A semantic account of metric preservation
• An internal language for categories enriched over generalised metric spaces
• Characterization of quantale-valued metric spaces and quantale-valued partial metric spaces by convergence
• Complete partial metric spaces have partially metrizable computational models
• Completions of partial metric spaces
• Differential logical relations. I: The simply-typed case
• Distance and measurement in domain theory
• Distance makes the types grow stronger: a calculus for differential privacy
• Exponentiation in \({\mathcal V}\)-categories
• Genericity through stratification
• scientific article; zbMATH DE number 3961577 (Why is no real title available?)
• scientific article; zbMATH DE number 1229489 (Why is no real title available?)
• scientific article; zbMATH DE number 1107508 (Why is no real title available?)
• scientific article; zbMATH DE number 1114330 (Why is no real title available?)
• scientific article; zbMATH DE number 2103282 (Why is no real title available?)
• Infinitary lambda calculus
• Logical Approaches to Computational Barriers
• Metric reasoning about -terms: the general case
• Metrizability of partial metric spaces
• Non-idempotent intersection types for the lambda-calculus
• Non-linearity as the metric completion of linearity
• Not Enough Points Is Enough
• On Quantitative Algebraic Higher-Order Theories
• On the lattice of program metrics
• Partial Hausdorff metric and Nadler's fixed point theorem on partial metric spaces
• Partial metric spaces
• PCF extended with real numbers
• Quantitative Algebraic Reasoning
• Quantitative Behavioural Reasoning for Higher-order Effectful Programs
• The constructive maximal point space and partial metrizability
• The correspondence between partial metrics and semivaluations
• The differential lambda-calculus
• The way-below relation of function spaces over semantic domains
• Topology from enrichment: the curious case of partial metrics
• Uniformity and the Taylor expansion of ordinary lambda-terms

This page was built for publication: The lambda calculus is quantifiable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7261446)