Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Satoshi Egi"'
Publikováno v:
New Generation Computing. 40:481-506
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe4afa77147ea1e352ea670ca1c2d08a
https://doi.org/10.1007/s00354-022-00177-z
https://doi.org/10.1007/s00354-022-00177-z
Autor:
Satoshi Egi
Publikováno v:
Programming
This paper demonstrates how pattern matching for non-free data types can make proofs intuitive.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a17247004094e8441637a08e7834297
https://doi.org/10.1145/3397537.3398481
https://doi.org/10.1145/3397537.3398481
Autor:
Yuichi Nishiwaki, Satoshi Egi
Throughout the history of functional programming, recursion has emerged as a natural method for describing loops in programs. However, there does often exist a substantial cognitive distance between the recursive definition and the simplest explanati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::607952b1b921d22ba534a5f52dfc042d
Autor:
Satoshi Egi, Yuichi Nishiwaki
Publikováno v:
Programming Languages and Systems ISBN: 9783030027674
Non-free data types are data types whose data have no canonical forms. For example, multisets are non-free data types because the multiset $\{a,b,b\}$ has two other equivalent but literally different forms $\{b,a,b\}$ and $\{b,b,a\}$. Pattern matchin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4f218d674ff2d95d6ce5bbfab06908bc
https://doi.org/10.1007/978-3-030-02768-1_1
https://doi.org/10.1007/978-3-030-02768-1_1