A simple proof of the genericity lemma

  • Masako Takahashi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 792)


A short direct proof is given for the fundamental property of unsolvable λ-terms; if M is an unsolvable λ-term and C[M] is solvable, then C[N] is solvable for any λ-term N. (Here C[ ] stands for an arbitrary context.)


  1. [1]
    H. P. Barendregt, The Lambda Calculus (North-Holland 1984).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Masako Takahashi
    • 1
  1. 1.Department of Information ScienceTokyo Institute of TechnologyTokyoJapan

Personalised recommendations