A Curry-Howard Approach to Church's Synthesis.
Church's synthesis problem asks whether there exists a finite-state stream transducer satisfying a given input-output specification. For specifications written in Monadic Second-Order Logic over infinite words, Church's synthesis can theoretically be solved algorithmically using automata and games. We revisit Church's synthesis via the Curry-Howard correspondence by introducing SMSO, a non-classical subsystem of MSO, which is shown to be sound and complete w.r.t. synthesis thanks to an automata-based realizability model.
We study a class of hyperbolic partial differential equations on a one dimensional spatial domain with control and observation at the boundary. Using the idea of feedback we show these systems are well-posed in the sense of Weiss and Salamon if and only if the state operator generates a C0-semigroup. Furthermore, we show that the corresponding transfer function is regular, i.e., has a limit for s going to infinity.