The Maximal MAM, a Reasonable Implementation of the Maximal Strategy

11/28/2017
by   Beniamino Accattoli, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/26/2021

RLWE/PLWE equivalence for the maximal totally real subextension of the 2^rpq-th cyclotomic field

We prove the RLWE/PLWE equivalence for the maximal totally real subexten...
research
03/25/2022

Move Complexity of a Self-Stabilizing Algorithm for Maximal Independent Sets

A_𝖽𝖾𝗀 is a self-stabilizing algorithm that computes a maximal independen...
research
07/06/2018

Tight Typings and Split Bounds

Multi types---aka non-idempotent intersection types---have been used to ...
research
06/27/2019

Deception, Delay, and Detection of Strategies

Homology generators in a relation offer individuals the ability to delay...
research
04/05/2021

On a simplified version of Hadamard's maximal determinant problem

Hadamard's maximal determinant problem consists in finding the maximal v...
research
10/12/2021

Algebra of Data Reconciliation

With distributed computing and mobile applications becoming ever more pr...
research
06/30/2019

On the Sample Complexity of HGR Maximal Correlation Functions

The Hirschfeld-Gebelein-Rényi (HGR) maximal correlation and the correspo...

Please sign up or login with your details

Forgot password? Click here to reset