Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Refal

Known as: Refal programming language 
Refal (Recursive functions algorithmic language) "is functional programming language oriented toward symbol manipulation", including "string… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
The paper deals with some aspects of metasystem transi- tions in the context of supercompilation. We consider the manifestations… Expand
  • figure 9
  • figure 10
Is this relevant?
2008
2008
Ануреев И. С. Операционно-онтологическая семантика обработки исключений // Тезисы докладов международной конференции «Космос, астрономия и программирование» (Лавровские чтения). СПб., 2008а. С. 15–22. Ануреев И. С. Операционно-онтологическая семантика операторов безусловной передачи управления в языке C# // Тезисы докладов международной конференции «Космос, астрономия и программирование» (Лавровские чтения). СПб., 2008б. С. 259–266. Гуревич Ю. Последовательные машины абстрактных состояний // «Формальные методы и модели информатики»: Сб. науч. тр. Серия «Системная информатика». Новосибирск: Изд-во СО РАН, 2004. Вып. 9. C. 7–50. Cодружество «РЕФАЛ / Суперкомпиляция». [Электронный ресурс]. Режим доступа: http://refal.net Anureev I. S. Ontological Transition Systems // Joint NCC&IIS Bull. Series: Computer Science. 2007. Iss. 26. P. 1–17. AsmL: The Abstract State Machine Language. – Reference Manual. 2002. [Электронный ресурс]. Режим доступа: http://research.microsoft.com/fse/asml/doc/AsmL2\_Reference.doc. Huggins J. Abstract State Machines Web Page. http://www.eecs.umich.edu/gasm. XasM An Extensible, Component-Based Abstract State Machines Language. [Электронный ресурс]. Режим доступа: http://xasm.sourceforge.net/XasmAnl00/XasmAnl00.html 
Is this relevant?
1996
1996
Turchin`s supercompiler is a program transformer that includes both partial evaluation and deforestation. Although known in the… Expand
Is this relevant?
1994
1994
Our aim is to study how the interpretive approach — inserting an interpreter between a source program and a program specializer… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We introduce the notion of a perfect process tree as a model for the full propagation of information in metacomputation. Starting… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 7
Is this relevant?
1991
1991
The problems of constmcting an inverse function definition from definition of a direct one are considered. The suggested approach… Expand
Is this relevant?
Highly Cited
1986
Highly Cited
1986
A supercompiler is a program transformer of a certain type. It traces the possible generalized histories of computation by the… Expand
  • figure 1
Is this relevant?
1982
1982
In this paper we present and discuss some examples of the operation of the first experimental model of a supercompiler. We have… Expand
Is this relevant?
1979
1979
7he 5y5tem t06e de5cr16ed 1n th15 n0t1ce a1m5 t0 fac111tate the creat10n and 1mp1ementat10n 0f 5pec1a112ed a190r1thm1ca11an9ua9e5… Expand
Is this relevant?
1969
1969
SummaryFrom the authors' point of view, REFAL, as well as the more general meta-algorithmic language, is very convenient for… Expand
Is this relevant?