Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Eijiro Sumii"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 241, Iss Proc. ML/OCaml 2015, Pp 45-53 (2017)
We have implemented an optimization that specializes type-generic array accesses after inlining of polymorphic functions in the native-code OCaml compiler. Polymorphic array operations (read and write) in OCaml require runtime type dispatch because o
Externí odkaz:
https://doaj.org/article/aad4d6607ac545dcb3753236e8cb9682
Autor:
Akinori Abe, Eijiro Sumii
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 198, Iss Proc. ML/OCaml 2014, Pp 1-21 (2015)
Linear algebra is a major field of numerical computation and is widely applied. Most linear algebra libraries (in most programming languages) do not statically guarantee consistency of the dimensions of vectors and matrices, causing runtime errors. W
Externí odkaz:
https://doaj.org/article/19ebbd303aad42b5b9442bc00a348969
Autor:
Masayuki Mizuno, Eijiro Sumii
Publikováno v:
Programming Languages and Systems ISBN: 9783030341749
APLAS
APLAS
We present new proofs—formalized in the Coq proof assistant—of the correspondence among call-by-need and (various definitions of) call-by-name evaluations of \(\lambda \)-calculus with mutually recursive bindings.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::db89a5aaec81c16322bfb1e7e7062524
https://doi.org/10.1007/978-3-030-34175-6_10
https://doi.org/10.1007/978-3-030-34175-6_10
Autor:
Eijiro Sumii, Masayuki Mizuno
Publikováno v:
Functional and Logic Programming ISBN: 9783319906850
FLOPS
FLOPS
We formalize the call-by-need evaluation of \(\lambda \)-calculus (with no recursive bindings) and prove its correspondence with call-by-name, using the Coq proof assistant.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c158374d2161891577cea0b3901c9299
https://doi.org/10.1007/978-3-319-90686-7_1
https://doi.org/10.1007/978-3-319-90686-7_1
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 241, Iss Proc. ML/OCaml 2015, Pp 45-53 (2017)
We have implemented an optimization that specializes type-generic array accesses after inlining of polymorphic functions in the native-code OCaml compiler. Polymorphic array operations (read and write) in OCaml require runtime type dispatch because o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::520f22b3f055f23f18326d09bc8c2852
http://arxiv.org/abs/1702.02283
http://arxiv.org/abs/1702.02283
Autor:
Manabu Matsunaka, Yoko Shimpuku, Waka Nakanishi, Kazuyoshi Nishijima, Eijiro Sumii, Nina Yasuda, Mitsunobu R. Kano, Akihiro Kishimura, Chihiro Kato
Publikováno v:
TRENDS IN THE SCIENCES. 24:1_42-1_57
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5321c76338f9f3c91354576734bea664
https://doi.org/10.5363/tits.24.1_42
https://doi.org/10.5363/tits.24.1_42
Autor:
Michael Codish, Eijiro Sumii
Publikováno v:
Journal of Functional Programming. 26
The 12th International Symposium on Functional and Logic Programming was held in Kanazawa, Japan, June 4–6, 2014. The aim of the Functional and Logic Programming series of conferences is to bring together researchers interested in declarative progr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::16c4836a9f223a2eedcca62184cb8ca7
https://doi.org/10.1017/s0956796816000149
https://doi.org/10.1017/s0956796816000149
Autor:
Taichi Yachi, Eijiro Sumii
Publikováno v:
Programming Languages and Systems ISBN: 9783319479576
APLAS
APLAS
We develop a sound and complete proof method of contextual equivalence in \(\lambda \)-calculus with the abortive control operator call/cc (as opposed to delimited control operators like \(\mathtt {shift}\) and \(\mathtt {reset}\)), and prove the non
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef196d08948a3df87f001730605c5607
https://doi.org/10.1007/978-3-319-47958-3_10
https://doi.org/10.1007/978-3-319-47958-3_10
Publikováno v:
LICS
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulation proof method with “up-to context” techniques, and (2) obtaining d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::471558088b46dadbf1a1e9a41b9336f2
https://doi.org/10.1145/1889997.1890002
https://doi.org/10.1145/1889997.1890002
Autor:
Michael Codish, Eijiro Sumii
This book constitutes the refereed proceedings of the 12th International Symposium on Functional and Logic Programming, FLOPS 2014, held in Kanazawa, Japan, in June 2014. The 21 full papers and 3 invited talks presented in this volume were carefully