Skip to search formSkip to main contentSkip to account menu

Refal

Known as: Refal programming language 
Refal (Recursive functions algorithmic language) "is functional programming language oriented toward symbol manipulation", including "string… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
  • S. Grechanik
  • 2014
  • Corpus ID: 17363768
The present paper shows how the idea of equality saturation can be used to build an inductive prover for a non-total first-order… 
2014
2014
Basic algebraic notions are introduced which can be used to describe and to transform program-data complexes for traditional… 
2014
2014
The paper presents two examples of non-traditional uses of program specialization by Turchin’s supercompilation method. In both… 
2012
2012
The paper explains the principles of multi-result supercom- pilation. We introduce a formalism for representing supercompilation… 
2009
2009
class Term case class Var(name: String) extends Term case class CFG(kind: TKind.Value, name: String, args: List[Term]) extends… 
2009
2009
class Term case class Var(name: String) extends Term case class CFG(kind: TKind.Value, name: String, args: List[Term]) extends… 
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 
1997
1997
Supercompilation is a method for program specialization. It has been developed in the context of functional languages. We present… 
1985
1985
A programming language REFAL is one of the languages created for symbolic manipulation. It is implemented on various computers… 
1969
1969
SummaryFrom the authors' point of view, REFAL, as well as the more general meta-algorithmic language, is very convenient for…