Finitary semantics of linear logic and higher-order model-checking

DOI10.1007/978-3-662-48057-1_20zbMATH Open1465.68179arXiv1502.05147OpenAlexW1795516371MaRDI QIDQ2946341FDOQ2946341

Authors: Charles Grellois, Paul-André Melliès 

Publication date: 16 September 2015

Published in: Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)

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 lambdaY-calculus already formulated, and to replace it by its finitary counterpart based on finite prime-algebraic lattices. Given a higher-order recursion scheme G, the finiteness of its interpretation in the model enables us to associate to any MSO formula phi a new higher-order recursion scheme G_phi resolving the selection problem.

Full work available at URL: https://arxiv.org/abs/1502.05147

Recommendations

• Relational semantics of linear logic and higher-order model checking
• An Infinitary Model of Linear Logic
• On the relationship between higher-order recursion schemes and higher-order fixpoint logic
• Mathematical Foundations of Computer Science 2005
• On Global Model Checking Trees Generated by Higher-Order Recursion Schemes

zbMATH Keywords

linear logicselection problemparity gameshigher-order model checkingfinitary semantics

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)

Cites Work

• Categorical semantics of linear logic
• Semantic evaluation; intersection types and complexity of simply typed lambda calculus
• Title not available (Why is that?)
• Fixed-point operations on ccc's. I
• Collapsible pushdown automata and labeled recursion schemes, equivalence, safety and effective selection
• Title not available (Why is that?)
• Relational semantics of linear logic and higher-order model checking
• An Infinitary Model of Linear Logic
• A model for behavioural properties of higher-order programs

Cited In (9)

• Domains for Higher-Order Games
• On the termination problem for probabilistic higher-order recursive programs
• Towards a formal theory of graded monads
• Title not available (Why is that?)
• LambdaY-calculus with priorities
• Relational semantics of linear logic and higher-order model checking
• Streett Automata Model Checking of Higher-Order Recursion Schemes
• A compositional approach to parity games
• Unary resolution: characterizing \textsc{Ptime}

This page was built for publication: Finitary semantics of linear logic and higher-order model-checking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946341)