Advertisement
Published in:
2015 | OriginalPaper | Chapter
Finitary Semantics of Linear Logic and Higher-Order Model-Checking
Authors : Charles Grellois, Paul-André Melliès
Published in: Mathematical Foundations of Computer Science 2015
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
In this paper, we explain how the connection between higher-order model-checking and linear logic recently exhibited by the authors leads to a new and conceptually enlightening proof of the selection problem originally established by Carayol and Serre using collapsible pushdown automata. The main idea is to start from an infinitary and colored relational semantics of the \(\lambda \,Y\)-calculus formulated in a companion paper, and to replace it by a finitary counterpart based on finite prime-algebraic lattices. Given a higher-order recursion scheme \(\mathcal {G}\), the finiteness of its interpretation in the resulting model enables us to associate to any MSO formula \(\varphi \) a higher-order recursion scheme \(\mathcal {G}_{\varphi }\) resolving the selection problem.