Recursion from cyclic sharing: traced monoidal categories and models of cyclic lambda calculi (1997) [42 citations — 6 self]
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Hasegawa97recursionfrom,author = {Masahito Hasegawa},
title = {Recursion from cyclic sharing: traced monoidal categories and models of cyclic lambda calculi},
booktitle = {},
year = {1997},
pages = {196--213},
publisher = {Springer Verlag}
}
Years of Citing Articles
Abstract:
Abstract. Cyclic sharing (cyclic graph rewriting) has been used as a practical technique for implementing recursive computation efficiently. To capture its semantic nature, we introduce categorical models for lambda calculi with cyclic sharing (cyclic lambda graphs), using notions of computation by Moggi / Power and Robinson and traced monoidal categories by Joyal, Street and Verity. The former is used for representing the notion of sharing, whereas the latter for cyclic data structures. Our new models provide a semantic framework for understanding recursion created from cyclic sharing, which includes traditional models for recursion created from fixed points as special cases. Our cyclic lambda calculus serves as a uniform language for this wider range of models of recursive computation. 1
