The system F of variable types, fifteen years later
Theoretical Computer Science
Lambda-calculus, types and models
Lambda-calculus, types and models
Type inference: some results, some problems
Fundamenta Informaticae - Special issue: lambda calculus and type theory
Design of the programming language FORSYTHE
ALGOL-like Languages, Volume 1
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
A calculus with polymorphic and polyvariant flow types
Journal of Functional Programming
Calculi, types and applications
Theoretical Computer Science
A typed lambda calculus with intersection types
Theoretical Computer Science
On Isomorphisms of Intersection Types
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Refinement Types as Proof Irrelevance
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Inhabitation of Low-Rank Intersection Types
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
On isomorphisms of intersection types
ACM Transactions on Computational Logic (TOCL)
Logic and computation in a lambda calculus with intersection and union types
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Polymorphic functions with set-theoretic types: part 1: syntax, semantics, and evaluation
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Intersection Types from a Proof-theoretic Perspective
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
Towards a Logic for Union Types
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
| Hi-index | 0.00 |
In this paper, we present , a fully typed λ-calculus based on the intersection-type system discipline, which is a counterpart à la Church of the type assignment system as invented by Coppo and Dezani. The relationship between and the intersection type assignment system is the standard isomorphism between typed and type assignment system, and so the typed language inherits from the untyped system all the good properties, like subject reduction and strong normalization. Moreover, both type checking and type reconstruction are decidable.