Tatsuya Hagino. Codatatypes in ML. In Journal of Symbolic Computation, 8, pages 629--650. 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Coalgebras in Specification and Verification for Object-Oriented.. - Jacobs (1999) (1 citation) (Correct)
....de nable if and only if it is closed under subalgebras, quotients and products. A dual result for coalgebras is investigated in [GS98, Ro s98] Coalgebras and data type theory Early work on using coalgebras in data type theory to capture in nite data structures occurs in [AM82, Hag87, Hag89] The experimental programming language Charity only contains algebras and coalgebras [CF92] Programs can be constructed via various laws for initial algebras and nal coalgebras, as studied e.g. in [MFP91, Par98] As an example, the theory of the data type of both nite and in nite sequences ....
T. Hagino. Codatatypes in ML. Journ. Symb. Computation, 8:629{ 650, 1989.
Programming with Inductive and Co-Inductive Types - Greiner (1992) (6 citations) (Correct)
No context found.
Tatsuya Hagino. Codatatypes in ML. In Journal of Symbolic Computation, 8, pages 629--650. 1989.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC