Contextual approximation and higher-order procedures

DOI10.1007/978-3-662-49630-5_10zbMATH Open1475.68048OpenAlexW2406368000MaRDI QIDQ2811338FDOQ2811338

Ranko Lazić, Andrzej S. Murawski

Publication date: 10 June 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://wrap.warwick.ac.uk/78376/1/WRAP_1271755-cs-010416-paper_49-5.pdf

Recommendations

• Third-order Idealized Algol with iteration is decidable
• Foundations of Software Science and Computational Structures
• Games for complexity of second-order call-by-name programs
• An approach to deciding the observational equivalence of Algol-like languages
• Automata, Languages and Programming

Mathematics Subject Classification ID

Theory of programming languages (68N15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70)

Cites Work

• Visibly pushdown languages
• State-dependent representation independence
• Title not available (Why is that?)
• Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Fragment of ML Decidable by Visibly Pushdown Automata
• Foundations of Software Science and Computational Structures
• Games for complexity of second-order call-by-name programs
• Calculating modules in contextual logic program refinement

Cited In (3)

• Third-order Idealized Algol with iteration is decidable
• ML and Extended Branching VASS
• Foundations of Software Science and Computational Structures

This page was built for publication: Contextual approximation and higher-order procedures

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