| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| MSS, SS | 2023-01-11 13:30 |
Osaka | (Primary: On-site, Secondary: Online) |
A formal description of a functional language with exception handling, and constrained dependency pairs for the termination proofs Takeshi Hamaguchi, Masahiko Sakai (Nagoya Univ.)  MSS2022-56 SS2022-41 |
This paper proposes a termination-proof method for functional programs with exception handling. First, we give a small s... [more] | MSS2022-56 SS2022-41 pp.66-71 |
| IT | 2022-07-21 14:55 |
Okayama | Okayama University of Science (Primary: On-site, Secondary: Online) |
A Data Compression Method Where The Codeword Is a Computer Program Generating The Data Mitsuharu Arimura (Shonan Inst. Tech.) IT2022-19 |
The Kolmogorov complexity of a string is defined as the shortest length of the program on a Turing machine used to repre... [more] | IT2022-19 pp.18-23 |
| SS | 2019-03-05 15:25 |
Okinawa | Automatic Repair of Conditional Expressions for Functional Programs by Using Counterexamples Ken Matsui, Ryosuke Sato, Naoyasu Ubayashi, Yasutaka Kamei (Kyushu Univ.) SS2018-80 |
In software development, manual bug fixing consumes much time and effort. Therefore, automated program repair methods ha... [more] | SS2018-80 pp.169-174 |
|
| KBSE, SS, IPSJ-SE [detail] | 2018-07-19 16:55 |
Hokkaido | Concurrent Execution Semantics of the Functional Programming Language in Continuation Passing Style Based on the Actor Model Nagisa Kojima, Kazuyuki Shima, Akio Nakata (Hiroshima City Univ.) SS2018-14 KBSE2018-24 |
In our study so far, we have proposed the notation which expresses lambda calculus in Continuation-Passing Style (CPS) s... [more] | SS2018-14 KBSE2018-24 pp.161-166 |
|
| SS, DC | 2017-10-19 14:45 |
Kochi | Kochi City Culture-plaza CUL-PORT | Towards a behavioral model of Yampa programs in a discrete runtime environment Tomoki Ichihashi, Shouji Yuuen (Nagoya Univ.) SS2017-24 DC2017-23 |
We propse an operational model for discrete executions of Yampa programs whose behavior are defined in the dense time. Y... [more] | SS2017-24 DC2017-23 pp.19-24 |
| KBSE, SS, IPSJ-SE [detail] | 2016-07-14 13:10 |
Hokkaido | A Behavioral Model for Executing Yampa Programs Tomoki Ichihashi, Yuuen Shouji (Nagoya Univ.) SS2016-11 KBSE2016-17 |
In this paper, we propose differences-embedded automata as a behavioral model of Yampa programs which is a domain-specif... [more] | SS2016-11 KBSE2016-17 pp.99-104 |
|
| SWIM | 2016-02-26 13:05 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Learning Support Environment for Functional Programming using Swift Language Yuiitsu Aoki, Hiroki Suguri (Miyagi Univ.) SWIM2015-21 |
We have designed, developed and evaluated a learning support system for functional programming using web browser as user... [more] | SWIM2015-21 pp.17-22 |
| MSS, SS | 2015-01-26 17:45 |
Tottori | Implementing a Conditional Dependency Pair Method for Proving Termination of Functional Programs with Exception Handling Koichi Ota, Takeshi Hamaguchi, Masahiko Sakai (Nagoya Univ.), Akihisa Yamada (AIST), Naoki Nishida, Toshiki Sakabe (Nagoya Univ.) MSS2014-78 SS2014-42 |
In this paper, we discuss implementation of the conditional dependency pair method for proving termination of functional... [more] | MSS2014-78 SS2014-42 pp.55-60 |
|
| SS, KBSE | 2013-07-26 09:30 |
Hokkaido | Conditional Dependency Pair Method for Proving Termination of Functional Programs with Exception Handling Takeshi Hamaguchi, Masahiko Sakai (Nagoya Univ.) SS2013-23 KBSE2013-23 |
We have recently proposed a method for proving termination/non-termination properties of eager-evaluation-based function... [more] | SS2013-23 KBSE2013-23 pp.61-66 |
|
| SS | 2012-05-11 11:15 |
Ehime | Ehime Univ. | Static Dependecy Pair Method in Rewriting Systems for Functional Programs with Product, Algebraic Data, and ML-Polymorphic Types Keiichirou Kusakari (Nagoya Univ.) SS2012-9 |
For simply-typed term rewriting systems (STRSs) and higher-order rewrite systems (HRSs) {\em \`a la} Nipkow, we propo... [more] |
SS2012-9 pp.49-54 |
| MBE, NC (Joint) |
2012-03-14 15:35 |
Tokyo | Tamagawa University | Development of an online support system for stroke knowledge education
-- A functional improvement suitable for junior high school students -- Shoko Tani (NCVC), Hiroshi Narazaki, Hiroshi Inada (Univ. of Hyogo), Takahiro Todo (HDU), Michiaki Iwata (NCVC), Toshinari Nakao, Kiyokazu Kawakami, Yoshiaki Takeno (C.A.N. System), Tatsuo Amano, Fumio Miyashita, Chiaki Yokota, Kazuo Minematsu, Kazuo Nakazawa (NCVC) MBE2011-119 |
In order to prevent stroke, we have developed an online system to support school-based programs for knowledge education.... [more] | MBE2011-119 pp.59-64 |
| SS | 2005-06-24 10:45 |
Nagano | Shinshu Univ. Ohta-Kokusai-Kinenkan | On Proving Termination of Simply-Typed Term Rewriting Systems Based on Strong Computability Keiichirou Kusakari, Takahiro Sakurai, Naoki Nishida, Masahiko Sakai, Toshiki Sakabe (Nagoya Univ.) |
Terminating functional programs are safe in execution, and valuable because their reduction relations are suitable for i... [more] | SS2005-21 pp.19-24 |
[Return to Top Page]