Symbolic Mathematical Computation 1965--1975: The View from a Half-Century Perspective

TL;DR

This paper provides a half‑century perspective on the formative period of symbolic computation up to 1975, foregrounding Sammet's influence and the genesis of SIGSAM and SYMSAC. It traces theoretical precursors (Gödel, Church–Turing) and early programming languages (IPL, FORTRAN, LISP, SNOBOL), along with pioneering algebra systems and differentiation efforts. It highlights key algorithmic milestones (elimination theory, $\mathrm{GCD}$, Gröbner bases concepts, and quantifier elimination) and documents the emergence of early CAS such as CAMAL, MACSYMA, and REDUCE, as well as their practical applications and constraints. Finally, it surveys the move toward modern times—textbooks, formal publication venues, and globally distributed CAS projects—while underscoring the historical lessons that continue to shape current symbolic‑computing research and practice.

Abstract

The 2025 ISSAC conference in Guanajuato, Mexico, marks the 50th event in this significant series, making it an ideal moment to reflect on the field's history. This paper reviews the formative years of symbolic computation up to 1975, fifty years ago. By revisiting a period unfamiliar to most current participants, this survey aims to shed light on once-pressing issues that are now largely resolved and to highlight how some of today's challenges were recognized earlier than expected.