معرفی
Naoki Yamamoto is an Assistant Professor (non-tenure lecturer) at Waseda University's School of Fundamental Science and Engineering, Department of Computer Science and Engineering since April 2025. He also holds a part-time lecturer position at the University of Tokyo's College of Arts and Sciences (Junior Division) since October 2025. Previously, he served as a Research Associate at Waseda University from April 2022 to March 2025. He received his Doctor of Engineering from Waseda University in March 2025, following his Master of Engineering (2021) and Bachelor of Engineering (2019) from the same institution.
Dr. Yamamoto's educational background is impressive, having earned his Bachelor's, Master's, and Doctoral degrees consecutively from Waseda University's School of Fundamental Science and Engineering. During his doctoral studies under Professor Kazunori Ueda, he focused on advanced topics in programming languages and graph theory. He was awarded the Outstanding Student Award (Dean's Award) from Waseda University in March 2019.
His research interests center around graph-based programming language theory, with particular expertise in Graph Pattern Matching, Static Type Checking for complex data structures, and Graph Rewriting Languages. He has developed innovative approaches to handling graph structures that go beyond traditional algebraic data types like lists and trees. His work bridges theoretical computer science with practical implementation, focusing on how to safely manipulate complex graph structures in programming languages.
His publication record demonstrates consistent advancement in graph-based type systems. Starting with foundational work on static type checking for graph operations (2019), he progressed to handling numeric constraints (2020), extending type expression power (2022), and developing grammar-based approaches for difference data structures (2024). His research shows a clear trajectory from theoretical foundations to practical applications, with increasing sophistication in handling complex graph structures. His work on LMNtal ShapeType represents a significant contribution to the field of graph rewriting languages.
- Outstanding Student Award (Dean's Award), Waseda University (2019)
Dr. Yamamoto has been actively involved in teaching and research supervision, having served as a Teaching Assistant for 14 courses between 2018-2021. He currently teaches Introduction to C Programming and C Application Development at Waseda University, and Introduction to Algorithms at the University of Tokyo. He has received research funding through the Japan Society for the Promotion of Science Grants-in-Aid for Scientific Research, collaborating with Professor Kazunori Ueda on projects related to high-level languages with powerful data structures and concurrency.
As a member of Ueda Laboratory at Waseda University, Dr. Yamamoto has contributed to the development of tools like Lambda Friends, a web-based interpreter for lambda calculus written in TypeScript. His research group focuses on advancing programming language theory, particularly in the areas of graph rewriting and type systems, with applications in both programming languages and modeling languages. His work demonstrates how graph rewriting languages can unify program execution and model checking functionalities while guaranteeing well-formedness of graph structures.
