| 2007 |
| 19 | EE | Susumu Hayashi:
Can Proofs be Animated by Games?
Fundam. Inform. 77(4): 331-343 (2007) |
| 2006 |
| 18 | EE | Susumu Hayashi:
Mathematics based on incremental learning - Excluded middle and inductive inference.
Theor. Comput. Sci. 350(1): 125-139 (2006) |
| 2005 |
| 17 | | Stefano Berardi,
Thierry Coquand,
Susumu Hayashi:
Games with 1-backtracking.
GALOP 2005: 210-225 |
| 16 | EE | Susumu Hayashi:
Can Proofs Be Animated By Games?
TLCA 2005: 11-22 |
| 2004 |
| 15 | EE | Yohji Akama,
Stefano Berardi,
Susumu Hayashi,
Ulrich Kohlenbach:
An Arithmetical Hierarchy of the Law of Excluded Middle and Related Principles.
LICS 2004: 192-201 |
| 14 | EE | Susumu Hayashi,
Pan YiBing,
Masami Sato,
Kenji Mori,
Sul Sejeon,
Shuusuke Haruna:
Test Driven Development of UML Models with SMART Modeling System.
UML 2004: 395-409 |
| 2002 |
| 13 | EE | Susumu Hayashi:
Mathematics Based on Learning.
ALT 2002: 7-21 |
| 12 | EE | Susumu Hayashi,
Yohji Akama:
Limit-Computable Mathematics and Its Applications.
CSL 2002: 1 |
| 11 | EE | Susumu Hayashi:
Mathematics Based on Learning.
Discovery Science 2002: 1 |
| 10 | EE | Susumu Hayashi,
Ryosuke Sumitomo,
Ken-ichiro Shii:
Towards the animation of proofs - testing proofs by examples.
Theor. Comput. Sci. 272(1-2): 177-195 (2002) |
| 2000 |
| 9 | EE | Susumu Hayashi,
Masahiro Nakata:
Towards Limit Computable Mathematics.
TYPES 2000: 125-144 |
| 1998 |
| 8 | EE | Susumu Hayashi,
Ryosuke Sumitomo:
Testing Proofs by Examples.
ASIAN 1998: 1-3 |
| 1996 |
| 7 | EE | Susumu Hayashi,
Masakazu Ishikawa,
Satoshi Kobayashi,
Hiroshi Nakano,
Syuichi Nakazaki:
Two Extensions of PX system.
Electr. Notes Theor. Comput. Sci. 3: (1996) |
| 1994 |
| 6 | | Susumu Hayashi,
Yukihide Takayama:
Lifschitz' Logic of Calcubable Numbers and Optimizations in Program Extraction.
Logic, Language and Computation 1994: 1-9 |
| 5 | | Mariko Yasugi,
Susumu Hayashi:
A Functional System with Transfinitely Defined Types.
Logic, Language and Computation 1994: 31-60 |
| 4 | | Susumu Hayashi:
Singleton, Union and Intersection Types for Program Extraction
Inf. Comput. 109(1/2): 174-210 (1994) |
| 1993 |
| 3 | | Susumu Hayashi:
Logic of Refinement Types.
TYPES 1993: 108-126 |
| 1991 |
| 2 | | Susumu Hayashi:
Singleton, Union and Intersection Types for Program Extraction.
TACS 1991: 701-730 |
| 1985 |
| 1 | | Susumu Hayashi:
Adjunction of Semifunctors: Categorical Structures in Nonextensional Lambda Calculus.
Theor. Comput. Sci. 41: 95-104 (1985) |