Reasoning about call-by-need by means of types

DOI10.1007/978-3-662-49630-5_25MaRDI QIDQ2811356zbMATH OpenOpenAlexFDO

Authors Delia Kesner

Publication date 10 June 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-49630-5_25

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Call-by-need, neededness and all that
• The call-by-need lambda calculus
• The call-by-need lambda calculus
• Contextual equivalences in call-by-need and call-by-name polymorphically typed calculi (preliminary report)
• Realizability interpretation and normalization of typed call-by-need \(\lambda\)-calculus with control

Cites work

• scientific article; zbMATH DE number 482822 (Why is no real title available?)
• scientific article; zbMATH DE number 1479634 (Why is no real title available?)
• A filter lambda model and the completeness of type assignment
• A linearization of the Lambda-calculus and consequences
• A new type assignment for λ-terms
• A semantics for lambda calculi with resources
• An extension of basic functionality theory for -calculus
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Call-by-name, call-by-value, call-by-need and the linear lambda calculus
• Complete restrictions of the intersection type discipline
• Distilling abstract machines
• Functional Characters of Solvable Terms
• Non-idempotent intersection types and strong normalisation
• Principality and type inference for intersection types using expansion variables
• Quantitative types for the linear substitution calculus
• Solvability in resource lambda-calculus
• The Call-by-Need Lambda Calculus, Revisited
• The Inhabitation Problem for Non-idempotent Intersection Types
• The call-by-need lambda calculus
• The call-by-need lambda calculus
• Types, potency, and idempotency: why nonlinearity and amnesia make a type system work

Cited in

(18)

• scientific article; zbMATH DE number 7204428 (Why is no real title available?)
• scientific article; zbMATH DE number 1701352 (Why is no real title available?)
• Inhabitation for non-idempotent intersection types
• scientific article; zbMATH DE number 7204443 (Why is no real title available?)
• The spirit of node replication
• Types by need
• Taylor expansion, finiteness and strategies
• A Fresh Look at the λ-Calculus
• Call-by-need, neededness and all that
• Realizability interpretation and normalization of typed call-by-need \(\lambda\)-calculus with control
• scientific article; zbMATH DE number 1479634 (Why is no real title available?)
• The bang calculus revisited
• Node Replication: Theory And Practice
• Normalization by Evaluation for Typed Weak lambda-Reduction
• The bang calculus revisited
• On the value of variables
• scientific article; zbMATH DE number 7155170 (Why is no real title available?)
• scientific article; zbMATH DE number 7756108 (Why is no real title available?)

This page was built for publication: Reasoning about call-by-need by means of types

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