The Inhabitation Problem for Non-idempotent Intersection Types

DOI10.1007/978-3-662-44602-7_26zbMath1417.68027OpenAlexW161800829MaRDI QIDQ3190172

Antonio Bucciarelli, Delia Kesner, Simonetta Ronchi della Rocca

Publication date: 15 September 2014

Published in: Advanced Information Systems Engineering (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01402082/file/978-3-662-44602-7_26_Chapter.pdf

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Related Items (15)

A semantic account of strong normalization in linear logic ⋮ A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization ⋮ Unnamed Item ⋮ A resource aware semantics for a focused intuitionistic calculus ⋮ Unnamed Item ⋮ Tight typings and split bounds, fully developed ⋮ A coinductive approach to proof search through typed lambda-calculi ⋮ Strong normalization through intersection types and memory ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Reasoning About Call-by-need by Means of Types ⋮ Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search ⋮ Unnamed Item ⋮ Pre-grammars and inhabitation for a subset of rank 2 intersection types ⋮ Essential and relational models

This page was built for publication: The Inhabitation Problem for Non-idempotent Intersection Types