Search the dblp DataBase
Akira Kanda :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Akira Kanda Data Types as Initial Algebras: A unification of Scottery and ADJery (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1978, pp:221-230 [Conf ] Akira Kanda Fully Effective Solutions of Recursive Domain Equations. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:326-336 [Conf ] Akira Kanda Constructive Category Theory (No. 1). [Citation Graph (0, 0)][DBLP ] MFCS, 1981, pp:563-577 [Conf ] Peter Apostoli , Akira Kanda Approximation Spaces of Type-Free Sets. [Citation Graph (0, 0)][DBLP ] Rough Sets and Current Trends in Computing, 2000, pp:98-105 [Conf ] Peter Apostoli , Akira Kanda Upper and Lower Recursion Schemes in Abstract Approximation Spaces. [Citation Graph (0, 0)][DBLP ] RSFDGrC, 2003, pp:205-212 [Conf ] Peter Apostoli , Akira Kanda Proximity Spaces of Exact Sets. [Citation Graph (0, 0)][DBLP ] RSFDGrC (1), 2005, pp:94-103 [Conf ] Akira Kanda , David Park When are two Effectively given Domains Identical?. [Citation Graph (0, 0)][DBLP ] Theoretical Computer Science, 1979, pp:170-181 [Conf ] Akira Kanda Retracts of Numerations. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1989, v:42, n:3, pp:225-242 [Journal ] Akira Kanda Acceptable Numerations of Morphisms and Myhill-Shepherdson Property. [Citation Graph (0, 0)][DBLP ] Math. Log. Q., 1995, v:41, n:, pp:39-48 [Journal ] Peter Apostoli , Akira Kanda , Lech Polkowski First Steps Towards Computably-Infinite Information Systems. [Citation Graph (0, 0)][DBLP ] , 2004, v:, n:, pp:151-188 [Journal ] Search in 0.042secs, Finished in 0.044secs