Third-order Idealized Algol with iteration is decidable

DOI10.1016/j.tcs.2007.09.022zbMath1134.68017OpenAlexW3193221559MaRDI QIDQ2474055

Andrzej S. Murawski, Igor Walukiewicz

Publication date: 5 March 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://ora.ox.ac.uk/objects/uuid:ba456bc7-50bb-40ec-bd89-e9b255e1fffa

zbMATH Keywords

computational complexityprogram analysisgame semantics

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)

Related Items (3)

The impact of higher-order state and control effects on local relational reasoning ⋮ Latent semantic analysis of game models using LSTM ⋮ Leafy automata for higher-order concurrency

Cites Work

• Unnamed Item
• On full abstraction for PCF: I, II and III
• Games for complexity of second-order call-by-name programs
• Deciding Equivalence of Finite Tree Automata
• Visibly pushdown languages
• The Expressiveness of Simple and Second-Order Type Structures
• Tools and Algorithms for the Construction and Analysis of Systems
• Automata, Languages and Programming

This page was built for publication: Third-order Idealized Algol with iteration is decidable