Skip to main content

Near Semi-rings and Lambda Calculus

  • Conference paper
Rewriting and Typed Lambda Calculi (RTA 2014, TLCA 2014)

Abstract

A connection between lambda calculus and the algebra of near semi-rings is discussed. Among the results is the following completeness theorem.

A first-order equation in the language of binary associative distributive algebras is true in all such algebras if and only if the interpretations of the first order terms as lambda terms beta-eta convert to one another. A similar result holds for equations containing free variables.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barendregt, H.P.: The Lambda Calculus. North Holland (1984)

    Google Scholar 

  2. Birget, J.C.: Monoid generalizations of the Richard Thompson groups. Journal of Pure and Applied Algebra 213, 264–278 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  3. Church, A.: The Calculi of Lambda Conversion. PUP (1941)

    Google Scholar 

  4. Coppo, M., Dezani, M.: A new type assignment for lambda terms. Archiv fur Math. Logik 19 (1978)

    Google Scholar 

  5. Curry, H.B.: Combinatory Logic, vol. 1. North Holland (1958)

    Google Scholar 

  6. Freyd, P., Heller, A.: Splitting homotopy idempotents II. Journal of Pure and Applied Algebra 89, 93–195 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  7. Hoogewijs, J.: Semi-nearring embeddings. Med. Konink. Vlaamse Acad. Wetensch. Lett. Schone Kunst. Belgie Kl. Wetensch 32(2), 3–11 (1970)

    MathSciNet  Google Scholar 

  8. Pottinger, G.: A type assignment for strongly normalizable lambda terms. Curry Festschrift (1980)

    Google Scholar 

  9. Statman, R.: Freyd’s hierarchy of combinator monoids. In: LICS (1991)

    Google Scholar 

  10. Thompson, R.: Embeddings into finitely generated groups which preserve the word problem. In: Adian, Boone, Higman (eds.) The Word Problem. Studies in Logic and the Foundation of Mathematics, vol. 95, pp. 401–441. North Holland (1980)

    Google Scholar 

  11. Van Hoorn, W., Van Rootselaar, B.: Fundamental notions in the theory of semi-near rings. Comp. Math. 18, 65–78 (1967)

    MATH  Google Scholar 

  12. Artin, M.: Algebra. Prentice Hall (2011)

    Google Scholar 

  13. Internet, http://www.algebra.uni-linz.ac.at/Nearrings

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Statman, R. (2014). Near Semi-rings and Lambda Calculus. In: Dowek, G. (eds) Rewriting and Typed Lambda Calculi. RTA TLCA 2014 2014. Lecture Notes in Computer Science, vol 8560. Springer, Cham. https://doi.org/10.1007/978-3-319-08918-8_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08918-8_28

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08917-1

  • Online ISBN: 978-3-319-08918-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics