Statements (40)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
formal semantics
|
| gptkbp:expressedIn |
recursion
arithmetic boolean logic data structures via encoding |
| gptkbp:field |
gptkb:logic
computer science |
| gptkbp:hasApplication |
gptkb:artificial_intelligence
gptkb:logic proof theory automated theorem proving programming language design |
| gptkbp:hasConcept |
function application
function abstraction variable binding |
| gptkbp:hasEncoding |
gptkb:Church_encoding
gptkb:Scott_encoding |
| gptkbp:hasNormalForm |
beta normal form
|
| gptkbp:hasProperty |
gptkb:Turing_completeness
no type system |
| gptkbp:hasSyntax |
expressions built from variables, abstraction, application
|
| gptkbp:hasUndecidableProblem |
equivalence
normalization |
| https://www.w3.org/2000/01/rdf-schema#label |
untyped lambda calculus
|
| gptkbp:introducedIn |
1930s
|
| gptkbp:inventedBy |
gptkb:Alonzo_Church
|
| gptkbp:isFoundationFor |
gptkb:logic
combinatory logic functional programming |
| gptkbp:limitation |
no built-in data types
no type safety |
| gptkbp:operator |
alpha conversion
beta reduction eta conversion |
| gptkbp:relatedTo |
gptkb:SKI_combinator_calculus
typed lambda calculus |
| gptkbp:studiedIn |
programming language theory
theory of computation |
| gptkbp:bfsParent |
gptkb:lambda_calculus
|
| gptkbp:bfsLayer |
5
|