Type theory: Difference between revisions
Jump to navigation
Jump to search
(Created page with "The topic of ''type theory'' is fundamental both in logic and computer science. We limit ourselves here to sketch some aspects that are important in logic. For the importance of types in computer science, for instance: # Reynolds 1983 and 1985. # Paradoxes and Russell's Type Theories # Simple Type Theory and the λ -Calculus. Church's type theory, aka simple type theory, is a formal logical language which includes classical first-order and propositional logic, but...") |
m (Text replacement - "\[\[Category(.*) of (.*)\]\]" to "") |
||
| (2 intermediate revisions by one other user not shown) | |||
| Line 1: | Line 1: | ||
The topic of ''type theory'' is fundamental both in [[logic]] and computer | The topic of ''type [[theory]]'' is fundamental both in [[logic]] and computer Science , for instance: | ||
# Reynolds 1983 and 1985. | # Reynolds 1983 and 1985. | ||
# Paradoxes and Russell's Type Theories | # Paradoxes and Russell's Type Theories | ||
# Simple Type Theory and the λ -Calculus. | # Simple Type Theory and the λ -Calculus. | ||
Church's type theory, aka simple type theory, is a formal logical language which includes classical first-order and propositional logic, but is more expressive in a practical sense. It is used, with some modifications and enhancements, in most modern applications of type theory. | Church's type [[theory]], aka simple type [[theory]], is a formal logical language which includes classical first-order and propositional logic, but is more expressive in a practical sense. It is used, with some modifications and enhancements, in most modern applications of type [[theory]]. | ||
[[Category:Definitions]] | [[Category:Definitions]] | ||
Latest revision as of 17:54, 21 February 2024
The topic of type theory is fundamental both in logic and computer Science , for instance:
- Reynolds 1983 and 1985.
- Paradoxes and Russell's Type Theories
- Simple Type Theory and the λ -Calculus.
Church's type theory, aka simple type theory, is a formal logical language which includes classical first-order and propositional logic, but is more expressive in a practical sense. It is used, with some modifications and enhancements, in most modern applications of type theory.