5th Valentin Turchin Workshop on Metacomputation META 2016

CALL FOR PAPERS

META 2016
Fifth International Valentin Turchin Workshop on Metacomputation

Pereslavl - Zalessky, Russia
June 27 - July 1,  2016
http://meta2016.pereslavl.ru

==============================**==============================**==

4th Valentin Turchin Workshop on Metacomputation META 2014

CALL FOR PAPERS

META 2014
Fifth International Valentin Turchin Workshop on Metacomputation

Pereslavl - Zalessky, Russia
June 29 - July 3,  2014
http://meta2014.pereslavl.ru

==============================**==============================**==

4th Workshop on Reversible Computation (RC 2012)

META-2012

META 2012
*Third International Valentin Turchin Workshop on Metacomputation*

*EXTENDED submission deadline: March 26, 2012*

July 5-9, 2012, Pereslavl-Zalessky, Russia
http://meta2012.pereslavl.ru

The Third International Valentin Turchin Workshop on Metacomputation
(META 2012) aims to bring together researchers working in the areas of
program analysis and program manipulation based on metacomputation, in
particular, supercompilation, partial evaluation, distillation, mixed
computation, generalized partial computation, slicing, verification, and
cross-fertilization with other modern research and development directions.

The workshop is devoted to the memory of Valentin
Turchin<http://pcp.lanl.gov/TURCHIN.html>(1931-2010).

The workshop will be held in July 5-9, 2012, in an ancient Russian city
Pereslavl-Zalessky, on the bank of Pleschcheevo lake, in Ailamazyan Program
Systems Institute <http://skif.pereslavl.ru/psi-info/index.en.html> of the
Russian Academy of Sciences.
Pereslavl-Zalessky<http://www.botik.ru:8101/PZ/PZ.html>belongs to the
Golden Ring of the historical sites of Russia.

The previous workshops in this series were META
2008<http://meta2008.pereslavl.ru/>and META
2010 <http://meta2010.pereslavl.ru/>.

*Topics of interest* include, but are not limited to:

   - Distillation
   - Generalized partial computation
   - Mixed computation
   - Partial evaluation
   - Program inversion
   - Program slicing
   - Program verification techniques including theorem proving and testing
   - Supercompilation
   - Techniques that treat programs/models as data objects
   - Tool descriptions, case studies, tutorials, surveys and problem
   statements on these topics

*Important Dates*

   - *March 26, 2012: submission deadline (extended)*
   - April 20, 2012: notification of acceptance
   - May 14, 2012: camera-ready version for pre-proceedings

   - July 4, 2012: arrival
   - July 5-9, 2012: workshop
   - July 10, 2012: departure
[.....]

Email: meta2012@u.pereslavl.ru
Web: http://meta2012.pereslavl.ru

Refal-SciTE

Dear collegues!

Allow me to present you a graphical interface for Refal language, namely for its canonical
Refal-5 version for Windows platform (95/98/ME/NT/2000/XP).
There are some more details in my site
http://www.refal.net/~belous/ (mirror http://www.refal.org/~belous/ ) .

Refal implementations had appeared in the time of  DOS and command line mode. Unforutnately, up to present moment Refal systems installation and interface remained at former archaic level.

But luckily for us, today we must not make a fresh start and invent the bike for solving this nontrivial problem. I hope that my developed solution will make possible to propose and demonstrate advantages of Refal for users of any qualification.

As regards to resourse requirements, the fact is worthy of respect that Refal-SciTE distributive occupies less than a half of floppy disk. But the other fact that all this staff can be installed in clean floppy disk and works successfully (checked up on!) was a good surprise for me.

I'll be appreciate you for any comments and suggestions.

With best regards
-- Leonid Belous

Refal-PHP System

Seminar on Metacomputation

Hello!

On Tuesday, February 12, 17:00, in 1305 lecture-hall of main building, Mechanics and Mathematics Department of MSU, the next meeting of Seminar on Metacomputation will take place. 

1. Arkady Klimov, Methods of cycles construction with examples from cupercompilation of J.Clark XSLT, XT language interpreter.

   There will be represented both present rules of cycling in Java Supercompiler, JScp,  (including just recently implemented ones), and ideas, which arised in process of "hot" experiments on XSLT interpreter. We call the "fresh brains" to oppose us and to generate new ideas!

   Report scheme:

   1. Cycling methods

      UnfoldLoopEmpty	-ul1,-ule
      UnfoldLoopLinear	-ul2,-ull
      UnfoldLoopNoBreak	-ul3,-ulnb
      UnfoldLoopNoRegularBreak	-ul4,-ulnrb
      UnfoldLoopNoInclusion	-ul5,-ulni

   2. The case of insufficiently aggressive -ulnrb
   3. The case of too aggressive -ulnrb
   4. Окрестностный analysis
   5. ОА using for to increase (decrease) aggression -ulni
   6. Improving of ОА: method of holding окрестности
   7. Example from XT (++position)
   8. Example of stack with array and filling up pointer
   9. Supercompilation and Intentional Programming
       
2. Sergey Fattakhov and Andrey Klimov, The attempt of specialization of visualization program, ray tracer-а, on given scene.

   Last week we managed to specialize graphic render on scene. The program of  "independent author" have been taken from Internet: see 5th example (Raytracer) at page
   http://www.smiley-face.freeserve.co.uk/programming/
   But only twofold acceleration have been obtained for the present.

   On given example we shall discuss:

   • what means "to specialize successfully"?
   • what problems arise and how they have to be overcome while "pushing" of programs "through" JScp, for to get a reasonable specialization?
   • what result is expected and why it isn't achieved still?
   • what else have to be done in this example and in compiler improving?

Andrey Klimov.

Seminar on Metacomputation

Речь идет об описании отношения между входом и выходом суперкомпилятора без фиксации алгоритмов конфигурационного анализа. Отношение задается исчислением на языке Natural Semantics [1], популярным в современной computer science формализмом описания "операционной семантики" (по Г.Плоткину [2]).

Первая лекция начнется с введения в денотационную и операционную семантики на примере модельного языка, близкого к знакомому вам *SG. Будет дана спецификация его интерпретатора. (По-видимому, на этом первая лекция закончиться.) Потом (в январе) спецификация будет пошагово "надстроена" семантикой драйвинга и полного суперкомпилятора этого языка в разных вариантах: плоских--неплоский, ленивый--неленивый, и т.п.

На слайдах будет представлен материал работы [3], устно доложенной 6 лет назад на семинаре в Германии, но еще не опубликованной.

1. Gilles Kahn, "Natural Semantics", Proceedings of the Symposium on Theoretical Aspects of Computer Science (STACS), Springer-Verlag, 1987, Lecture Notes in Computer Science, 247, pp. 22--39.
2. www.dcs.ed.ac.uk/home/gdp/
3. Andrei V. Klimov, "A specification of a class of supercompilers", in Draft Proceedings of the Dagstuhl Seminar on Partial Evaluation, WSI-96-6, p.232, Universitat Tubingen, Germany, 1996.

Андрей Климов.

Seminar on Java Supercompilation

• Теория метавычислений (рук. С.Абрамов)
• Суперкомпиляция Явы (рук. Анд.Климов)

Объявлен новый (второй) набор на дополнительное образование на мехмате по теоретической информатике (включающей метавычисления), http://mathinform.math.msu.su/. Следующий поток начнет учиться со второго семестра. Плата за образование заметно уменьшена. Передавайте эту информацию друзьям и знакомым, присылайте молодежь.

 

С вопросами обращайтесь к Андрею Чеповскому (Andrei.Chepovsky@supercompilers.com).

Новости

Автор

История

Документация

Приложения 

Форумы

Рефал-сайты