Fragments of ML Decidable by Nested Data Class Memory Automata
From MaRDI portal
Publication:2949443
DOI10.1007/978-3-662-46678-0_16zbMath1459.68035arXiv1501.04511OpenAlexW1920911435MaRDI QIDQ2949443
No author found.
Publication date: 1 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.04511
Formal languages and automata (68Q45) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)
Related Items (4)
Algorithmic games for full ground references ⋮ Block structure vs scope extrusion: between innocence and omniscience ⋮ ML and Extended Branching VASS ⋮ Leafy automata for higher-order concurrency
This page was built for publication: Fragments of ML Decidable by Nested Data Class Memory Automata
