A technique for translating clausal specifications of numerical methods into efficient programs

DOI10.1016/0743-1066(88)90011-8zbMATH Open0645.68040OpenAlexW2039504742MaRDI QIDQ3789059FDOQ3789059

Authors: William F. Clocksin 

Publication date: 1988

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-1066(88)90011-8

Recommendations

• The automated transformation of abstract specifications of numerical algorithms into efficient array processor implementations
• The Tailoring of Abstract Functional Specifications of Numerical Algorithms for Sparse Data Structures through Automated Program Derivation and Transformation
• scientific article; zbMATH DE number 3958721
• Translation of algebraic programs into executable codes
• A structure-preserving clause form translation

zbMATH Keywords

fast Fourier transformmatrix equationsnumerical algorithmsseries approximationefficient computationsclausal specifications

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Theory of software (68N99) Algorithms in computer science (68W99) Computer aspects of numerical algorithms (65Yxx)

Cited In (3)

• LOGIC DERIVATION OF PARALLEL LINEAR EQUATION SYSTEM SOLVERS WITHIN ELIMINATION STRATEGY
• Title not available (Why is that?)
• Compiling bottom-up and mixed derivations into top-down executable logic programs

This page was built for publication: A technique for translating clausal specifications of numerical methods into efficient programs

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