Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Roth, Ori"'
Autor:
Goldfriend, Tomer, Reichental, Israel, Naveh, Amir, Gazit, Lior, Yoran, Nadav, Alon, Ravid, Ur, Shmuel, Lahav, Shahak, Cornfeld, Eyal, Elazari, Avi, Emanuel, Peleg, Harpaz, Dor, Michaeli, Tal, Erez, Nati, Preminger, Lior, Shapira, Roman, Garcell, Erik Michael, Samimi, Or, Kisch, Sara, Hallel, Gil, Kishony, Gilad, van Wingerden, Vincent, Rosenbloom, Nathaniel A., Opher, Ori, Vax, Matan, Smoler, Ariel, Danzig, Tamuz, Schirman, Eden, Sella, Guy, Cohen, Ron, Garfunkel, Roi, Cohn, Tali, Rosemarin, Hanan, Hass, Ron, Jankiewicz, Klem, Gharra, Karam, Roth, Ori, Azar, Barak, Asban, Shahaf, Linkov, Natalia, Segman, Dror, Sahar, Ohad, Davidson, Niv, Minerbi, Nir, Naveh, Yehuda
We present a scalable, robust approach to creating quantum programs of arbitrary size and complexity. The approach is based on the true abstraction of the problem. The quantum program is expressed in terms of a high-level model together with constrai
Externí odkaz:
http://arxiv.org/abs/2412.07372
Autor:
Roth, Ori, Gil, Yossi
Fluent API is an object-oriented pattern for elegant APIs and embedded DSLs. A smart fluent API can enforce the API protocol or DSL syntax at compile time. As fluent API designs typically rely on function overloading, they are hard to realize in func
Externí odkaz:
http://arxiv.org/abs/2211.01473
Autor:
Roth, Ori
Grigore showed that Java generics are Turing complete by describing a reduction from Turing machines to Java subtyping. We apply Grigore's algorithm to Python type hints and deduce that they are Turing complete. In addition, we present an alternative
Externí odkaz:
http://arxiv.org/abs/2208.14755
Autor:
Roth, Ori
Publikováno v:
Proc. ACM Program. Lang. 5 (2021) 27 pages
This is a study of the computing power of the subtyping machine behind Kennedy and Pierce's nominal subtyping with variance. We depict the lattice of fragments of Kennedy and Pierce's type system and characterize their computing power in terms of reg
Externí odkaz:
http://arxiv.org/abs/2109.03950
Autor:
Gil, Joseph, Roth, Ori
We present a correspondence and bisimulation between variants of parametrically polymorphic type systems and variants of finite control automata, such as FSA, PDA, tree automata and Turing machine. Within this correspondence we show that two recent c
Externí odkaz:
http://arxiv.org/abs/2009.04437
Autor:
Roth, Ori
Grigore proved that Java generics are Turing complete by describing a reduction from Turing machines to Java subtyping. Furthermore, he demonstrated that his "subtyping machines" could have metaprogramming applications if not for their extremely high
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::599c7116b427465657d0aa1f48f84b2f
Autor:
Roth, Ori
The artifact comprises a Docker image (virtual environment) containing the source code and experiments setup mentioned in the paper. The artifact is available on Zenodo. The anonymous version submitted to the ECOOP Artifact Evaluation Committee (AEC)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::22103529bc913f46204a1a790d126247
Autor:
Roth, Ori
Treetop is a proof-of-concept C# fluent API generator for context-free protocols. Treetop accepts a context-free grammar, specifying an API protocol or a domain-specific language, and embeds it in C# as a fluent API. The resulting API enforces the gr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3597be9844e3684feca4d932fee1e76e
Autor:
Gil, Yossi, Roth, Ori
We present the first general and practical solution of the fluent API problem - an algorithm, that given a deterministic language (equivalently, LR(k), k >= 0 language) encodes it in an unbounded parametric polymorphism type system employing only a p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e5be89b8b86ccf30f40b6c48431f343