Question

In a cube diagram introduced by Henk Barendregt, this theoretical system is the front bottom left vertex. Mattias Felleisen’s (“feh-LYE-sen’s”) two control operators A and C are used to extend this system to be able to manipulate continuations. This system’s rewriting rules are confluent (10[1])due to a theorem (10[1])partially attributed to J. Barkley (10[1])Rosser. A notion (10[2])of universal quantification is incorporated in the polymorphic extension of (10[1])this system (10[1])called System F. Russell’s paradox (-5[1])likely inspired the first definition of a fixed point combinator in this system. (10[1]-5[2])This system is connected to intuitionistic logic (-5[1])by the Curry–Howard correspondence. (10[1])This system uses beta reduction to evaluate functions. (10[1]-5[1])This system (10[2])is the theoretical foundation of functional programming (10[2])languages. (10[2])For 10 points, name this model of computation developed by Alonzo Church. (10[2])■END■ (10[6]0[1])

ANSWER: lambda calculus [accept untyped lambda calculus, typed lambda calculus, simply-typed lambda calculus, polymorphic lambda calculus, or other forms or extensions of the lambda calculus; reject “calculus”] (The theorem about confluence is the Church–Rosser theorem. The combinator is the Y combinator.)
<Other Science>
= Average correct buzz position