A type-coercion problem in computer algebra

DOI10.1007/3-540-57322-4_13MaRDI QIDQ4265397zbMATH OpenFDO

Authors Andreas Weber

Publication date 12 October 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57322-4_13

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• On coherence in computer algebra
• scientific article; zbMATH DE number 1263433
• A rewrite-based type discipline for a subset of computer algebra
• A type system for computer algebra

Cited in

(11)

• A rewrite-based type discipline for a subset of computer algebra
• On coherence in computer algebra
• A computer algebra system based on order-sorted algebra
• A type system for computer algebra
• Logic and dependent types in the Aldor computer algebra system
• scientific article; zbMATH DE number 4147499 (Why is no real title available?)
• scientific article; zbMATH DE number 1263433 (Why is no real title available?)
• Une réponse négative à la conjecture de E. Tronci pour les systèmes numériques typés
• Integrating computer algebra and reasoning through the type systems of Aldor
• scientific article; zbMATH DE number 1860751 (Why is no real title available?)
• View of computer algebra data from Coq

This page was built for publication: A type-coercion problem in computer algebra

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