Syntactic properties of the refal language

DOI10.1080/00207168508803455MaRDI QIDQ3709892zbMATH OpenOpenAlexFDO

Authors

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)

Recommendations

• Formalization of the semantics of the language Refal
• Parallel symbolic processing in REFAL
• scientific article; zbMATH DE number 1923041
• scientific article; zbMATH DE number 3911681
• scientific article; zbMATH DE number 1533832

Cites work

• Can programming be liberated from the von Neumann style?
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• scientific article; zbMATH DE number 3651027 (Why is no real title available?)
• Tree-Manipulating Systems and Church-Rosser Theorems

Cited in

(2)

• Formalization of the semantics of the language Refal
• Parallel symbolic processing in REFAL

Describes a project that uses

Uses Software

• REDUCE
• MACSYMA
• SNOBOL

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3709892)