Branching Types

Authors:
Joe B. Wells;Christian Haack
Affiliations:
-;-
Venue:
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
Year:
2002

Citing 15
Cited 11

A direct algorithm for type inference in the rank-2 fragment of the second-order &lgr;-calculus

LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
Design of the programming language FORSYTHE

ALGOL-like Languages, Volume 1
Strongly typed flow-directed representation transformations (extended abstract)

ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Principality and decidable type inference for finite-rank intersection types

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Relating typability and expressiveness in finite-rank intersection type systems (extended abstract)

Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Functioning without closure: type-safe customized function representations for standard ML

Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Faithful Translations between Polyvariant Flows and Polymorphic Types

ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
A Typed Intermediate Language for Flow-Directed Compilation

TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Program Representation Size in an Intermediate Language with Intersection and Union Types

TIC '00 Selected papers from the Third International Workshop on Types in Compilation
Towards a theory of type structure

Programming Symposium, Proceedings Colloque sur la Programmation
Intersection Logic

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Typability is Undecidable for F+Eta

Typability is Undecidable for F+Eta
Type reconstruction in F ω

Mathematical Structures in Computer Science
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

Tridirectional typechecking

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type inference with expansion variables and intersection types in system E and an exact correspondence with β-reduction

PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Intersection-types à la Church

Information and Computation
Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: Extending the Coppo-Dezani heritage

Theoretical Computer Science
A typed lambda calculus with intersection types

Theoretical Computer Science
Inhabitation of Low-Rank Intersection Types

TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
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
Expansion for universal quantifiers

ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Although systems with intersection types have many unique capabilities, there has never been a fully satisfactory explicitly typed system with intersection types. We introduce 驴B with branching types and types which are quantified over type selectors to provide an explicitly typed system with the same expressiveness as a system with intersection types. Typing derivations in 驴B effectively squash together what would be separate parallel derivations in earlier systems with intersection types.