ML and Extended Branching VASS
From MaRDI portal
Publication:2988645
DOI10.1007/978-3-662-54434-1_12zbMath1485.68028OpenAlexW2595608646MaRDI QIDQ2988645
No author found.
Publication date: 19 May 2017
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: http://wrap.warwick.ac.uk/86366/7/WRAP-ML-extended-branching-VASS-2017-Murawski-2017.pdf
Formal languages and automata (68Q45) Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Unnamed Item
- Unnamed Item
- Functions with local state: regularity and undecidability
- On notions of regularity for data languages
- Some decision problems related to the reachability problem for Petri nets
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- Game-theoretic analysis of call-by-value computation
- Weak and Nested Class Memory Automata
- FO2(<,+1,~) on data trees, data tree automata and branching vector addition systems
- Contextual Approximation and Higher-Order Procedures
- Nonelementary Complexities for Branching VASS, MELL, and Extensions
- Fragments of ML Decidable by Nested Data Class Memory Automata
- Algorithmic Nominal Game Semantics
- A Fragment of ML Decidable by Visibly Pushdown Automata
- Algorithmic Games for Full Ground References
- Game Semantic Analysis of Equivalence in IMJ
- Visibly pushdown languages
- Full Abstraction for Reduced ML
- On Notions of Regularity for Data Languages
- Automata, Languages and Programming
This page was built for publication: ML and Extended Branching VASS
