DeepAI AI Chat
Log In Sign Up

Lambda Calculus with Explicit Read-back

by   Anton Salikhmetov, et al.

This paper introduces a new term rewriting system that is similar to the embedded read-back mechanism for interaction nets presented in our previous work, but is easier to follow than in the original setting and thus to analyze its properties. Namely, we verify that it correctly represents the lambda calculus. Further, we show that there is exactly one reduction sequence that starts with any term in our term rewriting system. Finally, we represent the leftmost strategy which is known to be normalizing.


page 1

page 2

page 3

page 4


Upward confluence in the interaction calculus

The lambda calculus is not upward confluent, one of counterexamples bein...

Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic

This paper introduces the exponential substitution calculus (ESC), a new...

A strong call-by-need calculus

We present a call-by-need λ-calculus that enables strong reduction (that...

An impure solution to the problem of matching fans

We present an algorithm to solve the problem of matching fans in interac...

On First-order Cons-free Term Rewriting and PTIME

In this paper, we prove that (first-order) cons-free term rewriting with...

On the Taylor expansion of λ-terms and the groupoid structure of their rigid approximants

We show that the normal form of the Taylor expansion of a λ-term is isom...