Can I read Higher order functions and Brouwer’s thesis on EtoBox?

Higher order functions and Brouwer’s thesis by JONATHAN STERLING is a Computer Science article available to read on EtoBox.

What is Higher order functions and Brouwer’s thesis about?

Extending Martín Escardó's effectful forcing technique, we give a new proof of a well-known result: Brouwer's monotone bar theorem holds for any bar that can be realized by a functional of type (N → N) → N in Gödel's System T. Effectful forcing is an elementary alternative to standard sheaftheoretic forcing arguments, using ideas from programming languages, including computational effects, monads, the algebra interpretation of call-by-name λ-calculus, and logical relations. Our argument proceeds by interpreting System T programs as well-founded dialogue trees whose nodes branch on a query to an oracle of type N → N, lifted to higher type along a call-by-name translation. To connect this interpretation to the bar theorem, we then show that Brouwer's famous "mental constructions" of barhood constitute an invariant form of these dialogue trees in which queries to the oracle are made maximally and in order. "The force of Church's Law is that it postulates that all future notions of computation will be equivalent in expressive power (measured by definability of functions on the natural numbers) to the λ-calculus. Church's Law is therefore a scientific law in the same sense as, say, Newt

Who reads Higher order functions and Brouwer’s thesis?

Author

JONATHAN STERLING

Publisher

Cambridge University Press (CUP)

Published

2021

Language

EN

Field

Computer Science (Physical Sciences)