Intersection type calculi of bounded dimension
From MaRDI portal
Publication:5370899
DOI10.1145/3009837.3009862zbMath1387.03012OpenAlexW2561623690MaRDI QIDQ5370899
Jakob Rehof, Andrej Dudenhefner
Publication date: 20 October 2017
Published in: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3009837.3009862
Related Items
Tight typings and split bounds, fully developed, The untyped computational \(\lambda \)-calculus and its intersection type discipline, A coinductive approach to proof search through typed lambda-calculi, Unnamed Item, Unnamed Item, Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search, Pre-grammars and inhabitation for a subset of rank 2 intersection types
