DMCA
Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic Lambda Calculi (1997)
| Citations: | 48 - 5 self |
BibTeX
@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}
}
Share
 |
 |
 |
 |
||
OpenURL
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.
Keyphrases
cyclic sharing cyclic lambda calculus traced monoidal category recursive computation lambda calculus practical technique cyclic data structure special case recursive program uniform language monoidal category moggi power cyclic lambda graph traditional model semantic domain wider range traditional method semantic framework real implementation cyclic graph continuous function categorical model semantic nature fixed point new model
