ASMs and operational algorithmic completeness of lambda calculus

DOI10.1007/978-3-642-15025-8_16zbMATH Open1287.68045arXiv1010.2597OpenAlexW1734119196MaRDI QIDQ3586009FDOQ3586009

Authors: Serge Grigorieff, Marie C. Ferbus-Zanda 

Publication date: 3 September 2010

Published in: Fields of Logic and Computation (Search for Journal in Brave)

Abstract: We show that lambda calculus is a computation model which can step by step simulate any sequential deterministic algorithm for any computable function over integers or words or any datatype. More formally, given an algorithm above a family of computable functions (taken as primitive tools, i.e., kind of oracle functions for the algorithm), for every constant K big enough, each computation step of the algorithm can be simulated by exactly K successive reductions in a natural extension of lambda calculus with constants for functions in the above considered family. The proof is based on a fixed point technique in lambda calculus and on Gurevich sequential Thesis which allows to identify sequential deterministic algorithms with Abstract State Machines. This extends to algorithms for partial computable functions in such a way that finite computations ending with exceptions are associated to finite reductions leading to terms with a particular very simple feature.

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

Recommendations

• The transformation calculus
• scientific article; zbMATH DE number 7340317
• The weak lambda calculus as a reasonable machine
• scientific article; zbMATH DE number 783760
• An Introduction to the Lambda Calculus

zbMATH Keywords

lambda calculusASMoperational semanticstheory of algorithms

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cites Work

• Title not available (Why is that?)
• Abstract State Machines
• Evolving Algebras 1993: Lipari Guide
• Combinatory logic. With two sections by William Craig.
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The parametric lambda calculus. A metamodel for computation.
• Efficient self-interpretation in lambda calculus
• Sequential abstract-state machines capture sequential algorithms
• A Natural Axiomatization of Computability and Proof of Church's Thesis
• A call-by-name lambda-calculus machine
• One-tape, off-line Turing machine computations
• Title not available (Why is that?)
• Palindrome recognition using a multidimensional tape.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Processes, Terms and Cycles: Steps on the Road to Infinity

Cited In (1)

• Axiomatization and characterization of BSP algorithms

This page was built for publication: ASMs and operational algorithmic completeness of lambda calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586009)