Site Navigation
Categories:
categories
Lambda calculus
Logic in computer science
Theory of computation
Type theory
Wikipedia articles that are too technical
Computer science articles needing expert attention
Articles needing expert attention from August 2009
All articles needing expert attention

Summary Of: Typed lambda calculus

the simply typed lambda calculus is the language of... System T extends the simply typed lambda calculus with a type of natural numbers and higher order primitive recursion... Typed lambda calculi with subtyping are the simply typed lambda calculus with conjunctive types and System F... For example the dependently typed lambda calculus with a type of all types...

Encyclodia Page On: Typed lambda calculus

These Are Links To Other Documents
template | Technical (expert) | templates for discussion | accessible to the widest possible audience. | WikiProject Computer science | Computer science Portal | lambda calculus | formalism | untyped lambda calculus | programming languages | functional programming languages | ML | Haskell | imperative programming languages | type systems | mathematical logic | proof theory | Curry-Howard isomorphism | internal language | categories | Cartesian closed categories | simply typed lambda calculus | Peano arithmetic | System F | second-order logic | dependent types | intuitionistic type theory | calculus of constructions | logical framework | pure type systems | Barendregt | Lambda cube | subtyping | System F-sub | Girard's paradox | Lambda cube | Plotkin's | PCF | programming | strongly typed programming languages | Eiffel | Categories | Lambda calculus | Logic in computer science | Theory of computation | Type theory | Wikipedia articles that are too technical | Computer science articles needing expert attention | Articles needing expert attention from August 2009 | All articles needing expert attention |
This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Typed lambda calculus".