Data update
This commit is contained in:
Ingy döt Net
parent
5af6d93694
commit
796d366b97
|
|
@ -17,6 +17,7 @@ A+: .a+
|
|||
AArch64 Assembly: .aarch64
|
||||
ABAP: .abap
|
||||
ACL2: .acl2
|
||||
Acornsoft Lisp: .lisp
|
||||
Action!: .action
|
||||
ActionScript: .as
|
||||
Acurity Architect: .acurity
|
||||
|
|
|
|||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Arithmetic-derivative/ALGOL-68
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Bulls-and-cows-Player/ALGOL-68
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Faulhabers-triangle/ALGOL-68
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Kronecker-product-based-fractals/ALGOL-68
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Arithmetic-numbers/APL
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Arithmetic-numbers/ARM-Assembly
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Miller-Rabin-primality-test/ARM-Assembly
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Primality-by-trial-division/ARM-Assembly
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Sequence-of-primes-by-trial-division/ARM-Assembly
|
||||
|
|
@ -0,0 +1,17 @@
|
|||
{{language|Acornsoft Lisp
|
||||
|exec=interpreted
|
||||
|parampass=value
|
||||
|safety=safe
|
||||
|checking=dynamic
|
||||
|gc=yes}}
|
||||
{{language programming paradigm|functional}}
|
||||
{{language programming paradigm|procedural}}
|
||||
{{implementation|Lisp}}
|
||||
|
||||
'''Acornsoft Lisp''' is a dialect and implementation of [[derived from::Lisp]] developed in the early 1980s for the [[wp:BBC_Micro|BBC Micro]] and related machines.
|
||||
|
||||
In the original, 1980s version, all built-in defined names were in upper case; however, versions that use lower case instead have become available.
|
||||
|
||||
==References==
|
||||
* Arthur Norman and Gillian Cattell, ''LISP on the BBC Microcomputer''
|
||||
* [[wp:Acornsoft_LISP|Wikipedia:Acornsoft Lisp]]
|
||||
|
|
@ -0,0 +1,2 @@
|
|||
---
|
||||
from: http://rosettacode.org/wiki/Category:Acornsoft_Lisp
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Ackermann-function/Acornsoft-Lisp
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Church-numerals/Acornsoft-Lisp
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Closures-Value-capture/Acornsoft-Lisp
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Combinations/Acornsoft-Lisp
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Comma-quibbling/Acornsoft-Lisp
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Factorial/Acornsoft-Lisp
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Hello-world-Text/Acornsoft-Lisp
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Ordered-words/Acornsoft-Lisp
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Palindrome-detection/Acornsoft-Lisp
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Permutations-Derangements/Acornsoft-Lisp
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Quine/Acornsoft-Lisp
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Set-puzzle/Acornsoft-Lisp
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/RIPEMD-160/C++
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Ramanujan-primes-twins/C++
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Search-in-paragraphs-text/C++
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Secure-temporary-file/C++
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Church-numerals/Common-Lisp
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Currency/Common-Lisp
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Permutations-Derangements/Common-Lisp
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Set-puzzle/Common-Lisp
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Amicable-pairs/EasyLang
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Archimedean-spiral/EasyLang
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Arithmetic-evaluation/EasyLang
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Catalan-numbers-Pascals-triangle/EasyLang
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Circular-primes/EasyLang
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Continued-fraction/EasyLang
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Cullen-and-Woodall-numbers/EasyLang
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Farey-sequence/EasyLang
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Leonardo-numbers/EasyLang
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Numbers-with-equal-rises-and-falls/EasyLang
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Palindrome-detection/EasyLang
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Polyspiral/EasyLang
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Recamans-sequence/EasyLang
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Sequence-of-non-squares/EasyLang
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Seven-sided-dice-from-five-sided-dice/EasyLang
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Shoelace-formula-for-polygonal-area/EasyLang
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Sum-digits-of-an-integer/EasyLang
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Sum-of-a-series/EasyLang
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Totient-function/EasyLang
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Secure-temporary-file/F-Sharp
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/24-game-Solve/FutureBasic
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Anagrams-Deranged-anagrams/FutureBasic
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Attractive-numbers/FutureBasic
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Averages-Median/FutureBasic
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Averages-Mode/FutureBasic
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Eulers-constant-0.5772.../FutureBasic
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Filter/FutureBasic
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Globally-replace-text-in-several-files/FutureBasic
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/HTTPS/FutureBasic
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Hex-words/FutureBasic
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Menu/FutureBasic
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Odd-word-problem/FutureBasic
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Program-termination/FutureBasic
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Word-wheel/FutureBasic
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Peripheral-drift-illusion/Java
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Quoting-constructs/Java
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Radical-of-an-integer/Java
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Ramanujan-primes-twins/Java
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Repunit-primes/Java
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Retrieve-and-search-chat-history/Java
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Search-in-paragraphs-text/Java
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/2048/Koka
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Faces-from-a-mesh/Koka
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Gamma-function/Koka
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Inverted-syntax/Koka
|
||||
|
|
@ -1,5 +1,6 @@
|
|||
{{language|Maxima
|
||||
|site=http://maxima.sourceforge.net/}}
|
||||
{{language|Maxima|site=https://maxima.sourceforge.io/}}
|
||||
|
||||
Maxima is the language used in the computer algebra system of the same name.
|
||||
|
||||
[[Category:Mathematical programming languages]]
|
||||
[[Category:Mathematical programming languages]]
|
||||
[[Category:Lisp related]]
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Additive-primes/Maxima
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Almost-prime/Maxima
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Archimedean-spiral/Maxima
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Arithmetic-numbers/Maxima
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Blum-integer/Maxima
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Cullen-and-Woodall-numbers/Maxima
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Curzon-numbers/Maxima
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Digital-root/Maxima
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Disarium-numbers/Maxima
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Draw-a-pixel/Maxima
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Duffinian-numbers/Maxima
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Farey-sequence/Maxima
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Giuga-numbers/Maxima
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Julia-set/Maxima
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Koch-curve/Maxima
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Mandelbrot-set/Maxima
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Perfect-totient-numbers/Maxima
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Semiprime/Maxima
|
||||
|
|
@ -1 +1,12 @@
|
|||
{{stub}}{{language|Mojo}}
|
||||
{{stub}}{{language|Mojo}}
|
||||
|
||||
== Mojo🔥 ==
|
||||
|
||||
:Mojo is a new programming language that bridges the gap between research and production by combining the best of Python syntax with systems programming and metaprogramming.
|
||||
|
||||
:With Mojo, you can write portable code that’s faster than C and seamlessly inter-op with the Python ecosystem.<ref name="docs">[https://docs.modular.com/mojo/ Documentation]</ref>
|
||||
|
||||
:Mojo is still very young, but [https://www.modular.com we] believe an active community and a strong feedback pipeline is key to its success.<ref>[https://docs.modular.com/mojo/community.html Community]</ref>
|
||||
|
||||
=== References ===
|
||||
<references />
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Attractive-numbers/Odin
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Leonardo-numbers/Odin
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Chaocipher/QBasic
|
||||
Some files were not shown because too many files have changed in this diff Show More
Loading…
Reference in New Issue