Susumu Hayashi

24 papers A* 1B 3Journal 6Unranked 14
YearRankTypeTitle / Venue / Authors
2014 — conf
The SMART-GS Project: An Approach to Image-based Digital Humanities.
DH
Yuta Hashimoto, Kenro Aihara, Susumu Hayashi, Minao Kukita, Makoto Ohura
2010 J jnl
Games with 1-backtracking.
Ann. Pure Appl. Log.
Stefano Berardi, Thierry Coquand, Susumu Hayashi
2010 — conf
Semantics of a Graphical Model for Representing Hypotheses and a System Supporting the Management of Hypotheses.
KICSS
Madori Ikeda, Masaaki Nishino, Koichiro Doi, Akihiro Yamamoto, Susumu Hayashi
2007 J jnl
Can Proofs be Animated by Games?
Fundam. Informaticae
Susumu Hayashi
2006 J jnl
Mathematics based on incremental learning - Excluded middle and inductive inference.
Theor. Comput. Sci.
Susumu Hayashi
2005 — conf
Can Proofs Be Animated By Games?
TLCA
Susumu Hayashi
2005 — conf
Games with 1-backtracking.
GALOP@ETAPS
Stefano Berardi, Thierry Coquand, Susumu Hayashi
2004 A* conf
An Arithmetical Hierarchy of the Law of Excluded Middle and Related Principles.
LICS
Yohji Akama, Stefano Berardi, Susumu Hayashi, Ulrich Kohlenbach
2004 — conf
Test Driven Development of UML Models with SMART Modeling System.
UML
Susumu Hayashi, Pan YiBing, Masami Sato, Kenji Mori, Sul Sejeon, Shuusuke Haruna
2002 B conf
Limit-Computable Mathematics and Its Applications.
CSL
Susumu Hayashi, Yohji Akama
2002 B conf
Mathematics Based on Learning.
ALT
Susumu Hayashi
2002 B conf
Mathematics Based on Learning.
Discovery Science
Susumu Hayashi
2002 J jnl
Towards the animation of proofs - testing proofs by examples.
Theor. Comput. Sci.
Susumu Hayashi, Ryosuke Sumitomo, Ken-ichiro Shii
2000 — conf
Towards Limit Computable Mathematics.
TYPES
Susumu Hayashi, Masahiro Nakata
1998 — conf
Testing Proofs by Examples.
ASIAN
Susumu Hayashi, Ryosuke Sumitomo
1996 — conf
Constructive Programming: A Personal View.
DMTCS
Susumu Hayashi
1996 — conf
Two Extensions of PX system.
Linear Logic Tokyo Meeting
Susumu Hayashi, Masakazu Ishikawa, Satoshi Kobayashi, Hiroshi Nakano, Syuichi Nakazaki
1994 — conf
A Functional System with Transfinitely Defined Types.
Logic, Language and Computation
Mariko Yasugi, Susumu Hayashi
1994 — conf
Lifschitz' Logic of Calcubable Numbers and Optimizations in Program Extraction.
Logic, Language and Computation
Susumu Hayashi, Yukihide Takayama
1994 J jnl
Singleton, Union and Intersection Types for Program Extraction
Inf. Comput.
Susumu Hayashi
1993 — conf
Logic of Refinement Types.
TYPES
Susumu Hayashi
1991 — conf
Singleton, Union and Intersection Types for Program Extraction.
TACS
Susumu Hayashi
1987 — conf
PX: a system extracting programs from proofs.
Formal Description of Programming Concepts
Susumu Hayashi
1985 J jnl
Adjunction of Semifunctors: Categorical Structures in Nonextensional Lambda Calculus.
Theor. Comput. Sci.
Susumu Hayashi