-calculus as a realistic formalization of a class of rewriting systems
A new formalism of typed -calculus is offered as theoretical foundation for the construction of the special classes of programming systems based on rewriting rules. The formalism utilizes the ordered non-confluent sets of rewriting rules and interaction with programming environment that allows to e...
Збережено в:
| Дата: | 2025 |
|---|---|
| Автори: | , |
| Формат: | Стаття |
| Мова: | Russian |
| Опубліковано: |
PROBLEMS IN PROGRAMMING
2025
|
| Теми: | |
| Онлайн доступ: | https://pp.isofts.kiev.ua/index.php/ojs1/article/view/803 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Problems in programming |
| Завантажити файл: |  |
Репозитарії
Problems in programming| Резюме: | A new formalism of typed -calculus is offered as theoretical foundation for the construction of the special classes of programming systems based on rewriting rules. The formalism utilizes the ordered non-confluent sets of rewriting rules and interaction with programming environment that allows to extend possibilities of programming dynamic applications.Problems in programming 2011; 2: 3-11 |
|---|