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. 1998 ACM Subject Classification F.4.1 Mathematical Logic.
منابع مشابه
Automata Theory Approach to Predicate Intuitionistic Logic
Predicate intuitionistic logic is a well established fragment of dependent types. According to the Curry-Howard isomorphism proof construction in the logic corresponds well to synthesis of a program the type of which is a given formula. We present a model of automata that can handle proof construction in full intuitionistic first-order logic. The automata are constructed in such a way that any ...
متن کاملProofs as Efficient Programs
There may, indeed, be other uses of the system than its use as a logic. Logic and theory of computation have been intertwined since their first days. The formalized notion(s) of effective computation are at first technical tools for the investigation of first order systems, and only ten years later – in the hands of John von Neumann – become the blueprints of engineered physical devices. Genera...
متن کاملExtensions of Structural Synthesis of Programs
Structural synthesis of programs (SSP) is an approach to deductive synthesis of functional programs using types as speciications and based on the Curry-Howard correspondence and on an intensional treatment of the notion of type. The implemented programming environments employing SSP have been based on a fragment of intuitionistic propositional logic (simple type theory) and on a natural-deducti...
متن کاملMetric Reasoning about $\lambda$-Terms: the Affine Case (Long Version)
Terms of Church's λ-calculus can be considered equivalent along many different definitions, but context equivalence is certainly the most direct and universally accepted one. If the underlying calculus becomes probabilistic, however, equivalence is too discriminating: terms which have totally unrelated behaviours are treated the same as terms which behave very similarly. We study the problem of...
متن کاملDisjunctive Axioms and Concurrent $\lambda$-Calculi: a Curry-Howard Approach
We add to intuitionistic logic infinitely many classical disjunctive tautologies and use the Curry–Howard correspondence to obtain typed concurrent λ-calculi; each of them features a specific communication mechanism, including broadcasting and cyclic messageexchange, and enhanced expressive power w.r.t. the λ-calculus. Moreover they all implement forms of code mobility. Our results provide a fi...
متن کامل