Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic Lambda Calculi

Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic Lambda Calculi (1997)

Cached

Download Links

[www.kurims.kyoto-u.ac.jp]

Other Repositories/Bibliography

DBLP

by Masahito Hasegawa

Citations:

40 - 5 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic Lambda Calculi	user correction - Legacy Corrections
AUTHOR NAME	Masahito Hasegawa	SVM HeaderParse 0.1
AUTHOR AFFIL	LFCS, Department of Computer Science, University of Edinburgh	SVM HeaderParse 0.2
AUTHOR ADDR	JCMB, King's Buildings, Edinburgh EH9 3JZ, Scotland	SVM HeaderParse 0.1
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 Introduction One of the traditional methods of interpreting a recursive program in a semantic domain is to use the least fixed-point of continuous functions. However, in the real implementations of program...	user correction - Legacy Corrections
YEAR	1997	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	196--213	INFERENCE
VOLUME	1210	INFERENCE
CITATIONS	25 found	ParsCit 1.0