SaC: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "implementation languages" to "implementation language ") |
No edit summary |
||
| Line 1: | Line 1: | ||
{{Infobox array language | {{Infobox array language | ||
| logo = [[File:SaC logo.png]] | |||
| array model = [[Flat array model|flat]] statically typed | | array model = [[Flat array model|flat]] statically typed | ||
| index origin = 0 | | index origin = 0 | ||
Latest revision as of 17:52, 9 November 2021
SaC or SAC (Single Assignment C) is a statically typed functional programming language developed with the goal of offering high-performance array programming through a compiler with C or FORTRAN-like syntax. Like APL, all data is contained in (possibly scalar) arrays. Arrays are considered equivalent to nested lists as in leading axis theory but, because these lists must have homogeneous length and type, true array nesting is not possible. The authors have used SaC to compile APL programs and found it to be faster than APL+Win on several test programs.[1]
References
- ↑ Clemens Grelck and Sven-Bodo Scholz. Accelerating APL programs with SAC at APL99.
External links
| APL dialects [edit] | |
|---|---|
| Maintained | APL+Win ∙ APL2 ∙ APL64 ∙ APL\iv ∙ Aplette ∙ April ∙ Co-dfns ∙ Dyalog APL ∙ Dyalog APL Vision ∙ dzaima/APL ∙ GNU APL ∙ Kap ∙ NARS2000 ∙ Pometo ∙ TinyAPL |
| Historical | A Programming Language ∙ A+ (A) ∙ APL# ∙ APL2C ∙ APL\360 ∙ APL/700 ∙ APL\1130 ∙ APL\3000 ∙ APL.68000 ∙ APL*PLUS ∙ APL.jl ∙ APL.SV ∙ APLX ∙ Extended Dyalog APL ∙ Iverson notation ∙ IVSYS/7090 ∙ NARS ∙ ngn/apl ∙ openAPL ∙ Operators and Functions ∙ PAT ∙ Rowan ∙ SAX ∙ SHARP APL ∙ Rationalized APL ∙ VisualAPL (APLNext) ∙ VS APL ∙ York APL |
| Derivatives | AHPL ∙ BQN ∙ CoSy ∙ ELI ∙ Glee ∙ I ∙ Ivy ∙ J ∙ Jelly ∙ K (Goal, Klong, Q) ∙ KamilaLisp ∙ Lang5 ∙ Lil ∙ Nial ∙ RAD ∙ Uiua |
| Overviews | Comparison of APL dialects ∙ Timeline of array languages ∙ Timeline of influential array languages ∙ Family tree of array languages |