Finitary Semantics of Linear Logic and Higher-Order Model-Checking

DOI10.1007/978-3-662-48057-1_20zbMath1465.68179arXiv1502.05147OpenAlexW1795516371MaRDI QIDQ2946341

Charles Grellois, Paul-André Melliès

Publication date: 16 September 2015

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

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

zbMATH Keywords

selection problemparity gameslinear logichigher-order model checkingfinitary semantics

Mathematics Subject Classification ID

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

Related Items

Unnamed Item, Unary Resolution: Characterizing Ptime, Towards a Formal Theory of Graded Monads, Unnamed Item, Domains for Higher-Order Games, Streett Automata Model Checking of Higher-Order Recursion Schemes

Cites Work

• Fixed-point operations on ccc's. I
• An Infinitary Model of Linear Logic
• Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection
• Semantic Evaluation, Intersection Types and Complexity of Simply Typed Lambda Calculus
• A model for behavioural properties of higher-order programs
• Relational semantics of linear logic and higher-order model-checking
• Unnamed Item
• Unnamed Item
• Unnamed Item