DeepAI AI Chat

An impure solution to the problem of matching fans

10/20/2017

∙

by Anton Salikhmetov, et al.

∙

∙

We present an algorithm to solve the problem of matching fans in interaction net implementations of optimal reduction for the pure untyped lambda calculus without use of any additional agent types. The algorithm relies upon a specific interaction nets reduction strategy and involves side effects in one of interaction rules.

page 1

page 2

page 3

∙ 05/31/2021

Elegant elaboration with function invocation

We present an elegant design of the core language in a dependently-typed...

0 Tesla Zhang, et al. ∙

∙ 06/19/2018

Upward confluence in the interaction calculus

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

0 Anton Salikhmetov, et al. ∙

∙ 10/30/2020

The New Rewriting Engine of Dedukti

Dedukti is a type-checker for the λΠ-calculus modulo rewriting, an exten...

0 Gabriel Hondet, et al. ∙

∙ 08/20/2018

Lambda Calculus with Explicit Read-back

This paper introduces a new term rewriting system that is similar to the...

0 Anton Salikhmetov, et al. ∙

∙ 07/07/2020

Graph rewrites, from graphic lambda calculus, to chemlambda, to directed interaction combinators

Here I report about the modifications of and relations between graphic l...

0 Marius Buliga, et al. ∙

∙ 04/20/2021

On reduction and normalization in the computational core

We study the reduction in a lambda-calculus derived from Moggi's computa...

0 Claudia Faggian, et al. ∙

∙ 01/30/2013

Flexible and Approximate Computation through State-Space Reduction

In the real world, insufficient information, limited computation resourc...

0 Weixiong Zhang, et al. ∙

Code Repositories

lambda

Macro Lambda Calculus

view repo