Skip to main navigation Skip to search Skip to main content

The useful MAM, a reasonable implementation of the strong λ-calculus

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

It has been a long-standing open problem whether the strong λ-calculus is a reasonable computational model, i.e. whether it can be implemented within a polynomial overhead with respect to the number of β-steps on models like Turing machines or RAM. Recently, Accattoli and Dal Lago solved the problem by means of a new form of sharing, called useful sharing, and realised via a calculus with explicit substitutions. This paper presents a new abstract machine for the strong λ-calculus based on useful sharing, the Useful Milner Abstract Machine, and proves that it reasonably implements leftmost-outermost evaluation. It provides both an alternative proof that the λ-calculus is reasonable and an improvement on the technology for implementing strong evaluation.

Original languageEnglish
Title of host publicationLogic, Language, Information, and Computation - 23rd International Workshop, WoLLIC 2016, Proceedings
EditorsJouko Väänänen, Åsa Hirvonen, Ruy de Queiroz
PublisherSpringer Verlag
Pages1-21
Number of pages21
ISBN (Print)9783662529201
DOIs
Publication statusPublished - 1 Jan 2016
Event23rd International Workshop on Logic, Language, Information, and Computation, WoLLIC 2016 - Puebla, Mexico
Duration: 16 Aug 201619 Aug 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9803 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference23rd International Workshop on Logic, Language, Information, and Computation, WoLLIC 2016
Country/TerritoryMexico
CityPuebla
Period16/08/1619/08/16

Fingerprint

Dive into the research topics of 'The useful MAM, a reasonable implementation of the strong λ-calculus'. Together they form a unique fingerprint.

Cite this