Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Akira Kanda

dblp:07/2130 · DBLP profile ↗
← Back
5ranked-venue papers
5as first author
0since 2021 · last 1989
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 5 · 5 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Programming languages and type systems › functional programming
algebraic data types		 0.011978
Data Types as Initial Algebras: A unification of Scottery and ADJery (Extended Abstract) · FOCS 1978
Programming languages and type systems › language semantics › formal semantics › denotational semantics
initial algebra semantics		 0.011978
Data Types as Initial Algebras: A unification of Scottery and ADJery (Extended Abstract) · FOCS 1978
Programming languages and type systems
type theory		 0.011978
Data Types as Initial Algebras: A unification of Scottery and ADJery (Extended Abstract) · FOCS 1978

Methods — techniques the papers use, named apart from their topics

initial algebra semantics · 0.0
YearPublicationVenuePosition
1989 Retracts of Numerations
Akira Kanda
 Ann. Pure Appl. Log.1
1988 Recursion theorems and effective domains
Akira Kanda
 Ann. Pure Appl. Log.1
1981 Constructive Category Theory (No. 1)
Akira Kanda
 MFCS1
1979 Fully Effective Solutions of Recursive Domain Equations
Akira Kanda
 MFCS1
1978 Data Types as Initial Algebras: A unification of Scottery and ADJery (Extended Abstract)
abstract
This paper presents a formulation within the framework of data types as initial algebras, of parameterizations of data types. We will observe that Scott's data type constructors like +, ×, and circular definitions are parameterizations in our sense. Thence we will provide a uniform ground to compare ADJ-like data types with Lehmann-Smyth's data types, and will justify recent ADJ's claim that polynomial data types of Lehmann-Smyth could be simulated within ADJery.
Akira Kanda
 FOCS1