skip to main content
article
Free access

A lisp-language Mathematica-to-lisp translator

Published: 01 April 1990 Publication History

Abstract

Wide distribution of the computer algebra system Mathematica has encouraged numerous programmers, researchers and educators to produce libraries of programs in its special language, for incorporation as "packages" into Mathematica systems. Although some features of the language are quite interesting, some authors have found that for their purposes the Mathematica proprietary computer program has problematical and difficult-to-alter semantics. Therefore certain kinds of experiments and developments are necessarily inconvenient. An initial step in opening up such user-written libraries to re-use is an independent re-implementation of the language via a non-proprietary parser. In principle, this allows other implementations of semantics, as well as experiments in data representation, while still using the language basically as described in the Mathematica references. We describe a parser written in Common Lisp, a language which is appropriate for three reasons: (1) It is a standard and has wide distribution; (2) It supports numerous useful features including automatic storage allocation and garbage collection, arbitrary-precision integers, and tools for lexical scanning of languages; and (3) Lisp is the host language for several algebraic manipulation systems whose subroutines may be of some interest for programmers implementing alternative semantics.

References

[1]
Roman Maeder, Programming in Mathematica, Addison-Wesley Publ. Co., Redwood City, CA., 1989.
[2]
Stephen Wolfram, Mathematica - A System for Doing Mathematics by Computer, Addison-Wesley Publ. Co., Redwood City, CA., 1988.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGSAM Bulletin
ACM SIGSAM Bulletin  Volume 24, Issue 2
April 1990
32 pages
ISSN:0163-5824
DOI:10.1145/1089419
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1990
Published in SIGSAM Volume 24, Issue 2

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)26
  • Downloads (Last 6 weeks)5
Reflects downloads up to 16 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2003)Comparing the speed of programs for sparse polynomial multiplicationACM SIGSAM Bulletin10.1145/844076.84408037:1(4-15)Online publication date: 1-Mar-2003
  • (1995)Evaluation of the heuristic polynomial GCDProceedings of the 1995 international symposium on Symbolic and algebraic computation10.1145/220346.220376(240-247)Online publication date: 1-Apr-1995
  • (1991)A rational function arithmetic and simplification system in common LispACM SIGSAM Bulletin10.1145/122508.12251025:4(4-6)Online publication date: 1-Oct-1991
  • (1991)A simple display package for polynomials and rational functions in common LispACM SIGSAM Bulletin10.1145/122508.12250925:4(1-3)Online publication date: 1-Oct-1991
  • (1991)The complexity of performance analysis in parallel algorithms and systems[1991] Proceedings, Advanced Computer Technology, Reliable Systems and Applications10.1109/CMPEUR.1991.257437(502-505)Online publication date: 1991

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media