Reasoning about call-by-need by means of types

DOI10.1007/978-3-662-49630-5_25zbMATH Open1475.68064OpenAlexW2460688276MaRDI QIDQ2811356FDOQ2811356

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

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

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cites Work

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

Cited In (18)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Inhabitation for non-idempotent intersection types
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Node Replication: Theory And Practice
• The bang calculus revisited
• Normalization by Evaluation for Typed Weak lambda-Reduction
• The bang calculus revisited
• On the value of variables
• Title not available (Why is that?)
• Title not available (Why is that?)

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)