Type assignment for intersections and unions in call-by-value languages

Authors:
Joshua Dunfield;Frank Pfenning
Affiliations:
Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA;Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA
Venue:
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Year:
2003

Citing 11
Cited 11

Refinement types for ML

PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Soft typing

PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Soft typing with conditional types

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Intersection and union types: syntax and semantics

Information and Computation
Dependent types in practical programming

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Intersection types and computational effects

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
The Definition of Standard ML

The Definition of Standard ML
Dependent types in practical programming

Dependent types in practical programming
A calculus with polymorphic and polyvariant flow types

Journal of Functional Programming
From Polyvariant flow information to intersection and union types

Journal of Functional Programming
Practical refinement-type checking

Practical refinement-type checking

Tridirectional typechecking

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A compositional logic for polymorphic higher-order functions

PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Dependent ML An approach to practical programming with dependent types

Journal of Functional Programming
Refined typechecking with Stardust

PLPV '07 Proceedings of the 2007 workshop on Programming languages meets program verification
The swiss coercion

PLPV '07 Proceedings of the 2007 workshop on Programming languages meets program verification
Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: Extending the Coppo-Dezani heritage

Theoretical Computer Science
Greedy bidirectional polymorphism

Proceedings of the 2009 ACM SIGPLAN workshop on ML
Intersection and Union Types in the λμμ~-calculus

Electronic Notes in Theoretical Computer Science (ENTCS)
Elaborating intersection and union types

Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Substructural typestates

Proceedings of the ACM SIGPLAN 2014 Workshop on Programming Languages meets Program Verification
Completeness and Soundness Results for X with Intersection and Union Types

Fundamenta Informaticae - Intersection Types and Related Systems ITRS

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop a system of type assignment with intersection types, union types, indexed types, and universal and existential dependent types that is sound in a call-by-value functional language. The combination of logical and computational principles underlying our formulation naturally leads to the central idea of type-checking subterms in evaluation order. We thereby provide a uniform generalization and explanation of several earlier isolated systems. The proof of progress and type preservation, usually formulated for closed terms only, relies on a notion of definite substitution.