Data update
This commit is contained in:
Ingy döt Net
parent
ed705008a8
commit
0df55f9f24
|
|
@ -86,6 +86,7 @@ B: .b
|
|||
B4J: .b4j
|
||||
B4X: .b4x
|
||||
Babel: .pb
|
||||
BabyCobol: .cobol
|
||||
BaCon: .bacon
|
||||
Bait: .bait
|
||||
Ballerina: .ballerina
|
||||
|
|
@ -124,6 +125,7 @@ Bracmat: .bracmat
|
|||
Brainf***: .bf
|
||||
Brat: .brat
|
||||
Brlcad: .brlcad
|
||||
Bruijn: .bruijn
|
||||
Burlesque: .blq
|
||||
C++: .cpp
|
||||
C: .c
|
||||
|
|
@ -342,6 +344,7 @@ HLA: .hla
|
|||
HolyC: .holyc
|
||||
Hoon: .hoon
|
||||
Hope: .hope
|
||||
Hopper: .hopper
|
||||
HPPPL: .hpppl
|
||||
HQ9+: .hq9+
|
||||
Huginn: .huginn
|
||||
|
|
@ -589,6 +592,7 @@ Oz: .oz
|
|||
Palo Alto Tiny BASIC: .basic
|
||||
Panda: .panda
|
||||
Panoramic: .panoramic
|
||||
ParaCL: .paracl
|
||||
Pare: .pare
|
||||
PARI/GP: .parigp
|
||||
Pascal: .pas
|
||||
|
|
@ -646,6 +650,7 @@ Processing: .processing
|
|||
Processing Python mode: .processing-py
|
||||
Processing.R: .processing-r
|
||||
ProDOS: .dos
|
||||
Prog8: .prog8
|
||||
Prolog: .pro
|
||||
PROMAL: .promal
|
||||
PSQL: .psql
|
||||
|
|
@ -696,6 +701,7 @@ RISC-V Assembly: .asm
|
|||
RLaB: .rlab
|
||||
RLSL: .rlsl
|
||||
Robotic: .robotic
|
||||
Roc: .roc
|
||||
Rockstar: .rockstar
|
||||
RPG: .rpg
|
||||
RPGIV: .rpgiv
|
||||
|
|
@ -831,6 +837,7 @@ TXR: .txr
|
|||
Typed Racket: .rkt
|
||||
TypeScript: .ts
|
||||
UC++: .uc++
|
||||
Uiua: .uiua
|
||||
Ultimate++: .ultimate++
|
||||
Unicon: .unicon
|
||||
Uniface: .uniface
|
||||
|
|
|
|||
|
|
@ -0,0 +1 @@
|
|||
../../Task/N-queens-problem/6502-Assembly
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Angle-difference-between-two-bearings/ALGOL-68
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Angles-geometric-normalization-and-conversion/ALGOL-68
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Averages-Mean-time-of-day/ALGOL-68
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Cheryls-birthday/ALGOL-68
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Chinese-remainder-theorem/ALGOL-68
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Death-Star/ALGOL-68
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Eban-numbers/ALGOL-68
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Floyd-Warshall-algorithm/ALGOL-68
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Fortunate-numbers/ALGOL-68
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Long-primes/ALGOL-68
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Magic-squares-of-singly-even-order/ALGOL-68
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Modified-random-distribution/ALGOL-68
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Number-reversal-game/ALGOL-68
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Pisano-period/ALGOL-68
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Pythagorean-triples/ALGOL-68
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Range-consolidation/ALGOL-68
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Ray-casting-algorithm/ALGOL-68
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Sequence:-nth-number-with-exactly-n-divisors/ALGOL-68
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Sort-numbers-lexicographically/ALGOL-68
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Sum-and-product-puzzle/ALGOL-68
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Angles-geometric-normalization-and-conversion/ALGOL-W
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Sierpinski-square-curve/ALGOL-W
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Temperature-conversion/ALGOL-W
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/The-Twelve-Days-of-Christmas/APL
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Textonyms/AWK
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Long-year/Amazing-Hopper
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Sort-three-variables/Amazing-Hopper
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Split-a-character-string-based-on-change-of-character/Amazing-Hopper
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Arithmetic-numbers/AppleScript
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Textonyms/AppleScript
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Draw-a-pixel/Applesoft-BASIC
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/N-queens-problem/Applesoft-BASIC
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Phrase-reversals/Applesoft-BASIC
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Run-length-encoding/Applesoft-BASIC
|
||||
|
|
@ -24,6 +24,7 @@ BASIC became popular, with many different implementations for various computers.
|
|||
**[[wp:PowerBASIC]]
|
||||
**[[wp:PureBasic]]
|
||||
**[[wp:Rocky Mountain BASIC]]
|
||||
**[[wp:Sinclair BASIC]]
|
||||
**[[wp:SuperBASIC]]
|
||||
**[[wp:True BASIC]]
|
||||
{{language programming paradigm|Procedural}}
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Reverse-a-string/BASIC
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Sum-and-product-puzzle/BASIC256
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Validate-International-Securities-Identification-Number/BASIC256
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Minimum-multiple-of-m-where-digital-sum-equals-m/BBC-BASIC
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Narcissistic-decimal-number/BBC-BASIC
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Narcissistic-decimal-number/BCPL
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Sort-numbers-lexicographically/BQN
|
||||
|
|
@ -0,0 +1,7 @@
|
|||
{{language|BabyCobol
|
||||
| site = https://slebok.github.io/baby/
|
||||
| gc = no
|
||||
| parampass = both
|
||||
| hopl = no
|
||||
}}
|
||||
'''BabyCobol''' is an experiment in language design: it is small enough to be quickly implementable (fully or partially) within any framework that can support its features, but complex enough to cover typical problems of legacy language processing. If you learn how to compile [[MiniJava]], you stand a good chance of implementing a reasonably good compiler for any contemporary programming language. If you show how your language extension works on [[Featherweight Java]], it has a good chance of being applicable to any reasonable modern object-oriented programming language. If you can handle BabyCobol with your tool and with your skills, you are ready to face the challenges of software modernisation, codebase migration and legacy language processing in general.
|
||||
|
|
@ -0,0 +1,2 @@
|
|||
---
|
||||
from: http://rosettacode.org/wiki/Category:BabyCobol
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/100-doors/BabyCobol
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/99-bottles-of-beer/BabyCobol
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/A+B/BabyCobol
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/FizzBuzz/BabyCobol
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Hello-world-Text/BabyCobol
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/User-input-Text/BabyCobol
|
||||
|
|
@ -1,11 +1,11 @@
|
|||
{{
|
||||
language|Bait
|
||||
|site=https://github.com/tiabeast/bait
|
||||
|site=https://github.com/bait-lang/bait
|
||||
|strength=strong
|
||||
|safety=safe
|
||||
|checking=static
|
||||
}}
|
||||
|
||||
Bait is a work-in-progress simple, compiled, general purpose programming language for building reliable software.
|
||||
Bait is a simple programming language for building reliable software.
|
||||
|
||||
Solutions to RosettaCode are maintained at https://github.com/tiabeast/rosetta-bait. Please propose solutions there.
|
||||
Solutions are maintained at https://github.com/bait-lang/rosetta-bait. Please propose changes there.
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/CRC-32/Bait
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Loops-Downward-for/Bait
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Loops-For/Bait
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Loops-For-with-a-specified-step/Bait
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Loops-Foreach/Bait
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Pascals-triangle/Bait
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Sorting-algorithms-Bubble-sort/Befunge
|
||||
|
|
@ -6,5 +6,6 @@
|
|||
{{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==
|
||||
* [[eso:Binary_lambda_calculus|Esoteric languages wiki page]]
|
||||
[[Category:Esoteric Languages]]
|
||||
* https://tromp.github.io/cl/cl.html
|
||||
* https://www.ioccc.org/2012/tromp/hint.html
|
||||
* https://gist.github.com/tromp/86b3184f852f65bfb814e3ab0987d861
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Hello-world-Newbie/Binary-Lambda-Calculus
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Hello-world-Text/Binary-Lambda-Calculus
|
||||
|
|
@ -1 +0,0 @@
|
|||
../../Task/Quine/Binary-Lambda-Calculus
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Shell-one-liner/Binary-Lambda-Calculus
|
||||
|
|
@ -0,0 +1,10 @@
|
|||
{{language|bruijn
|
||||
|exec=interpreted
|
||||
|LCT=no
|
||||
|site=https://bruijn.marvinborner.de}}{{language programming paradigm|functional}}
|
||||
|
||||
Bruijn is a [[functional_programming|functional]] programming language based on pure [[wp:lambda_calculus|lambda calculus]]. It uses De Bruijn indices instead of named variables and square brackets for abstractions. Like pure lambda calculus, bruijn can be compiled to [https://tromp.github.io/cl/Binary_lambda_calculus.html Binary Lambda Calculus]. Unlike pure lambda calculus, you can define named substitution rules. Bruijn has a large standard library of such definitions.
|
||||
|
||||
Bruijn does not have primitive functions or data types. Every function (including add, map, mul, etc.) is implemented in bruijn itself. Numbers, strings, or chars are syntactic sugar for data encoded as closed terms/abstractions.
|
||||
|
||||
Documentation can be found at https://bruijn.marvinborner.de/wiki/.
|
||||
|
|
@ -0,0 +1,2 @@
|
|||
---
|
||||
from: http://rosettacode.org/wiki/Category:Bruijn
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/99-bottles-of-beer/Bruijn
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/A+B/Bruijn
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Ackermann-function/Bruijn
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Balanced-ternary/Bruijn
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Binary-search/Bruijn
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Comments/Bruijn
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Empty-program/Bruijn
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Factorial/Bruijn
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Fibonacci-sequence/Bruijn
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/FizzBuzz/Bruijn
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Function-composition/Bruijn
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Hailstone-sequence/Bruijn
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Halt-and-catch-fire/Bruijn
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Hamming-numbers/Bruijn
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Hello-world-Text/Bruijn
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Higher-order-functions/Bruijn
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Levenshtein-distance/Bruijn
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Loops-Infinite/Bruijn
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Palindrome-detection/Bruijn
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Sorting-algorithms-Quicksort/Bruijn
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Sum-and-product-of-an-array/Bruijn
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Ternary-logic/Bruijn
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Test-a-function/Bruijn
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Y-combinator/Bruijn
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Aliquot-sequence-classifications/C-sharp
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Arithmetic-numbers/C-sharp
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/B-zier-curves-Intersections/C-sharp
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Bifid-cipher/C-sharp
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Blum-integer/C-sharp
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Combinations-and-permutations/C-sharp
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Cut-a-rectangle/C-sharp
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Demings-funnel/C-sharp
|
||||
|
|
@ -0,0 +1 @@
|
|||
../../Task/Determinant-and-permanent/C-sharp
|
||||
Some files were not shown because too many files have changed in this diff Show More
Loading…
Reference in New Issue