Strong normalization through intersection types and memory
type: Item
instance of: scholarly article
title: Strong normalization through intersection types and memory
zbMATH Open document ID: 1394.03023
author: Antonio Bucciarelli
author: Delia Kesner
author: Daniel Lima Ventura
publication date: 2018-04-23T00:00:00Z
Mathematics Subject Classification ID: 03B40
Mathematics Subject Classification ID: 03F05
zbMATH DE Number: 6862943
zbMATH Keywords: lambda-calculus
zbMATH Keywords: memory calculus
zbMATH Keywords: strong normalization
zbMATH Keywords: intersection types
MaRDI profile type: Publication
full work available at URL: j.entcs.2016.06.006
OpenAlex ID: W2464954612
Wikidata QID: Q113317683
cites work: The lambda calculus. Its syntax and semantics. Rev. ed.
cites work: A filter lambda model and the completeness of type assignment
cites work: Q3077958
cites work: Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types
cites work: Non-idempotent intersection types and strong normalisation
cites work: A semantics for lambda calculi with resources
cites work: Not Enough Points Is Enough
cites work: The Inhabitation Problem for Non-idempotent Intersection Types
cites work: An extension of basic functionality theory for \(\lambda\)-calculus
cites work: Functional Characters of Solvable Terms
cites work: Q4993853
cites work: Linearization of the lambda-calculus and its relation with intersection type systems
cites work: Q3994895
cites work: Quantitative Types for the Linear Substitution Calculus
cites work: A Resource Aware Computational Interpretation for Herbelin’s Syntax
cites work: Principality and type inference for intersection types using expansion variables
cites work: Q3918095
cites work: Q4274979
cites work: THEORETICAL PEARLS: A bargain for intersection types: a simple strong normalization proof
cites work: An equivalence between lambda- terms
cites work: Principal type scheme and unification for intersection type discipline
cites work: Intensional interpretations of functionals of finite type I
cites work: The emptiness problem for intersection types
cites work: An elementary proof of strong normalization for intersection types
cites work: Complete restrictions of the intersection type discipline
cites work: Strict intersection types for the lambda calculus
cites work: Q4737219
DOI: 10.1016/J.ENTCS.2016.06.006
description: scientific article; zbMATH DE number 6862943