Sciweavers

WFLP
2009
Springer

244views Algorithms» more WFLP 2009»

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

13 years 11 months ago

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 reduci...

Yuki Kato, Koji Nakazawa

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers