A technique for solving a class of quadratic FP equations

DOI10.1016/0167-6423(92)90004-UMaRDI QIDQ1199835zbMATH OpenOpenAlexFDO

Authors Debasish Banerjee

Publication date 17 January 1993

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6423(92)90004-u

zbMATH Keywords

expansionsFP functional algebrafunctional programmingreasoning about programsrecursive programs

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 3970092
• Deriving some expansion theorems for nonlinear functional equations by an algorithm
• A methodology for synthesis of recursive functional programs
• scientific article; zbMATH DE number 4084981
• From implicit to recursive equations

Cited in

(3)

• An improved algorithm for quadratic equation classification and Petrov classification
• On the expansion of non-linear functions
• scientific article; zbMATH DE number 3970092 (Why is no real title available?)

This page was built for publication: A technique for solving a class of quadratic FP equations

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