ACM

Communications of the ACM

Home/Magazine Archive/August 1965 (Vol. 8, No. 8)/Symbolic derivatives without list processing, subroutines.../Abstract

Symbolic derivatives without list processing, subroutines, or recursion

By Peter J. Smith
Communications of the ACM, August 1965, Vol. 8 No. 8, Pages 494-496
10.1145/365474.365504
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

A routine has been developed which computes and prints out the symbolic derivative of an absolutely continuous elementary function of one or several variables. No use is made of list processing languages. The chain rule is applied and the result is edited to produce results as elegant and efficient as those obtained by hand computation. A subset may be imbedded in a formula translator to introduce a differentiation operator into an “algebraic” programming language.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.