About: Lambda calculus

An Entity of Type: Concept, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

Property	Value
dbo:wikiPageID	693892 (xsd:integer)
dbo:wikiPageRevisionID	953110322 (xsd:integer)
dbp:wikiPageUsesTemplate	dbt:Commons_category dbt:Cat_main
rdf:type	skos:Concept
rdfs:label	Lambda calculus (en)
skos:broader	dbc:Logical_calculi dbc:Functional_programming dbc:Computability_theory dbc:Models_of_computation dbc:Programming_language_theory
skos:prefLabel	Lambda calculus (en)
prov:wasDerivedFrom	wikipedia-en:Category:Lambda_calculus?oldid=953110322&ns=14
is dbo:wikiPageWikiLink of	dbr:Montague_grammar dbr:Normalisation_by_evaluation dbr:Typed_lambda_calculus dbr:Applicative_computing_systems dbr:Apply dbr:Beta_normal_form dbr:Currying dbr:De_Bruijn_index dbr:De_Bruijn_notation dbr:Deductive_lambda_calculus dbr:Intersection_type_discipline dbr:Let_expression dbr:Η-conversion dbr:Combinatory_logic dbr:Normal_form_(abstract_rewriting) dbr:Scott–Curry_theorem dbr:Anonymous_function dbr:Calculus_of_constructions dbr:Call-by-push-value dbr:Simply_typed_lambda_calculus dbr:Krivine_machine dbr:Pure_type_system dbr:Böhm_tree dbr:Lambda-mu_calculus dbr:Lambda_calculus_definition dbr:Lambda_cube dbr:Lambda_lifting dbr:Church_encoding dbr:Church–Rosser_theorem dbr:Director_string dbr:Knights_of_the_Lambda_Calculus dbr:Higher-order_function dbr:Hindley–Milner_type_system dbr:Pattern_calculus dbr:Lambda_calculus dbr:Mogensen–Scott_encoding dbr:System_F dbr:Divergence_(computer_science) dbr:B,_C,_K,_W_system dbr:Cartesian_closed_category dbr:Reduction_strategy dbr:Kleene–Rosser_paradox dbr:Rho_calculus dbr:SKI_combinator_calculus dbr:Untyped_lambda_calculus dbr:Explicit_substitution dbr:Type_inhabitation dbr:Fixed-point_combinator dbr:System_U dbr:Supercombinator
is dcterms:subject of	dbr:Montague_grammar dbr:Normalisation_by_evaluation dbr:Typed_lambda_calculus dbr:Applicative_computing_systems dbr:Apply dbr:Beta_normal_form dbr:Currying dbr:De_Bruijn_index dbr:De_Bruijn_notation dbr:Deductive_lambda_calculus dbr:Intersection_type_discipline dbr:Let_expression dbr:Η-conversion dbr:Combinatory_logic dbr:Normal_form_(abstract_rewriting) dbr:Scott–Curry_theorem dbr:Anonymous_function dbr:Calculus_of_constructions dbr:Call-by-push-value dbr:Simply_typed_lambda_calculus dbr:Krivine_machine dbr:Pure_type_system dbr:Böhm_tree dbr:Lambda-mu_calculus dbr:Lambda_calculus_definition dbr:Lambda_cube dbr:Lambda_lifting dbr:Church_encoding dbr:Church–Rosser_theorem dbr:Director_string dbr:Knights_of_the_Lambda_Calculus dbr:Higher-order_function dbr:Hindley–Milner_type_system dbr:Pattern_calculus dbr:Lambda_calculus dbr:Mogensen–Scott_encoding dbr:System_F dbr:Divergence_(computer_science) dbr:B,_C,_K,_W_system dbr:Cartesian_closed_category dbr:Reduction_strategy dbr:Kleene–Rosser_paradox dbr:Rho_calculus dbr:SKI_combinator_calculus dbr:Untyped_lambda_calculus dbr:Explicit_substitution dbr:Type_inhabitation dbr:Fixed-point_combinator dbr:System_U dbr:Supercombinator
is skos:broader of	dbc:Applicative_computing_systems dbc:Substitution_(logic) dbc:Abstract_machines