Two-Level Game Semantics, Intersection Types, and Recursion Schemes
نویسندگان
چکیده
We introduce a new cartesian closed category of two-level arenas and innocent strategies to model intersection types that are refinements of simple types. Intuitively a property (respectively computation) on the upper level refines that on the lower level. We prove Subject Expansion—any lower-level computation is closely and canonically tracked by the upper-level computation that lies over it—which is a measure of the robustness of the two-level semantics. The game semantics of the type system is fully complete: every winning strategy is the denotation of some derivation. To demonstrate the relevance of the game model, we use it to construct new semantic proofs of non-trivial algorithmic results in higher-order model checking.
منابع مشابه
Game semantics of higher-order recursion schemes establishes the decidability ofMSO model-checking
This article presents two different ways of model-checking higher-order recursion schemes, both relying on game semantics. A given recursion scheme is translated to another, which is its computational extent, in the sense that β-reduction paths called traversals in the new generated tree are isomorphic to branches of the former tree. Then, the two approaches differ on their way of simulating tr...
متن کاملIntersection Types for Normalization and Verification
One of the basic principles in typed lambda calculi is that typable lambda terms are normalizable. Since the converse direction does not hold for simply typed lambda calculus, people have been studying its extensions. This gave birth to the intersection type systems, that exactly characterize various classes of lambda terms, such as strongly/weakly normalizable terms and solvable ones (see e.g....
متن کاملOn Global Model Checking Trees Generated by Higher-Order Recursion Schemes
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking Problem takes as input such a recursion scheme together with a modal μ-calculus sentence and asks for a finite representation of the set of nodes in the tree generated by the scheme at which the sentence holds. Using a...
متن کاملSemantics of linear logic and higher-order model-checking. (Sémantique de la logique linéaire et "model-checking" d'ordre supérieur)
This thesis studies problems of higher-order model-checking from a semantic and logical perspective. Higher-order model-checking is concerned with the verification of properties expressed in monadic second-order logic, specified over infinite trees generated by a class of rewriting systems called higher-order recursion schemes. These systems are equivalent to simply-typed λ-terms with recursion...
متن کاملIntersection types and higer-order model checking
Higher-order recursion schemes are systems of equations that are used to define finite and infinite labelled trees. Since, as Ong has shown, the trees defined have a decidable monadic second order theory, recursion schemes have drawn the attention of research in program verification, where they sit naturally as a higher-order, functional analogue of Boolean programs. Driven by applications, fra...
متن کامل