Strong Normalization through Intersection Types and Memory | Zendy

Antonio Bucciarelli | Zendy; Delia Kesner | Zendy; Daniel Ventura | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Strong Normalization through Intersection Types and Memory

Author(s) -

Antonio Bucciarelli,

Delia Kesner,

Daniel Ventura

Publication year - 2016

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2016.06.006

Subject(s) - normalization (sociology) , idempotence , intersection (aeronautics) , mathematics , discrete mathematics , pure mathematics , combinatorics , sociology , anthropology , engineering , aerospace engineering

We characterize β-strongly normalizing λ-terms by means of a non-idempotent intersection type system. More precisely, we first define a memory calculus K together with a non-idempotent intersection type system K, and we show that a K-term t is typable in K if and only if t is K-strongly normalizing. We then show that β-strong normalization is equivalent to K-strong normalization. We conclude since λ-terms are strictly included in K-terms

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research