Data Types as Initial Algebras: A unification of Scottery and ADJery (Extended Abstract) - Akira Kanda (FOCS, 1978)

Fully Effective Solutions of Recursive Domain Equations. - Akira Kanda (MFCS, 1979)

When are two Effectively given Domains Identical?. - Akira Kanda; David Michael Ritchie Park (Theoretical Computer Science, 1979)

Effective solutions of recursive domain equations. - Akira Kanda (1980)

Constructive Category Theory (No. 1). - Akira Kanda (MFCS, 1981)

Numeration Models of λ-Calculus. - Akira Kanda (Math. Log. Q., 1985)

Acceptable Numerations of Function Spaces. - Akira Kanda (Math. Log. Q., 1985)

Classes of Numeration Models of λ-Calculus. - Akira Kanda (Math. Log. Q., 1986)

Numeration Models of λβ-Calculus. - Akira Kanda (Math. Log. Q., 1986)

Alternative Characterizations of Precomplete Numerations. - Akira Kanda; Alistair H. Lachlan (Math. Log. Q., 1987)

Productive sets and constructively nonpartial-recursive functions. - Akira Kanda (Arch. Math. Log., 1988)

Recursion theorems and effective domains. - Akira Kanda (Ann. Pure Appl. Log., 1988)

Retracts of Numerations. - Akira Kanda (Ann. Pure Appl. Log., 1989)

Acceptable Numerations of Morphisms and Myhill-Shepherdson Property. - Akira Kanda (Math. Log. Q., 1995)

Approximation Spaces of Type-Free Sets. - Peter Apostoli; Akira Kanda (Rough Sets and Current Trends in Computing, 2000)

Upper and Lower Recursion Schemes in Abstract Approximation Spaces. - Peter Apostoli; Akira Kanda (RSFDGrC, 2003)

First Steps Towards Computably-Infinite Information Systems. - Peter Apostoli; Akira Kanda; Lech Polkowski (Trans. Rough Sets, 2004)

Proximity Spaces of Exact Sets. - Peter Apostoli; Akira Kanda (RSFDGrC (1), 2005)