Akira Kanda

According to our database1, Akira Kanda authored at least 18 papers between 1978 and 2005.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2005
Proximity Spaces of Exact Sets.
Proceedings of the Rough Sets, 2005

2004
First Steps Towards Computably-Infinite Information Systems.
Trans. Rough Sets, 2004

2003
Upper and Lower Recursion Schemes in Abstract Approximation Spaces.
Proceedings of the Rough Sets, 2003

2000
Approximation Spaces of Type-Free Sets.
Proceedings of the Rough Sets and Current Trends in Computing, 2000

1995
Acceptable Numerations of Morphisms and Myhill-Shepherdson Property.
Math. Log. Q., 1995

1989
Retracts of Numerations.
Ann. Pure Appl. Log., 1989

1988
Recursion theorems and effective domains.
Ann. Pure Appl. Log., 1988

Productive sets and constructively nonpartial-recursive functions.
Arch. Math. Log., 1988

1987
Alternative Characterizations of Precomplete Numerations.
Math. Log. Q., 1987

1986
Numeration Models of λβ-Calculus.
Math. Log. Q., 1986

Classes of Numeration Models of λ-Calculus.
Math. Log. Q., 1986

1985
Acceptable Numerations of Function Spaces.
Math. Log. Q., 1985

Numeration Models of λ-Calculus.
Math. Log. Q., 1985

1981
Constructive Category Theory (No. 1).
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

1980
Effective solutions of recursive domain equations.
PhD thesis, 1980

1979
When are two Effectively given Domains Identical?.
Proceedings of the Theoretical Computer Science, 1979

Fully Effective Solutions of Recursive Domain Equations.
Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

1978
Data Types as Initial Algebras: A unification of Scottery and ADJery (Extended Abstract)
Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978


  Loading...