Recursion does not always help

06/16/2022
by   Gordon Plotkin, et al.
0

We show that, under mild assumptions, adding recursion does not increase the total functions definable in the typed λβη-calculus or (under no assumptions) the, possibly partial, functions definable in the λΩ-calculus. As a consequence, adding recursion does not increase the class of partial or total definable functions on free algebras and so, in particular, on the natural numbers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/29/2021

A Symmetric Lambda-Calculus Corresponding to the Negation-Free Bilateral Natural Deduction

Filinski constructed a symmetric lambda-calculus consisting of expressio...
research
10/29/2020

Linearizing Combinators

In 2017, Bauer, Johnson, Osborne, Riehl, and Tebbe (BJORT) showed that t...
research
02/08/2021

Distributive Laws, Spans and the ZX-Calculus

We modularly build increasingly larger fragments of the ZX-calculus by m...
research
04/11/2020

The ZX calculus: A complete graphical calculus for classical circuits using spiders

We give a complete presentation for the fragment, ZX , of the ZX-calcu...
research
01/12/2018

Mailbox Types for Unordered Interactions

We propose a type system for reasoning on protocol conformance and deadl...
research
09/22/2017

On the Recognizing Power of the Lambek Calculus with Brackets

Every language recognized by the Lambek calculus with brackets is contex...
research
12/09/2022

Extended Addressing Machines for PCF, with Explicit Substitutions

Addressing machines have been introduced as a formalism to construct mod...

Please sign up or login with your details

Forgot password? Click here to reset