An approach to object semantics based on terminal co-algebras
暂无分享,去创建一个
[1] José Meseguer,et al. Multiparadigm Logic Programming , 1992, ALP.
[2] J. Adámek,et al. Automata and Algebras in Categories , 1990 .
[3] S. Maclane,et al. Categories for the Working Mathematician , 1971 .
[4] S. Lane. Categories for the Working Mathematician , 1971 .
[5] Simon Thompson,et al. Type theory and functional programming , 1991, International computer science series.
[6] Solomon Feferman,et al. A new approach to abstract data types, I Informal development , 1992, Mathematical Structures in Computer Science.
[7] José Meseguer,et al. A logical theory of concurrent objects , 1990, OOPSLA/ECOOP '90.
[8] John C. Reynolds,et al. Three Approaches to Type Structure , 1985, TAPSOFT, Vol.1.
[9] Simon L. Peyton Jones,et al. Report on the programming language Haskell: a non-strict, purely functional language version 1.2 , 1992, SIGP.
[10] Anne Elisabeth Haxthausen,et al. The Raise Specification Language , 1992 .
[11] D. A. Turner,et al. Miranda: A Non-Strict Functional language with Polymorphic Types , 1985, FPCA.
[12] Michael Barr,et al. Terminal Coalgebras in Well-Founded Set Theory , 1993, Theor. Comput. Sci..
[13] Lawrence Charles Paulson,et al. ML for the working programmer , 1991 .
[14] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.