Refal

Known as: Refal programming language

Refal (Recursive functions algorithmic language) "is functional programming language oriented toward symbol manipulation", including "string…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

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

Basic algebraic notions are introduced which can be used to describe and to transform program-data complexes for traditional…

2014

The paper presents two examples of non-traditional uses of program specialization by Turchin’s supercompilation method. In both…

2012

The paper explains the principles of multi-result supercom- pilation. We introduce a formalism for representing supercompilation…

2011

In this paper we propose a pose estimation algorithm based on Particle filtering which uses LED sightings gathered from wireless…

2009

class Term case class Var(name: String) extends Term case class CFG(kind: TKind.Value, name: String, args: List[Term]) extends…

2009

class Term case class Var(name: String) extends Term case class CFG(kind: TKind.Value, name: String, args: List[Term]) extends…

1997

Supercompilation is a method for program specialization. It has been developed in the context of functional languages. We present…

1985

A programming language REFAL is one of the languages created for symbolic manipulation. It is implemented on various computers…

1969

SummaryFrom the authors' point of view, REFAL, as well as the more general meta-algorithmic language, is very convenient for…