Generalization of Final Algebra Semantics by Relativization
暂无分享,去创建一个
[1] Satish R. Thatte. Full Abstraction and Limiting Completeness in Equational Languages , 1989, Theor. Comput. Sci..
[2] Christoph M. Hoffmann,et al. Programming with Equations , 1982, TOPL.
[3] Mitchell Wand,et al. Final Algebra Semantics and Data Type Extensions , 1979, J. Comput. Syst. Sci..
[4] S. Lane. Categories for the Working Mathematician , 1971 .
[5] S. Maclane,et al. Categories for the Working Mathematician , 1971 .
[6] Deepak Kapur,et al. Proof by Consistency , 1987, Artif. Intell..
[7] Samuel N. Kamin. Final Data Types and Their Specification , 1983, TOPL.
[8] D. A. Turner,et al. Miranda: A Non-Strict Functional language with Polymorphic Types , 1985, FPCA.
[9] Robin Milner,et al. Fully Abstract Models of Typed lambda-Calculi , 1977, Theor. Comput. Sci..
[10] Deepak Kapur,et al. Inductive Reasoning with Incomplete Specifications (Preliminary Report) , 1986, LICS.