Third-order Idealized Algol with iteration is decidable

DOI10.1016/J.TCS.2007.09.022MaRDI QIDQ2474055zbMATH OpenOpenAlexFDO

Authors 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 complexitygame semanticsprogram analysis

Mathematics Subject Classification ID

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

Recommendations

• Foundations of Software Science and Computational Structures
• Automata, Languages and Programming
• An approach to deciding the observational equivalence of Algol-like languages
• Contextual approximation and higher-order procedures
• scientific article; zbMATH DE number 1670817

Cites work

• Automata, Languages and Programming
• Deciding Equivalence of Finite Tree Automata
• Games for complexity of second-order call-by-name programs
• scientific article; zbMATH DE number 1670817 (Why is no real title available?)
• On full abstraction for PCF: I, II and III
• The Expressiveness of Simple and Second-Order Type Structures
• Tools and Algorithms for the Construction and Analysis of Systems
• Visibly pushdown languages

Cited in

(7)

• An approach to deciding the observational equivalence of Algol-like languages
• Leafy automata for higher-order concurrency
• Latent semantic analysis of game models using LSTM
• Contextual approximation and higher-order procedures
• The impact of higher-order state and control effects on local relational reasoning
• Foundations of Software Science and Computational Structures
• Automata, Languages and Programming

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2474055)