Semantics of Higher-Order Recursion Schemes

DOI10.1007/978-3-642-03741-2_5zbMath1239.68041arXiv1101.4929MaRDI QIDQ5891582

Jiří Adámek, Jiří Velebil, Stefan Milius

Publication date: 1 June 2012

Published in: Logical Methods in Computer Science, Algebra and Coalgebra in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1101.4929

zbMATH Keywords

higher-order recursion schemes; rational tree; infinite \(\lambda \)-terms; sets in context

Mathematics Subject Classification ID

68Q55: Semantics in the theory of computing

68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)

18F20: Presheaves and sheaves, stacks, descent conditions (category-theoretic aspects)

03B40: Combinatory logic and lambda calculus