Automatic reduction of cuch expression by means of the value method
Copyright policy )Automatic reduction of cuch expression by means of the value method
The first part of this paper is an introduction to CUCH, a formal language created in 1962 by merging the A-formulae language (A. Church) and the combinators language (H. B. Curry). The second part deals with the automatic reduction of the CUCH formulae. In the years between 1960 and 1964 McCarthy and Landin, using the characteristics of Λ-conversion and introducing the semantic notion of «value of an expression» created some languages, which, even using completely different algorithms, utilize the notion of reduction to normal form as a mechanism of an abstract machine for computing recursive function (of list, the former, of integer, the latter).
- IAC United States
General topics in the theory of software, Formal languages and automata, Computability and recursion theory, Theorem proving (deduction, resolution, etc.)
General topics in the theory of software, Formal languages and automata, Computability and recursion theory, Theorem proving (deduction, resolution, etc.)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!