Journal ArticleDOI
Syntactic properties of the refal language
Reads0
Chats0
TLDR
Syntactic properties of this language REFAL, one of the languages created for symbolic manipulation, are formally investigated.Abstract:
A programming language REFAL is one of the languages created for symbolic manipulation. It is implemented on various computers. Syntactic properties of this language are formally investigated in this paper.read more
Citations
More filters
The Maxima Book
TL;DR: In this article, the Maxima-mode is installed on the Emacs interface and the Xmaxima mode is used to communicate with the terminal and the Emaxima mode to express the kill command.
References
More filters
Journal ArticleDOI
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs
TL;DR: A new class of computing systems uses the functional programming style both in its programming language and in its state transition rules; these systems have semantics loosely coupled to states—only one state transition occurs per major computation.
Journal ArticleDOI
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems
TL;DR: This paper gives new results, and presents old ones, concerning ChurchRosser theorems for rewrmng systems, depending solely on axioms for a binary relatton called reduction, and how these criteria yield new methods for the mechanizaUon of equattonal theories.
Proceedings ArticleDOI
Conflunt reductions: Abstract properties and applications to term rewriting systems
TL;DR: This paper gives new results, and presents old ones in a unified formalism, concerning Church-Rosser theorems for rewriting systems, and shows how these results yield efficient methods for the mechanization of equational theories.
Journal ArticleDOI
Tree-Manipulating Systems and Church-Rosser Theorems
TL;DR: It is shown that recursively defined functions are single-valued despite the nondeterminism of the evaluation algorithm and that these functions solve their defining equations in a “canonical” manner.