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 due to a theorem partially attributed to J. Barkley Rosser. A notion of universal quantification is incorporated in the polymorphic extension of this system called System F. Russell’s paradox likely inspired the first definition of a fixed point combinator in this system. This system is connected to intuitionistic logic by the Curry–Howard correspondence. This system uses beta reduction to evaluate functions. This system is the theoretical foundation of functional programming languages. For 10 points, name this model of computation developed by Alonzo Church. ■END■
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