Type theory - Revision history

𝗔𝗿𝗰𝗵𝗮𝗻𝗴𝗲𝗹: Text replacement - "\[\[Category(.) of (.)\]\]" to ""

2024-02-22T01:54:11Z

Text replacement - "\[\[Category(.*) of (.*)\]\]" to ""

← Older revision		Revision as of 16:54, 21 February 2024
Line 1:		Line 1:
	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:		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

Bacchus: Text replacement - "science" to "Science Category:Science"

2023-02-14T02:54:43Z

Text replacement - "science" to "Science Category:Science"

← Older revision		Revision as of 17:54, 13 February 2023
Line 1:		Line 1:
	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:		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

Bacchus: Text replacement - "theory" to "theory"

2023-02-10T05:11:32Z

Text replacement - "theory" to "theory"

← Older revision		Revision as of 20:11, 9 February 2023
Line 1:		Line 1:
	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:		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.		# 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]]

Bacchus: 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..."

2022-12-17T22:41:07Z

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..."

New page

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.

[[Category:Definitions]]

Type theory - Revision history

𝗔𝗿𝗰𝗵𝗮𝗻𝗴𝗲𝗹: Text replacement - "\[\[Category(.*) of (.*)\]\]" to ""

Bacchus: Text replacement - "science" to "Science Category:Science"

Bacchus: Text replacement - "theory" to "theory"

𝗔𝗿𝗰𝗵𝗮𝗻𝗴𝗲𝗹: Text replacement - "\[\[Category(.) of (.)\]\]" to ""