Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1993: Mathematical Foundations of Computer Science 1993 pp 423–432Cite as

Lambda substitution algebras

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 711))

Abstract

In the paper an algebraic metatheory of type-free λ-calculus is developed. Our version is based on lambda substitution algebras (λSAs), which are just SAs introduced by Feldman (for algebraizing equational logic) enriched with a countable family of unary operations of λ-abstraction and a binary operation of application. Two representation theorems, syntactical and semantic, are proved, what directly provides completeness theorems.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barendregt,H.P. The Lambda Calculus: its Syntax and Semantics. Studies in Logic, 103, N-Holland, 1982.

    Google Scholar 

  2. Cïrulis,J. An Algebraization of First-order Logic with Terms. In “Algebraic logic (Proc. Conf. in Budapest, 1988)”, ed. H.Andréka,J.D.Monk,I.Németi, N-Holland,1991, pp.125–146

    Google Scholar 

  3. Diskin,Z.B. Lambda Term Systems. Submitted to Z.Math.Logik und Grundl.Math.

    Google Scholar 

  4. Feldman,N. Axiomatization of Polynomial Substitution Algebras. J.Symbolic Logic,47,3(1982), 481–492.

    Google Scholar 

  5. Meyer,A.R. What is a Model of the Lambda Calculus? Information and Control,52,1(1982), 87–122.

    Google Scholar 

  6. Obtułowicz,A. and Wiweger,A., Categorical, Functional and Algebraic Aspects of the Type-free Lambda Calculus. in: “Universal algebra and Applications”, Banach Center Publications, 9(1982), 399–422.

    Google Scholar 

  7. Pigozzi,D. and Salibra,A. Polyadic Algebras over Nonclassical Logics. Manuscript.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Frame Inform Systems, Riga, Latvia

    Zinovy Diskin

  2. University of Latvia, Riga, Latvia

    Ilya Beylin

Authors
  1. Zinovy Diskin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ilya Beylin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej M. Borzyszkowski Stefan Sokołowski

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Diskin, Z., Beylin, I. (1993). Lambda substitution algebras. In: Borzyszkowski, A.M., Sokołowski, S. (eds) Mathematical Foundations of Computer Science 1993. MFCS 1993. Lecture Notes in Computer Science, vol 711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57182-5_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-57182-5_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57182-7

  • Online ISBN: 978-3-540-47927-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation