Data update
This commit is contained in:
Ingy döt Net
parent
5150844a7d
commit
4bb20c9b71
7735 changed files with 38060 additions and 199180 deletions
|
|
@ -1 +0,0 @@
|
|||
../../Task/Bioinformatics-base-count/11l
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Meissel-Mertens-constant/11l
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Miller-Rabin-primality-test/11l
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Sorting-Algorithms-Circle-Sort/11l
|
||||
|
|
@ -131,6 +131,29 @@ This flag is set if the <code>BRK</code> command was executed. The BRK basically
|
|||
* Set with: <code>BRK</code>
|
||||
* Cleared with: <code>RTI</code>
|
||||
* There are no branches associated with this command.
|
||||
|
||||
This flag is used only for differentiating a <code>BRK</code> from an hardware <code>IRQ</code>
|
||||
<syntaxhighlight lang="6502asm">IRQ:
|
||||
STA saveAccumulator ; save accumulator
|
||||
PLA ; get flags
|
||||
STA saveFlags ; save flags
|
||||
AND #$10 ; check "break" flag
|
||||
BNE IRQ_fromBreak ; if(break flag set){ goto IRQ_fromBreak; }
|
||||
JMP IRQ_fromHardware ; else{ goto IRQ_fromInterrupt; }
|
||||
IRQ_fromBreak:
|
||||
LDA saveFlags ; load flags from temp address
|
||||
PHA ; restore flags to stack
|
||||
LDA saveAccumulator ; restore accumulator
|
||||
;...
|
||||
RTI ; return from interrupt
|
||||
|
||||
IRQ_fromInterrupt:
|
||||
LDA saveFlags ; load flags from temp address
|
||||
PHA ; restore flags to stack
|
||||
LDA saveAccumulator ; restore accumulator
|
||||
;...
|
||||
RTI ; return from interrupt
|
||||
</syntaxhighlight>
|
||||
<br><br>
|
||||
|
||||
===Decimal===
|
||||
|
|
|
|||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Bioinformatics-base-count/AArch64-Assembly
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Miller-Rabin-primality-test/AArch64-Assembly
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Sorting-Algorithms-Circle-Sort/AArch64-Assembly
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Bioinformatics-base-count/ALGOL-68
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Meissel-Mertens-constant/ALGOL-68
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Miller-Rabin-primality-test/ALGOL-68
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Quaternion-type/ALGOL-68
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Sorting-Algorithms-Circle-Sort/ALGOL-68
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Copy-a-string/ALGOL-W
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Integer-comparison/ALGOL-W
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Meissel-Mertens-constant/ALGOL-W
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Quaternion-type/ALGOL-W
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Bioinformatics-base-count/APL
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Bioinformatics-base-count/ARM-Assembly
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Miller-Rabin-primality-test/ARM-Assembly
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Sorting-Algorithms-Circle-Sort/ARM-Assembly
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Quaternion-type/ATS
|
||||
|
|
@ -8,13 +8,13 @@ Each AWK program consists of pattern-action statements.
|
|||
The program reads each input line, checks lines against patterns, and runs matching actions.
|
||||
For programs that never read input lines, the entire program can be one <code>BEGIN { ... }</code> block.
|
||||
|
||||
* ''List users who have /bin/ksh as a shell.''<lang awk>$ awk -F: '$7 == "/bin/ksh" { print $1 }' /etc/passwd</lang>
|
||||
* ''List users who have /bin/ksh as a shell.''<syntaxhighlight lang="awk">$ awk -F: '$7 == "/bin/ksh" { print $1 }' /etc/passwd</syntaxhighlight>
|
||||
|
||||
AWK has only three types of variables: they are strings, floating-point numbers, and associative arrays (where every array index is a string).
|
||||
Conversion between strings and numbers is automatic. AWK also has regular expressions, which appear in many AWK programs.
|
||||
There are a few built-in functions, like cos() and sprintf().
|
||||
|
||||
* ''Find average line length.''<lang awk>$ awk '{ cnt += length($0) } END { print cnt / NR }' /etc/rc</lang>
|
||||
* ''Find average line length.''<syntaxhighlight lang="awk">$ awk '{ cnt += length($0) } END { print cnt / NR }' /etc/rc</syntaxhighlight>
|
||||
|
||||
The name "AWK" comes from the initials of Alfred Aho, Peter Weinberger and Brian Kernighan: they invented AWK during the 1970s.
|
||||
A few decades later, Kernighan continues to maintain the [[nawk|reference implementation]] of AWK.
|
||||
|
|
|
|||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Bioinformatics-base-count/AWK
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Bioinformatics-base-count/Action-
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Quaternion-type/Action-
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Sorting-Algorithms-Circle-Sort/Action-
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Bioinformatics-base-count/Ada
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Miller-Rabin-primality-test/Ada
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Quaternion-type/Ada
|
||||
|
|
@ -20,6 +20,9 @@ The syntax looks like very simplified [[ALGOL 68]] with elements taken from [[Lu
|
|||
== How has it been implemented ? ==
|
||||
Agena is based on the [[ANSI]] [[C]] source code of [[Lua]], a popular and widely used Open Source programming language.
|
||||
|
||||
== Todo ==
|
||||
[[Tasks not implemented in Agena]]
|
||||
|
||||
== See Also ==
|
||||
[[ALGOL 68]]<br/>
|
||||
[[Lua]]<br/>
|
||||
|
|
|
|||
|
|
@ -1 +0,0 @@
|
|||
../../Task/100-doors/Agena
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Bioinformatics-base-count/Arturo
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Meissel-Mertens-constant/Arturo
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Quaternion-type/Arturo
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Sorting-Algorithms-Circle-Sort/Arturo
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Empty-program/Asymptote
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Miller-Rabin-primality-test/AutoHotkey
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Quaternion-type/AutoHotkey
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Sorting-Algorithms-Circle-Sort/AutoHotkey
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Quaternion-type/Axiom
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Abundant-deficient-and-perfect-number-classifications/BASIC
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Ethiopian-multiplication/BASIC
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Mayan-numerals/BASIC
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Empty-program/BASIC256
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Meissel-Mertens-constant/BASIC256
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Quaternion-type/BASIC256
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Bioinformatics-base-count/BBC-BASIC
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Quaternion-type/BBC-BASIC
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Miller-Rabin-primality-test/BQN
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Input-loop/Batch-File
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Miller-Rabin-primality-test/Bc
|
||||
|
|
@ -5,7 +5,16 @@
|
|||
}}
|
||||
{{language programming paradigm|functional}}
|
||||
'''Binary Lambda Calculus''' is a minimal, pure, functional, esoteric language based on lambda calculus. [[provides::Capability:First class functions| ]]
|
||||
|
||||
==External links==
|
||||
* https://tromp.github.io/cl/cl.html
|
||||
* https://www.ioccc.org/2012/tromp/hint.html
|
||||
* https://gist.github.com/tromp/86b3184f852f65bfb814e3ab0987d861
|
||||
|
||||
Some implementations of BLC:
|
||||
* [https://www.ioccc.org/2012/tromp/hint.html original tromp's implementation] for IOCCC, in pure ANSI C
|
||||
* [https://github.com/tromp/AIT tromp's AIT], a project utilizing BLC for Information Theory research. Also includes a Haskell->BLC compiler and several other implementations
|
||||
* [https://codeberg.org/aartaka/cl-blc aartaka's cl-blc], implementing BLC in Lisp
|
||||
|
||||
==To do==
|
||||
[[Tasks not implemented in Binary Lambda Calculus]]
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Empty-program/BootBASIC
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Miller-Rabin-primality-test/Bracmat
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Bioinformatics-base-count/C++
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Meissel-Mertens-constant/C++
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Miller-Rabin-primality-test/C++
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Quaternion-type/C++
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Sorting-Algorithms-Circle-Sort/C++
|
||||
|
|
@ -17,6 +17,10 @@
|
|||
==Citations==
|
||||
*[[wp:C_Sharp_(programming_language)|Wikipedia:C#]]
|
||||
|
||||
== External links ==
|
||||
=== Online editors and compilers ===
|
||||
*[https://www.onlinegdb.com/ GDB Online Compiler] (Select C#)
|
||||
|
||||
{{language programming paradigm|Imperative}}
|
||||
{{language programming paradigm|Object-oriented}}
|
||||
{{language programming paradigm|Generic}}
|
||||
|
|
|
|||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Miller-Rabin-primality-test/C-sharp
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Quaternion-type/C-sharp
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Sorting-Algorithms-Circle-Sort/C-sharp
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Bioinformatics-base-count/C
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Miller-Rabin-primality-test/C
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Quaternion-type/C
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Sorting-Algorithms-Circle-Sort/C
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Quaternion-type/CLU
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Miller-Rabin-primality-test/Clojure
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Empty-program/CoffeeScript
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Sorting-Algorithms-Circle-Sort/CoffeeScript
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Miller-Rabin-primality-test/Commodore-BASIC
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Miller-Rabin-primality-test/Common-Lisp
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Quaternion-type/Common-Lisp
|
||||
|
|
@ -2,3 +2,10 @@
|
|||
|
||||
==Citations==
|
||||
* [http://en.wikipedia.org/wiki/Component_Pascal Wikipedia:Component Pascal]
|
||||
|
||||
===See also===
|
||||
* [[Oberon-07]]
|
||||
* [[Oberon-2]]
|
||||
* [[Zonnon]]
|
||||
* [[Modula-2]]
|
||||
* [[Modula-3]]
|
||||
|
|
@ -1,9 +1 @@
|
|||
{{language|Coq
|
||||
|site=http://coq.inria.fr
|
||||
}}
|
||||
In computer science, Coq is a proof assistant application. It allows the expression of mathematical assertions, mechanically checks proofs of these assertions, helps to find formal proofs, and extracts a certified program from the constructive proof of its formal specification. Coq works within the theory of the calculus of inductive constructions, a derivative of the calculus of constructions. Coq is not an automated [[wp:Theorem_prover|theorem prover]] but includes automatic theorem proving tactics and various decision procedures.
|
||||
|
||||
==Citations==
|
||||
* [[wp:Coq|Coq]]
|
||||
|
||||
[[Category:Mathematical programming languages]]
|
||||
#REDIRECT [[:Category:Rocq]]
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/100-doors/Coq
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Ackermann-function/Coq
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Extend-your-language/Coq
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Factorial/Coq
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Fibonacci-sequence/Coq
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/FizzBuzz/Coq
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Hello-world-Newbie/Coq
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Hello-world-Text/Coq
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Loops-For/Coq
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Tree-traversal/Coq
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Variadic-function/Coq
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Empty-program/Crystal
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Miller-Rabin-primality-test/Crystal
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Quaternion-type/Crystal
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Sorting-Algorithms-Circle-Sort/Crystal
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Miller-Rabin-primality-test/D
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Quaternion-type/D
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Sorting-Algorithms-Circle-Sort/D
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Meissel-Mertens-constant/Dart
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Quaternion-type/Dart
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Bioinformatics-base-count/Delphi
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Meissel-Mertens-constant/Delphi
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Quaternion-type/Delphi
|
||||
Some files were not shown because too many files have changed in this diff Show more
Loading…
Add table
Add a link
Reference in a new issue