Kap: Difference between revisions
No edit summary |
m (reference) |
||
| Line 13: | Line 13: | ||
| license = [[wikipedia:MIT License|MIT]] | | license = [[wikipedia:MIT License|MIT]] | ||
| website = [https://kapdemo.dhsdevelopments.com/ KAP] | | website = [https://kapdemo.dhsdevelopments.com/ KAP] | ||
| documentation = [https://kapdemo.dhsdevelopments.com/ | | documentation = [https://kapdemo.dhsdevelopments.com/reference.html KAP reference] | ||
| file ext = .kap | | file ext = .kap | ||
| influenced by = [[Dyalog APL]], [[GNU APL]], [[BQN]] | | influenced by = [[Dyalog APL]], [[GNU APL]], [[BQN]] | ||
| Line 27: | Line 27: | ||
== Differences from APL == | == Differences from APL == | ||
The following is a list of significant differences compared to APL: | The following is a list of significant differences compared to APL:<ref>Mårtenson, Elias. [https://kapdemo.dhsdevelopments.com/kap-comparison.html KAP for APL’ers]. Unversioned. Retrieved 2023-08-13.</ref> | ||
* Lazy evaluation | * Lazy evaluation | ||
| Line 35: | Line 35: | ||
* Native hash table support | * Native hash table support | ||
* Parallel evaluation (to take advantage of multi-core CPU's) | * Parallel evaluation (to take advantage of multi-core CPU's) | ||
== References == | |||
<references/> | |||
{{APL dialects}}[[Category:APL dialects]][[Category:Nested array languages]][[Category:Leading axis languages]] | {{APL dialects}}[[Category:APL dialects]][[Category:Nested array languages]][[Category:Leading axis languages]] | ||
Revision as of 08:43, 13 August 2023
KAP is an array-based language that aims to implement most of standard APL, along with additional features. Much of standard APL works in KAP, although if an APL feature does not fit with KAP's design, those features are changed or removed.
Lazy evaluation
The main difference compared to APL is that KAP is lazy-evaluated. This means that the language gives the developers very loose guarantees when (or if, and how many times) a function will actually be invoked. For example, ↑ f¨ ⍳10 will only make a single call to f because f¨ ⍳10 will not immediately evaluate the result but only return a delayed evaluation. Since all but the first result is then discarded, those results will never be computed.
Differences from APL
The following is a list of significant differences compared to APL:[1]
- Lazy evaluation
- First class functions
- Bignum support and rational arithmetic
- Ability to define custom syntax
- Native hash table support
- Parallel evaluation (to take advantage of multi-core CPU's)
References
- ↑ Mårtenson, Elias. KAP for APL’ers. Unversioned. Retrieved 2023-08-13.
| 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 |