Type Checking and Inference Are Equivalent in Lambda Calculi with Existential Types

Abstract

This paper shows that type-checking and type-inference problems are equivalent in domain-free lambda calculi with existential types, that is, type-checking problem is Turing reducible to typeinference problem and vice versa. In this paper, the equivalence is proved for two variants of domain-free lambda calculi with existential types: one is an implication… (More)
DOI: 10.1007/978-3-642-11999-6_7

Topics

1 Figure or Table

Cite this paper

@inproceedings{Kato2009TypeCA, title={Type Checking and Inference Are Equivalent in Lambda Calculi with Existential Types}, author={Yuki Kato and Koji Nakazawa}, booktitle={WFLP}, year={2009} }