Contextual Approximation and Higher-Order Procedures

DOI10.1007/978-3-662-49630-5_10zbMath1475.68048OpenAlexW2406368000MaRDI QIDQ2811338

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

Mathematics Subject Classification ID

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

Related Items (1)

ML and Extended Branching VASS

Cites Work

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

This page was built for publication: Contextual Approximation and Higher-Order Procedures