The Maximal MAM, a Reasonable Implementation of the Maximal Strategy

2017/11/28 by Beniamino Accattoli, Accattoli, Beniamino · 1 citation
Computer Science · #FOS: Computer and information sciences #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Programming Languages (cs.PL) #cs.LO #cs.PL

paper · pdf · doi:10.48550/arxiv.1711.10301

arxiv created 2017/11/28 · openalex publication_date 2017/11/28 · arxiv updated 2017/11/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This note is about a reasonable abstract machine, called Maximal MAM, implementing the maximal strategy of the lambda-calculus, that is, the strategy that always produces a longest evaluation sequence.

Cited by

• (In)Efficiency and Reasonable Cost Models

Related

• Strong Call-by-Value is Reasonable, Implosively
• A Diamond Machine For Strong Evaluation
• Reduction Strategies in the Lambda Calculus and Their Implementation through Derivable Abstract Machines: Introduction
• A Strong Distillery
• A Machine-Independent, Log-Sensitive Space-Cost Measure for the Weak Lambda-Calculus