In computer science, explicit substitution is any of several calculi based on the lambda calculus that pay special attention to the formalization of the process of substitution.
| Property | Value |
|---|
| dbpprop:abstract
|
- In computer science, explicit substitution is any of several calculi based on the lambda calculus that pay special attention to the formalization of the process of substitution. The concept of explicit substitutions has become notorious (despite a large number of published calculi of explicit substitutions in the literature with quite different characteristics) because the notion often turns up (implicitly and explicitly) in formal descriptions and implementation of all the mathematical forms of substitution involving variables such as in abstract machines, predicate logic, and symbolic computation.
|
| dbpprop:reference
| |
| rdfs:comment
|
- In computer science, explicit substitution is any of several calculi based on the lambda calculus that pay special attention to the formalization of the process of substitution.
|
| rdfs:label
| |
| owl:sameAs
| |
| skos:subject
| |
| foaf:page
| |
![[RDF Data]](/statics/sw-cube.png)
