Functional programming concepts and straight-line programs in computer algebra

DOI10.1016/S0378-4754(02)00035-6zbMath1005.68187OpenAlexW2002274904WikidataQ114850206 ScholiaQ114850206MaRDI QIDQ1849848

Yanyan Li

Publication date: 2 December 2002

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0378-4754(02)00035-6

zbMATH Keywords

computer algebra proceduresfunctional programmingMILONGA

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Functional programming and lambda calculus (68N18)

Related Items

A concise proof of the Kronecker polynomial system solver from scratch, MILONGA

Uses Software

• Dagwood
• FOXBOX
• Kronecker
• LiDIA
• Projective Noether
• Haskell
• GC

Cites Work

• Definability and fast quantifier elimination in algebraically closed fields
• Deforestation: Transforming programs to eliminate trees
• Computational methods of linear algebra
• Probabilistic algorithms for geometric elimination
• Lower bounds for diophantine approximations
• Straight-line programs in geometric elimination theory
• The Projective Noether Maple Package: Computing the dimension of a projective variety
• Polynomial algorithms in computer algebra
• Deformation techniques for efficient polynomial equation solving.
• Fast multiplication of large numbers
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Monadic parsing in Haskell
• Determinant: Old Algorithms, New Insights
• Dagwood
• Algebraic simplification
• On the time-space complexity of geometric elimination procedures
• A Gröbner free alternative for polynomial system solving
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item