Higher Order Containers Export

@unpublished{citeulike:5990445, abstract = {Containers are a semantic way to talk about strictly positive types. In previous work it was shown that containers are closed under various constructions including products, coproducts, initial algebras and terminal coalgebras. In the present paper we show that, surprisingly, the category of containers is cartesian closed, giving rise to a full cartesian closed subcategory of endofunctors. The result has interesting applications in generic programming and representation of higher order abstract syntax. We also show that while the category of containers has finite limits, it is not locally cartesian closed.}, author = {Altenkirch, Thorsten and Levy, Paul and Staton, Sam}, citeulike-article-id = {5990445}, citeulike-linkout-0 = {http://www.cs.nott.ac.uk/~txa/publ/hocont.pdf}, keywords = {containers, hoas}, posted-at = {2009-10-22 23:10:51}, priority = {4}, title = {Higher Order Containers}, url = {http://www.cs.nott.ac.uk/~txa/publ/hocont.pdf} }

TY - UNPB ID - citeulike:5990445 L3 - citeulike-article-id:5990445 N2 - Containers are a semantic way to talk about strictly positive types. In previous work it was shown that containers are closed under various constructions including products, coproducts, initial algebras and terminal coalgebras. In the present paper we show that, surprisingly, the category of containers is cartesian closed, giving rise to a full cartesian closed subcategory of endofunctors. The result has interesting applications in generic programming and representation of higher order abstract syntax. We also show that while the category of containers has finite limits, it is not locally cartesian closed. TI - Higher Order Containers KW - containers KW - hoas AU - Altenkirch, Thorsten AU - Levy, Paul AU - Staton, Sam UR - http://www.cs.nott.ac.uk/~txa/publ/hocont.pdf ER -