A strong call-by-need calculus

DOI10.46298/lmcs-19(1:21)2023arXiv2111.01485MaRDI QIDQ6135746

Guillaume Melquiond, Thibaut Balabonski, Unnamed Author

Publication date: 26 August 2023

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.01485

zbMATH Keywords

normalizationcall-by-needstrong reductionevaluation strategy

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of computing (68Qxx) Computer science (68-XX)

Related Items (1)

A strong call-by-need calculus

Cites Work

• Unnamed Item
• Unnamed Item
• An extension of basic functionality theory for \(\lambda\)-calculus
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• The locally nameless representation
• An abstract machine for strong call by value
• Reasoning About Call-by-need by Means of Types
• Distilling abstract machines
• Local Bigraphs and Confluence: Two Conjectures
• The Call-by-Need Lambda Calculus, Revisited
• A unified approach to fully lazy sharing
• A compiled implementation of strong reduction
• Quantitative Types for the Linear Substitution Calculus
• A Theory of Explicit Substitutions with Safe and Full Composition
• A Strong Distillery
• The Structural λ-Calculus
• The call-by-need lambda calculus
• Non-idempotent intersection types for the Lambda-Calculus
• Parametric higher-order abstract syntax for mechanized semantics
• Abella: A System for Reasoning about Relational Specifications
• Weak optimality, and the meaning of sharing
• A nonstandard standardization theorem
• A strong call-by-need calculus

This page was built for publication: A strong call-by-need calculus