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

DOI10.1016/0743-1066(88)90011-8zbMath0645.68040OpenAlexW2039504742MaRDI QIDQ3789059

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

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)

Related Items (2)

LOGIC DERIVATION OF PARALLEL LINEAR EQUATION SYSTEM SOLVERS WITHIN ELIMINATION STRATEGY ⋮ 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