Year: 1998
Type: conference-paper
Abstract: The paper investigates, how SAC, a purely functional language based on C syntax, relates to APL in terms of expressiveness and run-time behavior. To do so, three different excerpts of real world APL programs are examined. It is shown that after defining the required APL primitives in SAC, the example programs can be re-written in SAC with an almost one-to-one correspondence. Run-time comparisons between interpreting APL programs and compiled SAC programs show that speedups due to compilation vary between 2 and 500 for three representative benchmark programs.
Authors: Clemens Grelck, Sven-Bodo Scholz
Institution: Christian-Albrechts-Universität zu Kiel
Language: English
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
OpenAlex ID: W2042437306