Akira Kanda

18 papers A* 1B 2Journal 10Unranked 4
YearRankTypeTitle / Venue / Authors
2005 — conf
Proximity Spaces of Exact Sets.
RSFDGrC (1)
Peter Apostoli, Akira Kanda
2004 J jnl
First Steps Towards Computably-Infinite Information Systems.
Trans. Rough Sets
Peter Apostoli, Akira Kanda, Lech Polkowski
2003 — conf
Upper and Lower Recursion Schemes in Abstract Approximation Spaces.
RSFDGrC
Peter Apostoli, Akira Kanda
2000 — conf
Approximation Spaces of Type-Free Sets.
Rough Sets and Current Trends in Computing
Peter Apostoli, Akira Kanda
1995 J jnl
Acceptable Numerations of Morphisms and Myhill-Shepherdson Property.
Math. Log. Q.
Akira Kanda
1989 J jnl
Retracts of Numerations.
Ann. Pure Appl. Log.
Akira Kanda
1988 J jnl
Productive sets and constructively nonpartial-recursive functions.
Arch. Math. Log.
Akira Kanda
1988 J jnl
Recursion theorems and effective domains.
Ann. Pure Appl. Log.
Akira Kanda
1987 J jnl
Alternative Characterizations of Precomplete Numerations.
Math. Log. Q.
Akira Kanda, Alistair H. Lachlan
1986 J jnl
Classes of Numeration Models of λ-Calculus.
Math. Log. Q.
Akira Kanda
1986 J jnl
Numeration Models of λβ-Calculus.
Math. Log. Q.
Akira Kanda
1985 J jnl
Acceptable Numerations of Function Spaces.
Math. Log. Q.
Akira Kanda
1985 J jnl
Numeration Models of λ-Calculus.
Math. Log. Q.
Akira Kanda
1981 B conf
Constructive Category Theory (No. 1).
MFCS
Akira Kanda
1980 — —
Effective solutions of recursive domain equations.
Akira Kanda
1979 B conf
Fully Effective Solutions of Recursive Domain Equations.
MFCS
Akira Kanda
1979 — conf
When are two Effectively given Domains Identical?.
Theoretical Computer Science
Akira Kanda, David Michael Ritchie Park
1978 A* conf
Data Types as Initial Algebras: A unification of Scottery and ADJery (Extended Abstract)
FOCS
Akira Kanda