Intersection type calculi of bounded dimension

DOI10.1145/3009837.3009862MaRDI QIDQ5370899zbMATH OpenOpenAlexFDO

Authors Andrej Dudenhefner, Jakob Rehof

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

zbMATH Keywords

complexitylambda-calculustype systeminhabitationintersection typesnon-idempotence

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Recommendations

• Typability in bounded dimension
• Inhabitation for non-idempotent intersection types
• Inhabitation of Low-Rank Intersection Types
• The Inhabitation Problem for Non-idempotent Intersection Types
• The Inhabitation Problem for Rank Two Intersection Types

Cited in

(14)

• Inhabitation for non-idempotent intersection types
• Pre-grammars and inhabitation for a subset of rank 2 intersection types
• Tight typings and split bounds, fully developed
• MULTIDIMENSIONAL EXACT CLASSES, SMOOTH APPROXIMATION AND BOUNDED 4-TYPES
• scientific article; zbMATH DE number 7204434 (Why is no real title available?)
• YACC: Yet Another Church Calculus. A birthday present for Herman inspired by his supervisor activity
• Bounded combinatory logic
• scientific article; zbMATH DE number 5558176 (Why is no real title available?)
• Pregrammars and intersection types
• The untyped computational \(\lambda \)-calculus and its intersection type discipline
• Approximation theorems for intersection type systems
• Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search
• A coinductive approach to proof search through typed lambda-calculi
• Typability in bounded dimension

This page was built for publication: Intersection type calculi of bounded dimension

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5370899)