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

DOI10.1007/978-3-642-11999-6_7zbMath1274.03027OpenAlexW1488396215MaRDI QIDQ3557097

Koji Nakazawa, Yuki Kato

Publication date: 27 April 2010

Published in: Functional and Constraint Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11999-6_7

zbMATH Keywords

undecidabilitytype inferencetype checkingexistential typedomain-free type system

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

This page was built for publication: Type Checking and Inference Are Equivalent in Lambda Calculi with Existential Types