Abstract
The aim of the paper is to study simple and compound propositions in English and Punjabi, and also discuss the suitability and applicability of typed lambda calculus λ. We select randomly ten simple and ten compound propositions and evaluate them by applying function application particularly value description and β-reduction according to Coppock and Champollion (Invitation to Formal Semantics, 2021, http://eecoppock.info/teaching.html). We point out that a single ‘BE’ predicate dominates all simple propositions, while compound propositions contain different predicates. The final results record as ≤ 1 and 0.3, 0.1 in simple and compound propositions, respectively.
Similar content being viewed by others
Notes
The place of lambda terms and conversion rules take significant place in lambda calculus. The following way we understand lambda terms.
(a) Variables = v0, v1,…….
(b) Abstractor = λ.
(c) Parenthesis = (,) [1].
The following types show the conversion rules as:
M → N in favour of α = conversion happens from left to right.
M ← N in favour of α = conversion happens from right to left.
M ↔ N in favour of α = conversion happens in both sides.
Punjabi is a modern Indo-Aryan language. It is only selected for translation purpose from English. Remember that final analysis would go along with English while describing the simple and compound propositions.
Consider ℼ and α are expressions where one is the function and another is input type, and they appear before us as ℼ (α) which means that ℼ as function applies on to α.
References
Barendregt, P.H. (1984). The lambda calculus: its syntax and semantics. Studies in Logic and The Foundation of Mathematics, Vol. 103. Amsterdam: Elsevier.
Coppock, E. (2016). Semantics boot camp. accessed 5th October URL: http://eecoppock.info/semantics-boot-camp.pdf. Unpublished ms.
Coppock, E., & Champollion, L. (2021). Invitation to Formal Semantics. accessed 9th October URL: http://eecoppock.info/teaching.html.
Di Pierro, A., Malacaria, P., & Nagarajan, R. (Eds.). (2020). From lambda calculus to cybersecurity through program analysis: essays dedicated to Chris Hankin on the occasion of his retirement. Lecture Notes in Computer Science 12065. Cham: Springer International Publishing Company. https://doi.org/10.1007/978-3-030-41103-9.
Dowek, G. (Ed.).(2014). Rewriting and typed lambda calculi: joint international conferences, RTA and TLCA 2014, held as part of the Vienna summer of logic, VSL 2014, Vienna, Austria, July 14–17, 2014, Proceedings (Vol. 8560). Lecture notes in computer science 8560. Switzerland: Springer International Publishing Company. https://doi.org/10.1007/978-3-319-08918-8.
Duží, M., & Fait, M. (2021). A Hyperintensional Theory of Intelligent Question Answering in TIL. In: Loukanova, R. (Ed.) Natural language processing in artificial intelligence—NLPinAI 2020, 939, 69, studies in computational intelligence 939. Switzerland: Springer International Publishing Company. https://doi.org/10.1007/978-3-030-63787-3.
Fischer, B., & Uustalu, T. (Eds.). (2018). Theoretical aspects of computing—(ICTAC 2018). Lecture notes in computer science, 11187. Cham: Springer International Publishing Company. https://doi.org/10.1007/978-3-030-02508-3.
Ghidini, C., (Eds.). (2019). The Semantic Web—ISWC 2019. Lecture notes in computer science 11778. Cham: Springer International Publishing Company. https://doi.org/10.1007/978-3-030-30793-6.
Ker, A.D. (2018). Lambda Calculus and Types. URL: https://www.cs.ox.ac.uk/teaching/materials17-18/lambda/notes.pdf. Last visited on 26(7).
Loczewski, P.G. (2018). A++ and the Lambda Calculus. Federal Republic of Germany: tradition Gmbh, Hamburg.
Pereyra, N.A. (2018). Logic for Physicists. USA: Morgan & Claypool Publishers.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
This study is not conducted under any funding agency so far. I declared that there is no “conflict of interest” regarding any grants or funding agency.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This article is part of the topical collection “Advances in Machine Vision and Augmented Intelligence” guest edited by Manish Kumar Bajpai, Ranjeet Kumar, Koushlendra Kumar Singh, and George Giakos.
Appendix-I
Rights and permissions
About this article
Cite this article
Singh, H. Propositions with Typed Lambda Calculus λ. SN COMPUT. SCI. 3, 204 (2022). https://doi.org/10.1007/s42979-022-01056-6
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s42979-022-01056-6