DeepAI AI Chat

On reduction and normalization in the computational core

04/20/2021

∙

by Claudia Faggian, et al.

∙

∙

We study the reduction in a lambda-calculus derived from Moggi's computational one, that we call the computational core. The reduction relation consists of rules obtained by orienting three monadic laws. Such laws, in particular associativity and identity, introduce intricacies in the operational analysis. We investigate the central notions of returning a value versus having a normal form, and address the question of normalizing strategies. Our analysis relies on factorization results.

Claudia Faggian
9 publications
Giulio Guerrieri
18 publications
Ugo de'Liguoro
10 publications
Riccardo Treglia
5 publications

page 1

page 2

page 3

page 4

∙ 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. ∙

∙ 01/20/2021

Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logic (long version)

In each variant of the lambda-calculus, factorization and normalization ...

0 Claudia Faggian, et al. ∙

∙ 04/16/2018

Probabilistic Rewriting: Relations between Normalization, Termination, and Unique Normal Forms

We investigate how techniques from Rewrite Theory can help us to study c...

0 Claudia Faggian, et al. ∙

∙ 03/14/2023

Normal Form Bisimulations By Value

Sangiorgi's normal form bisimilarity is call-by-name, identifies all the...

0 Beniamino Accattoli, et al. ∙

∙ 05/04/2020

Factorize Factorization

We present a new technique for proving factorization theorems for compou...

0 Beniamino Accattoli, et al. ∙

∙ 05/17/2018

Strict Ideal Completions of the Lambda Calculus

The infinitary lambda calculi pioneered by Kennaway et al. extend the ba...

0 Patrick Bahr, et al. ∙

∙ 10/20/2017

An impure solution to the problem of matching fans

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

0 Anton Salikhmetov, et al. ∙