Skip to content
Duplicating redexes as the central problem of optimal reduction episode artwork

Jun 21, 2020 16 min

Duplicating redexes as the central problem of optimal reduction

from Iowa Type Theory Commute Hosted by Aaron Stump

We discussed last time how with a graph-sharing implementation of untyped lambda calculus, it can happen that you are forced to break sharing and copy a lambda abstraction. We discuss in this episode the central issue with doing that, namely copying redexes and copying applications which could turn into redexes following other beta reductions. The high-level idea of the proposed solution is also discussed, namely lazy graph duplication.

Episode details come from the podcast's RSS feed.

Embed this episode

Ready to play

Duplicating redexes as the central problem of optimal reduction

0:00 16:06

No transcript yet.

Requests help us decide what to transcribe next.

Frequently asked questions

How long is this episode of Iowa Type Theory Commute?

This episode is 16 minutes long.

When was this Iowa Type Theory Commute episode published?

This episode was published on June 21, 2020.

Can I download this Iowa Type Theory Commute episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.