Hybrid intersection types for PCF

DOI10.29007/GVZXMaRDI QIDQ7025188zbMATH OpenFDO

Authors Pablo Barenbaum, Delia Kesner, Mariana Milicich

Publication date 19 February 2025

Full work available at URL https://doi.org/10.29007/GVZX

zbMATH Keywords

call by namecall by valueevaluation strategiesintersection typeslambda calculusquantitative models

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cites work

• A coherent differential PCF
• An extension of basic functionality theory for -calculus
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Call-By-Push-Value from a Linear Logic Point of View
• Collapsing non-idempotent intersection types
• Encoding tight typing in a unified framework
• Full abstraction for PCF
• Full abstraction for probabilistic PCF
• Fully abstract models of typed \(\lambda\)-calculi
• Game-theoretic analysis of call-by-value computation
• scientific article; zbMATH DE number 1479634 (Why is no real title available?)
• Introduction to the theory of programming languages.
• LCF considered as a programming language
• Linear logic
• Non-idempotent intersection types for the lambda-calculus
• The bang calculus revisited
• The Inhabitation Problem for Non-idempotent Intersection Types
• Tight typings and split bounds, fully developed
• Types of fireballs

This page was built for publication: Hybrid intersection types for PCF

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