Types by need

DOI10.1007/978-3-030-17184-1_15MaRDI QIDQ6070792zbMATH OpenOpenAlexFDO

Authors Beniamino Accattoli, Giulio Guerrieri, Maico Leberle

Publication date 24 November 2023

Published in Programming Languages and Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-030-17184-1_15

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Reasoning about call-by-need by means of types
• Tight typings and split bounds, fully developed
• Call-by-value, elementary time and intersection types
• Intersection types and termination properties
• The call-by-need lambda calculus

Cited in

(10)

• The bang calculus revisited
• Towards a semantic measure of the execution time in call-by-value lambda-calculus
• A Fresh Look at the λ-Calculus
• Encoding tight typing in a unified framework
• Quantitative weak linearisation
• Strong call-by-value and multi types
• Semantic bounds and multi types, revisited
• Mirroring call-by-need, or values acting silly
• Separating terms by means of multi types, coinductively
• Mirroring call-by-need, or values acting silly

This page was built for publication: Types by need

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