论文信息 - On the Foundations of Corecursion

On the Foundations of Corecursion

We consider foundational questions related to the de nition of functions by corecursion. This method is especially suited to functions into the greatest xed point of some monotone operator, and it is most applicable in the context of non-wellfounded sets. We review the work on the Special Final Coalgebra Theorem of Aczel [NWF] and the Corecursion Theorem of Barwise and Moss [VC]. We prove some results relating the two approaches, and we present a framework from which one can derive the results of both.

Lawrence S. Moss | Norman Danner

[1] F. Honsell,et al. Set theory with free construction principles , 1983 .

[2] Jan J. M. M. Rutten,et al. On the Foundation of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders , 1992, REX Workshop.

[3] J. Rutten. A calculus of transition systems (towards universal coalgebra) , 1995 .

[4] Michael Barr,et al. Terminal Coalgebras in Well-Founded Set Theory , 1993, Theor. Comput. Sci..

[5] Peter Aczel,et al. Non-well-founded sets , 1988, CSLI lecture notes series.

[6] Marina Lenisa. Final Semantics for a Higher Order Concurrent Language , 1996, CAAP.

[7] Michael W. Mislove,et al. Non-Well-Founded Sets Modeled as Ideal Fixed Points , 1991, Inf. Comput..

[8] Jan J. M. M. Rutten,et al. Initial Algebra and Final Coalgebra Semantics for Concurrency , 1993, REX School/Symposium.

[9] Peter Aczel,et al. A Final Coalgebra Theorem , 1989, Category Theory and Computer Science.

[10] M. de Rijke,et al. Modal Logic and Process Algebra: A Bisimulation Perspective , 1996 .

[11] Jan J. M. M. Rutten. Processes as Terms: Non-Well-Founded Models for Bisimulation , 1992, Math. Struct. Comput. Sci..