Abstract
This chapter draws examples from Wadler’s paper [1] to demonstrate the correspondence between natural deduction for intuitionistic logic and simply-typed \(\lambda \)-calculus—both concepts are built upon previously discussed topics. We also give examples in a programming language to help the reader relate logic to program code.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Let \(R = \{x \mid x \not \in x\}\), then \(R\in R\) if \(R \not \in R\).
Reference
Wadler P (2015) Propositions as types. Commun ACM 58, 75–84. ISSN: 0001-0782
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Hou, Z. (2021). Logic Is Computation. In: Fundamentals of Logic and Computation. Texts in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-030-87882-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-87882-5_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-87881-8
Online ISBN: 978-3-030-87882-5
eBook Packages: Computer ScienceComputer Science (R0)