Combinatorial problems, combinator equations and normal forms

  • Corrado Böhm
  • Mariangiola Dezani-Ciancaglini
Tuesday Morning
Part of the Lecture Notes in Computer Science book series (LNCS, volume 14)

Abstract

Some cases of solvability of the convertibility equation MX=N, where M,N and X are normal forms of the λ-K-β-calculus are considered and their relationship to pattern-matching problems is discussed. In particular, the solvability of such an equation is decided in the cases:
  1. i)

    N ≡ I and M = BF

     
  2. ii)

    N ≡ I and M = CBF where F is a normal form

     
  3. iii)

    N is an arbitrary normal form.

     

For this purpose, a polynomial representation and subsequently a tree representation of normal forms are introduced.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Böhm, C., W. Gross, Introduction to the CUCH, Automata Theory, ed. E.R. Caianiello, Academic Press, New York, (1966), 35–65.Google Scholar
  2. [2]
    Böhm, C., The CUCH as a Formal and Description Language, Formal Language Description Languages for Computer Programming, ed. T.B. Steel, North-Holland, Amsterdam, (1966), 179–197.Google Scholar
  3. [3]
    Böhm, C., Alcune proprietà delle forme β-η-normali nel λ-K-calcolo, IAC, 696, (1968).Google Scholar
  4. [4]
    Böhm, C., M. Dezani, A CUCH-machine: the Automatic Treatment of Bound Variables, Int. Journal of Computer and Information Sciences, 1, 2, (1972), 171–191.CrossRefGoogle Scholar
  5. [5]
    Caracciolo di Forino, A., Generalized Markov Algorithms and Automata Theory, Automata Theory, Academic Press, New York, (1966), 115–130.Google Scholar
  6. [6]
    Church, A., The Calculi of Lambda-Conversion, Ann. of Math. Studies, 6, Princenton, (1941).Google Scholar
  7. [7]
    Curry, H.B., R. Feys, Combinatory Logic, 1, North-Holland, Amsterdam, (1968).Google Scholar
  8. [8]
    Curry, H.B., J.R. Hindley, J.P. Seldin, Combinatory Logic, 2, North-Holland, Amsterdam, (1972).Google Scholar
  9. [9]
    Grätzer, G., Universal Algebra, Van Nostrand, Princeton, (1968).Google Scholar
  10. [10]
    Stenlund, S., Combinators λ-terms and Proof Theory, Reidel, Dordrecht, (1972).Google Scholar

Copyright information

© Springer-Verlag 1974

Authors and Affiliations

  • Corrado Böhm
    • 1
  • Mariangiola Dezani-Ciancaglini
    • 1
  1. 1.Istituto di Scienza dell'Informazione dell'Università di TorinoTorino

Personalised recommendations