Type theory: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "theory" to "theory") |
m (Text replacement - "science" to "Science Category:Science") |
||
| 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 [[Category:Science]]. We limit ourselves here to sketch some aspects that are important in logic. For the importance of types in computer Science [[Category:Science]], for instance: | ||
# Reynolds 1983 and 1985. | # Reynolds 1983 and 1985. | ||
# Paradoxes and Russell's Type Theories | # Paradoxes and Russell's Type Theories | ||
Revision as of 18:54, 13 February 2023
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 is more expressive in a practical sense. It is used, with some modifications and enhancements, in most modern applications of type theory.