Andrei Nemytykh
Andrei Nemytykh
Programming Automatization Laboratory
(AP),
Research Center for Multiprocessor
Systems,
Program Systems Institute,
of the Russian Academy of Science,
Pereslavl-Zalessky
M.Sc. in Mathematics awarded 1984, Moscow State University, the Department of Mathematics.
Since then, he is a researcher at the Program Systems Institute. Took part in several projects related to computer algebra, logic and functional programming languages. Currently he works on the supercompiler theory project guided by Professor V.F.Turchin (The City College of New York University, Department of Computer Science)
1. S.V.Chmutov, E.A.Gaydar, I.M.Ignatovich, V.F.Kozadoy, A.P.Nemytykh, V.A.Pinchuk, Implementation of the symbol analytic transformation language FLAC, Proceedings DISCO'90, Lecture Notes in Computer Science, 429 (1990) 276-277.
2. Turchin V.F., Nemytykh A.P. A Self-applicable Supercompiler. Technical Report, City College of CUNY. June, 1995, CSc. TR 95-010.
3. Turchin V.F., Nemytykh A.P. Metavariables: Their implementation and use in Program Transformation. Technical Report, City College of CUNY. June, 1995, CSc. TR 95-012.
4. Nemytykh A.P., Pinchuk V.A., Turchin V.F. A Self-Applicable Supercompiler. Partial Evaluation, Lecture Notes in Computer Science, 1110 (1996) 232-237.
5. Nemytykh A.P., Pinchuk V.A. Program Transformation with Metasystem Transitions: Experiments with a Supercompiler. Perspectives of System Informatics, Lecture Notes in Computer Science, 1181 (1996) 249-260.
7. Nemytykh A.P. Supercompiler Scp4: Use of Quasi-Distributive Laws in Program Transformation., In: Proceedings of International Software Engineering Symposium, Wuhan University Journal of Natural Sciences, Wuhan, China, Vol. 6, No. 1-2, (2001) 375-382.
6. Nemytykh A.P. A Note on Elimination of Simplest Recursions., In: Proceedings of ACM SIGPLAN Asia-PEPM'02, ACM Press, pp:138-146, September 2002, Aizu, Japan.