Parametric (Co)Iteration vs. Primitive Direcursion

DOI10.1007/978-3-540-73859-6_18MaRDI QIDQ3612495zbMATH OpenOpenAlexFDO

Authors Johan Glimming

Publication date 10 March 2009

Published in Algebra and Coalgebra in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73859-6_18

Mathematics Subject Classification ID

Eilenberg-Moore and Kleisli constructions for monads (18C20) Semantics in the theory of computing (68Q55)

Recommendations

• Parametric corecursion
• scientific article; zbMATH DE number 2003147
• scientific article; zbMATH DE number 4026702
• scientific article; zbMATH DE number 1343506
• Iteration and coiteration schemes for higher-order and nested datatypes
• Generalization of a parametric fixed-point iteration
• Iterative integral versus dynamic programming
• scientific article; zbMATH DE number 4054934
• The Parameter Iteration Method in Dynamic Programming
• scientific article; zbMATH DE number 2080937

Cited in

(2)

• Paramorphisms
• scientific article; zbMATH DE number 1343506 (Why is no real title available?)

This page was built for publication: Parametric (Co)Iteration vs. Primitive Direcursion

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