Skip to main content
Article thumbnail
Location of Repository

Undecidability of type-checking in domain-free typed lambda-calculi with existence

By Koji Nakazawa, Makoto Tatsuta, Yukiyoshi Kameyama and Hiroshi Nakano

Abstract

Abstract. This paper shows undecidability of type-checking and typeinference problems in domain-free typed lambda-calculi with existential types: a negation and conjunction fragment, and an implicational fragment. These are proved by reducing type-checking and type-inference problems of the domain-free polymorphic typed lambda-calculus to those of the lambda-calculi with existential types by continuation passing style translations

Topics: existential type, CPS-translation, domainfree type
Year: 2008
OAI identifier: oai:CiteSeerX.psu:10.1.1.353.1309
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.sato.kuis.kyoto-u.a... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.