Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
ET |
2024-01-20 15:05 |
Kyoto |
Kyoto University Yoshida Campus / Online (Primary: On-site, Secondary: Online) |
Learning Environment for Functional Programming with Focus on Application to Study Java Programming Kosuke Hotta, Yoshiki Sato (Tokyo Gakugei Univ.), Shoichi Nakamura (Fukushima Univ.), Youzou Miyadera (Tokyo Gakugei Univ.) ET2023-49 |
Functional programming is a programming paradigm with characteristics that are significantly different from procedural p... [more] |
ET2023-49 pp.24-31 |
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 |
DC, SS |
2018-10-04 15:50 |
Aichi |
Inuyama City Kokusai-Kanko Center Freud |
Yui Ihara, Nagisa Kojima, Kazuyuki Shima (Hiroshima City Univ.) SS2018-21 DC2018-22 |
(To be available after the conference date) [more] |
SS2018-21 DC2018-22 pp.19-24 |
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 |
SS |
2015-05-11 13:00 |
Kumamoto |
Kumamoto University |
Towards Applications of FRP in Small-Scale Embedded Systems Kensuke Sawada, Kouhei Suzuki, Takuo Watanabe (Tokyo Tech.) SS2015-1 |
In this paper, we show using examples that functional reactive programming (FRP) is beneficial for small-scale embedded ... [more] |
SS2015-1 pp.1-5 |
SWIM |
2011-06-17 16:25 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
Implementation of the Event-B models using Haskell Hitoshi Koshika, Yoshiyuki Shinkawa (Ryukoku Univ.) SWIM2011-7 |
Formal methods in early development stages are recognized more effective for quality and productivity of software, in co... [more] |
SWIM2011-7 pp.31-36 |
SS |
2009-08-07 09:30 |
Hokkaido |
Kitami Institute of Technology |
Automating Equivalence Partitioning in Test Case Generation with a Computer Algebra System Satoshi Hattori (Tokyo Inst. of Tech.) SS2009-24 |
We try to use a computer algebra system Mathematica as a test case generation system. In this paper, we deal with black-... [more] |
SS2009-24 pp.71-76 |
SS |
2007-06-22 10:10 |
Ishikawa |
JAIST |
Argument Filtering Method on Second-Order Rewriting System Yasuo Isogai, Keiichirou Kusakari, Masahiko Sakai, Toshiki Sakabe, Naoki Nishida (Nagoya Univ.) SS2007-13 |
Higher-order rewrite systems are computation models of functional programming languages, and the termination property is... [more] |
SS2007-13 pp.23-28 |
SS |
2006-04-20 16:10 |
Niigata |
Niigata Univ., Igarashi Campus |
Proving Termination of Higher-Order Rewrite Systems based on Strongly Computable Dependency Pair Method Yasuo Isogai, Keiichirou Kusakari, Masahiko Sakai, Toshiki Sakabe, Naoki Nishida (Nagoya Univ.) |
The higher-order rewrite systems (HRS for short) are a computation model of functional programming languages, and hence ... [more] |
SS2006-6 pp.31-36 |