Syntactic properties of the refal language

DOI10.1080/00207168508803455zbMath0585.68049OpenAlexW1977884821MaRDI QIDQ3709892

No author found.

Publication date: 1985

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168508803455

zbMATH Keywords

formal definitionfunctional programming language REFALsymbolic solutions of differential equations

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Uses Software

• SNOBOL
• Unnamed Item
• Unnamed Item

Cites Work

• Unnamed Item
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Can programming be liberated from the von Neumann style?
• Tree-Manipulating Systems and Church-Rosser Theorems

This page was built for publication: Syntactic properties of the refal language