Zobrazeno 1 - 10 of 12 pro vyhledávání: '"Sergei A. Romanenko"'
1
Synthesis of pure (ligandless) titanium nanoparticles by EB-PVD method
Autor: Stanislav Ð. . Litvin, Nadezhda Belyavina, Yaroslav Ðń. Stelmakh, Sergei M. Romanenko, Elena I. Oranskaya, Yurii A. Kurapov
Publikováno v: Journal of Nanoparticle Research. 23
Pure (ligandless) nanoparticles of titanium (4–20 nm) in a porous NaCl matrix (29–43 nm) were synthesized by the method of electron beam physical vapor deposition (EB-PVD). Independent electron beams were used to preheat the compacted cylinder fr
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::ac3e4deb7710403304673b510ce30261
https://doi.org/10.1007/s11051-020-05110-3
Zobrazit plný text záznamu
5
Supercompilation for Martin-Lof’s type theory
Autor: Sergei A. Romanenko, I G Klyuchnikov
Publikováno v: Programming and Computer Software. 41:170-182
This paper describes the design and implementation of a TT Lite certifying supercompiler, which transforms a source program into a pair consisting of a residual program and a proof that the residual program is equivalent to the source one. As far as
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::703a2c6ee535f6cbe42b9e0b0ece6c48
https://doi.org/10.1134/s0361768815030068
Zobrazit plný text záznamu
7
Higher-level supercompilation as a metasystem transition
Autor: I G Klyuchnikov, Sergei A. Romanenko
Publikováno v: Programming and Computer Software. 38:231-244
Issues related to metasystem transitions in the context of supercompilation are discussed. Manifestations of the law of branching growth of the penultimate level in the case of higher-level supercompilation are considered. Based on this law, some app
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::9fd86dfa54065bacf5504325684efc8b
https://doi.org/10.1134/s0361768812050027
Zobrazit plný text záznamu
8
Certifying Supercompilation for Martin-Löf’s Type Theory
Autor: Sergei A. Romanenko, I G Klyuchnikov
Publikováno v: Lecture Notes in Computer Science ISBN: 9783662468227
Ershov Memorial Conference
The paper describes the design and implementation of a certifying supercompiler TT Lite SC, which takes an input program and produces a residual program and a proof of the fact that the residual program is equivalent to the input one. As far as we ca
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::0b9a86513b1f372c90d269c88c218abf
https://doi.org/10.1007/978-3-662-46823-4_16
Zobrazit plný text záznamu
9
Multi-result Supercompilation as Branching Growth of the Penultimate Level in Metasystem Transitions
Autor: Sergei A. Romanenko, I G Klyuchnikov
Publikováno v: Perspectives of Systems Informatics ISBN: 9783642297083
Ershov Memorial Conference
The paper deals with some aspects of metasystem transitions in the context of supercompilation. We consider the manifestations of the law of branching growth of the penultimate level in the case of higher-level supercompilation and argue that this la
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::d15061e24f2b7513cbbdb8ac4762336b
https://doi.org/10.1007/978-3-642-29709-0_19
Zobrazit plný text záznamu
10
Proving the Equivalence of Higher-Order Terms by Means of Supercompilation
Autor: I G Klyuchnikov, Sergei A. Romanenko
Publikováno v: Perspectives of Systems Informatics ISBN: 9783642114854
Ershov Memorial Conference
One of the applications of supercompilation is proving properties of programs. We focus in this paper on a specific task: proving term equivalence for a higher-order lazy functional language. The “classical” way to prove equivalence of two terms
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::65e4f941fd6611a59afd948494526ebc
https://doi.org/10.1007/978-3-642-11486-1_17
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje