Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Typed_lambda_calculus> ?p ?o. }
Showing items 1 to 21 of
21
with 100 items per page.
- Typed_lambda_calculus abstract "A typed lambda calculus is a typed formalism that uses the lambda-symbol to denote anonymous function abstraction. In this context, types are usually objects of a syntactic nature that are assigned to lambda terms; the exact nature of a type depends on the calculus considered (see kinds below). From a certain point of view, typed lambda calculi can be seen as refinements of the untyped lambda calculus but from another point of view, they can also be considered the more fundamental theory and untyped lambda calculus a special case with only one type.Typed lambda calculi are foundational programming languages and are the base of typed functional programming languages such as ML and Haskell and, more indirectly, typed imperative programming languages. Typed lambda calculi play an important role in the design of type systems for programming languages; here typability usually captures desirable properties of the program, e.g. the program will not cause a memory access violation.Typed lambda calculi are closely related to mathematical logic and proof theory via the Curry–Howard isomorphism and they can be considered as the internal language of classes of categories, e.g. the simply typed lambda calculus is the language of Cartesian closed categories (CCCs).".
- Typed_lambda_calculus wikiPageExternalLink HBK.ps.
- Typed_lambda_calculus wikiPageID "366208".
- Typed_lambda_calculus wikiPageRevisionID "606018684".
- Typed_lambda_calculus hasPhotoCollection Typed_lambda_calculus.
- Typed_lambda_calculus subject Category:Lambda_calculus.
- Typed_lambda_calculus subject Category:Logic_in_computer_science.
- Typed_lambda_calculus subject Category:Theory_of_computation.
- Typed_lambda_calculus subject Category:Type_theory.
- Typed_lambda_calculus comment "A typed lambda calculus is a typed formalism that uses the lambda-symbol to denote anonymous function abstraction. In this context, types are usually objects of a syntactic nature that are assigned to lambda terms; the exact nature of a type depends on the calculus considered (see kinds below).".
- Typed_lambda_calculus label "Typed lambda calculus".
- Typed_lambda_calculus label "Типизированное лямбда-исчисление".
- Typed_lambda_calculus label "型付きラムダ計算".
- Typed_lambda_calculus label "有类型λ演算".
- Typed_lambda_calculus sameAs Λ-λογισμός_με_τύπους.
- Typed_lambda_calculus sameAs 型付きラムダ計算.
- Typed_lambda_calculus sameAs m.01__hs.
- Typed_lambda_calculus sameAs Q2607208.
- Typed_lambda_calculus sameAs Q2607208.
- Typed_lambda_calculus wasDerivedFrom Typed_lambda_calculus?oldid=606018684.
- Typed_lambda_calculus isPrimaryTopicOf Typed_lambda_calculus.