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

Susumu Hayashi

dblp:21/1255 · DBLP profile ↗
← Back
9ranked-venue papers
7as first author
0since 2021 · last 2010
—ORCID · none

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

Theory of computation · 7 · 5 first-authorArtificial intelligence and machine learning · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 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.

Theoretical computer science
2 papers
Logic in computer science · 100%
Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 50% Program synthesis and code generation · 50%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Logic in computer science › philosophical logic › non-classical logic
constructive logic
0.012004
An Arithmetical Hierarchy of the Law of Excluded Middle and Related Principles · LICS 2004
Logic in computer science
proof theory
0.012004
An Arithmetical Hierarchy of the Law of Excluded Middle and Related Principles · LICS 2004
Program synthesis and code generation › formal synthesis
program extraction
0.011994
Singleton, Union and Intersection Types for Program Extraction · Inf. Comput. 1994
Programming languages and type systems
type theory
0.011994
Singleton, Union and Intersection Types for Program Extraction · Inf. Comput. 1994
Logic in computer science
type theory
0.011994
Singleton, Union and Intersection Types for Program Extraction · Inf. Comput. 1994

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

program extraction · 0.0bound extraction · 0.0union types · 0.0singleton types · 0.0intersection types · 0.0
YearPublicationVenuePosition
2010 Games with 1-backtracking
Stefano Berardi, Thierry Coquand, Susumu Hayashi
Ann. Pure Appl. Log.3
2007 Can Proofs be Animated by Games?
Susumu Hayashi
Fundam. Informaticae1
2006 Mathematics based on incremental learning - Excluded middle and inductive inference
Susumu Hayashi
Theor. Comput. Sci.1
2004 An Arithmetical Hierarchy of the Law of Excluded Middle and Related Principles
abstract
The topic of this paper is relative constructivism. We are concerned with classifying nonconstructive principles from the constructive viewpoint. We compare, up to provability in intuitionistic arithmetic, subclassical principles like Markov's principle, (a function-free version of) weak Konig's lemma, Post's theorem, excluded middle for simply existential and simply universal statements, and many others. Our motivations are rooted in the experience of one of the authors with an extended program extraction and of another author with bound extraction from classical proofs.
Yohji Akama, Stefano Berardi, Susumu Hayashi, Ulrich Kohlenbach
LICS3
2002 Mathematics Based on Learning
Susumu Hayashi
ALT1
2002 Mathematics Based on Learning
Susumu Hayashi
Discovery Science1
2002 Towards the animation of proofs - testing proofs by examples
Susumu Hayashi, Ryosuke Sumitomo, Ken-ichiro Shii
Theor. Comput. Sci.1
1994 Singleton, Union and Intersection Types for Program Extraction
Susumu Hayashi
Inf. Comput.1
1985 Adjunction of Semifunctors: Categorical Structures in Nonextensional Lambda Calculus
Susumu Hayashi
Theor. Comput. Sci.1