IO vs OI in higher-order recursion schemes

MaRDI QIDQ5854735zbMATH OpenFDO

Authors Axel Haddad

Publication date 17 March 2021

Full work available at URL https://arxiv.org/abs/1202.3498, http://eptcs.web.cse.unsw.edu.au/paper.cgi?FICS2012.4

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• scientific article; zbMATH DE number 3880134
• Homogeneity without loss of generality
• scientific article; zbMATH DE number 1456960

Cited in

(10)

• The IO and OI hierarchies revisited
• The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic
• scientific article; zbMATH DE number 3848594 (Why is no real title available?)
• scientific article; zbMATH DE number 3880134 (Why is no real title available?)
• Krivine machines and higher-order schemes
• Homogeneity without loss of generality
• Recursion schemes, the MSO logic, and the \textsf{U} quantifier
• Domains for Higher-Order Games
• Cost Automata, Safe Schemes, and Downward Closures
• Cost automata, safe schemes, and downward closures

This page was built for publication: IO vs OI in higher-order recursion schemes

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