Deciding validity in a spatial logic for trees

DOI10.1017/S0956796804005404zbMath1083.68021DBLPjournals/jfp/CalcagnoCG05WikidataQ56982073 ScholiaQ56982073MaRDI QIDQ3367666

Andrew D. Gordon, Cristiano Calcagno, Luca Cardelli

Publication date: 25 January 2006

Published in: Journal of Functional Programming (Search for Journal in Brave)

zbMATH Keywords

sequent calculuslogic-based type systems for semistructured data

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Data structures (68P05)

Related Items (12)

On Composing Finite Forests with Modal Logics ⋮ Specification and verification for semi-structured data ⋮ Semantic subtyping with an SMT solver ⋮ Expressiveness and complexity of graph logic ⋮ Deciding safety properties in infinite-state pi-calculus via behavioural types ⋮ Modal logics and local quantifiers: a zoo in the elementary hierarchy ⋮ PHYSARUM SPATIAL LOGIC ⋮ A Complete Axiomatic System for a Process-Based Spatial Logic ⋮ A spatial equational logic for the applied \(\pi \)-calculus ⋮ Decidable Extensions of Hennessy-Milner Logic ⋮ Exploring the relation between Intuitionistic BI and Boolean BI: an unexpected embedding ⋮ Manipulating Trees with Hidden Labels

Uses Software

• SLMC

This page was built for publication: Deciding validity in a spatial logic for trees