Stackowey/Stackowasm
Jump to navigation
Jump to search
- Note: This article is intentionally left as a stub for now, as the details still need to be specified and the first proper publication of the definition already should be the complete and correct one. Details might change during implementation as issues are encountered, identified and resolved, meaning putting all details here before the implementation is complete would only cause headaches and mismatches. During implementation, focus will be on keeping Stackowasm from becoming overspecified.
| Paradigm(s) | Imperative |
|---|---|
| Designed by | User:Lampe2020 |
| Appeared in | 2026 |
| Type system | Typeless |
| Memory system | Stack-based |
| Computational class | Turing-complete (assumed so by the author, not yet proven; depends on whether Stackowey is) |
| Reference implementation | Unimplemented |
| Influenced by | Assembly |
| File extension(s) | .sws |
- Note: This page is only a subpage of the Stackowey page, because Stackowasm is not intended as an independent language but instead merely as a tool for working with Stackowey.
Stackowasm ["stäck-o-wazm"] is an assembly-like language designed to compile down to Stackowey.