Подписаться
Dmitri Boulytchev
Dmitri Boulytchev
Associate Professor of Computer Science, Saint-Petersburg State University
Подтвержден адрес электронной почты в домене math.spbu.ru - Главная страница
Название
Процитировано
Процитировано
Год
Typed embedding of a relational language in OCaml
D Kosarev, D Boulytchev
arXiv preprint arXiv:1805.11006, 2018
352018
Typed relational conversion
P Lozov, A Vyatkin, D Boulytchev
Trends in Functional Programming: 18th International Symposium, TFP 2017 …, 2018
192018
Relational interpreters for search problems
P Lozov, E Verbitskaia, D Boulytchev
Relational Programming Workshop, 43, 2019
152019
Hardware description language based on message passing and implicit pipelining
D Boulytchev, O Medvedev
2010 East-West Design & Test Symposium (EWDTS), 438-441, 2010
152010
Certified semantics for minikanren
D Rozplokhas, A Vyatkin, D Boulytchev
Proceedings of the 2019 miniKanren and Relational Programming Workshop, 80-98, 2019
132019
On project-specific languages and their application in reengineering
D Boulychev, D Koznov, AA Terekhov
Proceedings of the Sixth European Conference on Software Maintenance and …, 2002
132002
Relational synthesis for pattern matching
D Kosarev, P Lozov, D Boulytchev
Asian Symposium on Programming Languages and Systems, 293-310, 2020
122020
Improving refutational completeness of relational search via divergence test
D Rozplokhas, D Boulytchev
Proceedings of the 20th International Symposium on Principles and Practice …, 2018
102018
Certified semantics for relational programming
D Rozplokhas, A Vyatkin, D Boulytchev
Asian Symposium on Programming Languages and Systems, 167-185, 2020
92020
Combinators and type-driven transformers in objective caml
D Boulytchev
Science of Computer Programming 114, 57-73, 2015
92015
An empirical study of retargetable compilers
D Boulytchev, D Lomov
International Andrei Ershov Memorial Conference on Perspectives of System …, 2001
92001
Polynomial-Time Optimal Pretty-Printing Combinators with Choice
A Podkopaev, D Boulytchev
Perspectives of System Informatics: 9th International Ershov Informatics …, 2015
82015
BURS-based instruction set selection
D Boulytchev
International Andrei Ershov Memorial Conference on Perspectives of System …, 2006
82006
An Empirical Study of Partial Deduction for miniKanren
E Verbitskaia, D Berezun, D Boulytchev
arXiv preprint arXiv:2109.02814, 2021
72021
Reimplementing the Wheel: Teaching Compilers with a Small Self-Contained One
D Berezun, D Boulytchev
arXiv preprint arXiv:2207.12698, 2022
42022
Fair decision making via automated repair of decision trees
J Zhang, I Beschastnikh, S Mechtaev, A Roychoudhury
Proceedings of the 2nd International Workshop on Equitable Data and …, 2022
42022
Efficient fair conjunction for structurally-recursive relations
P Lozov, D Boulytchev
Proceedings of the 2021 ACM SIGPLAN Workshop on Partial Evaluation and …, 2021
42021
Scheduling Complexity of Interleaving Search
D Rozplokhas, D Boulytchev
International Symposium on Functional and Logic Programming, 152-170, 2022
32022
On Fair Relational Conjunction
P Lozov, D Boulytchev
Proceedings of the 2020 miniKanren and Relational Programming Workshop (2020 …, 2020
32020
Precise garbage collection for C++ with a non-cooperative compiler
D Berezun, D Boulytchev
Proceedings of the 10th Central and Eastern European Software Engineering …, 2014
32014
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20