Head recurrent terms in combinatory logic : A generalization of the notion of head normal form

  • Marisa Venturini Zilli
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 62)


The set of head recurrent terms of Weak Combinatory Logic is defined as a set including that of terms in head normal form. More over, a subset of the set of head recurrent terms is that of recurrent ones, i.e. the set of terms T such that every reductum of T reduces to T. A normal reduction strategy which reveals head recurrence and recurrence is described.


Reduction Strategy Lambda Calculus Recurrent Term Head Recurrence Head Normal Form 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    H.B. Curry, R. Feys, Combinatory Logic, vol.I, North-Holland, Amsterdam 1958.Google Scholar
  2. [2]
    H.B. Curry, J.R. Hindley, J.P. Seldin, Combinatory Logic, vol. II, North-Holland, Amsterdam 1972.Google Scholar
  3. [3]
    H. Barendregt, J. Bergstra, J.W.Klop, H.Volken, Degrees, Reductions and Representability in the Lambda Calculus, Preprint n.22, Utrecht University, February 1976.Google Scholar
  4. [4]
    C. Böhm, Alcune proprietà delle forme β-η-normali del λ-κ-calcolo, IAC-CNR, Pubblicazione n.696, Roma 1968.Google Scholar
  5. [5]
    C. Böhm, S.Micali, Minimal forms in λ-calculus computations, First Draft, March 1978.Google Scholar
  6. [6]
    C.P. Wadsworth, The relation between Computational and Denotational Properties for Scott's D -models of the Lambda-Calculus, SIAM J. Comput. 5,3 (1976), 488–521.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1978

Authors and Affiliations

  • Marisa Venturini Zilli
    • 1
  1. 1.Istituto per le applicazioni del calcolo del Consiglio Nazionale delle RicercheRomaItaly

Personalised recommendations