Third-order Idealized Algol with iteration is decidable
From MaRDI portal
Publication:2474055
Recommendations
- Third-order Idealized Algol with iteration is decidable
- Idealized Algol with ground recursion, and DPDA equivalence
- An approach to deciding the observational equivalence of Algol-like languages
- Contextual approximation and higher-order procedures
- Reasoning about Idealized Algol using regular languages
Cites work
- Deciding Equivalence of Finite Tree Automata
- Games for complexity of second-order call-by-name programs
- Idealized Algol with ground recursion, and DPDA equivalence
- On full abstraction for PCF: I, II and III
- Reasoning about Idealized Algol using regular languages
- 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
- Third-order Idealized Algol with iteration is decidable
- Idealized Algol with ground recursion, and DPDA equivalence
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)