Show My Kumite Only?
Filter by Language:
Kumite (ko͞omiˌtā) is the practice of taking techniques learned from Kata and applying them through the act of freestyle sparring.
You can create a new kumite by providing some initial code and optionally some test cases. From there other warriors can spar with you, by enhancing, refactoring and translating your code. There is no limit to how many warriors you can spar with.
A great use for kumite is to begin an idea for a kata as one. You can collaborate with other code warriors until you have it right, then you can convert it to a kata.

Hello World (POC LC Kata)

Using the string encoding described below, define a term hello which is equivalent to "Hello, world!"

Encodings

purity -> Let
true, false -> Church encoding
Number -> Church encoding (only used as chars)
char -> a number corresponding to ascii code
nil -> an empty string: \ _ -> false
cons -> add a char to a string: \ char string b1 . b1 true (\ b2 . b2 char string)

Fixed for existing bugs. Now with number literals.

const code = String.raw`
# Preloaded

true = \ a b . a
false = \ a b . b

pair = \ a b c . c a b
nil = \ _ . false
cons = \ c s . pair true (pair c s)

# Code
hello = cons 72
      ( cons 101
      ( cons 108
      ( cons 108
      ( cons 111
      ( cons 44
      ( cons 32
      ( cons 119
      ( cons 111
      ( cons 114
      ( cons 108
      ( cons 100
      ( cons 33
             nil
      ))))))))))))
`

Test Cases

Diff

const chai = require("chai");
const assert = chai.assert;
chai.config.truncateThreshold = 0;

// const LC = require("LC");
const LC = { compile: () => compile(code), config: options } // Temporary. Would normally import, see line above.
LC.config.purity = "Let";
LC.config.numEncoding = "Church";

const solution = LC.compile().hello;

const T = new L('a', new L('b', new V('a')));
const F = new L('a', new L('b', new V('b')));

function _toString(term, res="") {
  if (term(T)(true)(false)) {
    const n = toInt(term(F)(T));
    return _toString(term(F)(F), res+String.fromCharCode(n));
  } else return res;
}
describe("Full tests", function() {
  it("Does it work?", function() {
    assert.equal(_toString(solution), "Hello, world!")
  });
});

Kacarottvs.Kacarott

Task

Using the string encoding described below, define a term hello which is equivalent to "Hello, world!"

Encodings

purity -> LetRec
true, false -> Church encoding
Number -> Church encoding (only used as chars)
char -> a number corrosponding to ascii code
nil -> an empty string: \ _ -> false
cons -> add a char to a string: \ char string b1 . b1 true (\ b2 . b2 char string)

Code

Diff

const code = String.raw`
# bools
true = \ a b . a
false = \ a b . b

# numbers
zero = false
succ = \ n f x . f (n f x)
add = \ a b f x . a f (b f x)
mul = \ a b f . a (b f)

three = \ f x . f ( f ( f x ))
ten = succ (mul three three)
thirtytwo = succ (succ (mul ten three))
thirtythree = succ thirtytwo
fortyfour = succ (add ten thirtythree)
seventytwo = mul (succ ( succ (add three three))) (mul three three)
hundred = mul ten ten
hundredone = succ hundred
hundredeight = succ (add three (add three hundredone))
hundredeleven = add three hundredeight
hundredforteen = add three hundredeleven
hundrednineteen = succ (succ (add three hundredforteen))

# data
pair = \ a b c . c a b
nil = \ _ . false
cons = \ c s . pair true (pair c s)

# [72, 101, 108, 108, 111, 44, 32, 119, 111, 114, 108, 100, 33]
hello = cons seventytwo 
       (cons hundredone 
       (cons hundredeight 
       (cons hundredeight 
       (cons hundredeleven 
       (cons fortyfour 
       (cons thirtytwo 
       (cons hundrednineteen 
       (cons hundredeleven
       (cons hundredforteen
       (cons hundredeight
       (cons hundred
       (cons thirtythree
       nil ))))))))))))
`

Test Cases

Diff

const chai = require("chai");
const assert = chai.assert;
chai.config.truncateThreshold = 0;

// const LC = require("LC");
const LC = { compile: () => compile(code), config: options } // Temporary. Would normally import, see line above.
LC.config.purity = "LetRec";
LC.config.numEncoding = "Church";

const solution = LC.compile().hello;

const T = new L('a', new L('b', new V('a')));
const F = new L('a', new L('b', new V('b')));

function _toString(term, res="") {
  if (term(T)(true)(false)) {
    const n = toInt(term(F)(T));
    return _toString(term(F)(F), res+String.fromCharCode(n));
  } else return res;
}
describe("Full tests", function() {
  it("Does it work?", function() {
    assert.equal(_toString(solution), "Hello, world!")
  });
});

JohanWiltinkvs.Kacarott

POC LC crosscompiler in JS

show decoded value in test failure message.

valueOf and decoded are defined on Function.prototype; things won't work ( for different reasons ) if not.

toInt has been removed from awaitArg; it didn't seem useful.

testing seems faster. (??) failing tests take relatively long though ( and longer than succeeding tests of the same size ). fortunately, a failing test stops the it group, so it doesn't seem a major problem.

I have tried to make awaitArg.term to print a nice lambda expression. couldn't do it.

a failed test now shows

expected { [Function: awaitArg]
  term: { name: 'f', body: { name: 'x', body: [Object] } },
  env: {},
  decoded: 6765 } to equal 6764

Test Cases

Diff

const chai = require("chai");
const assert = chai.assert;
chai.config.truncateThreshold = 0;

// const LC = require("LC");
const LC = { compile: () => compile(code), config: options } // Temporary. Would normally import, see line above.
LC.config.purity = "LetRec";
LC.config.numEncoding = "Church";

const solution = LC.compile();
const fibonacci = solution.fibonacci;
// const subSlow = solution.subSlow; // Uses BinaryScott

describe("Sample Tests", function() {
  it("Basics", function() {
    assert.equal(fibonacci(0), 0);
    assert.equal(fibonacci(1), 1);
    assert.equal(fibonacci(2), 1);
    assert.equal(fibonacci(3), 2);
    assert.equal(fibonacci(4), 3);
    assert.equal(fibonacci(5), 5);
    assert.equal(fibonacci(6), 8);
    assert.equal(fibonacci(7), 13);
    assert.equal(fibonacci(20), 6765);
    assert.equal(fibonacci(20), 6764);
  });
});

深紅心vs.SuppliedOrange

Factorial In Javascript

Be careful! You were previously implicitly defining a global fact when you really should not have done that. A lot of these problems can be solved by including that "use strict"; at the start of a function, which is especially important when you're starting out.
Also, factorial of 0 is 1, and factorial of negatives is undefined. It's also nice to have proper indentation to make programs a little easier to read.

Code

Diff

function factorial (n) {
  "use strict";
  if (n < 0) {
    return NaN
  }
  let i, fact
  i = fact = 1
  while (i <= n) { 
    fact *= i
    i++
  }
  return fact
}

Test Cases

Diff

const chai = require("chai");
const assert = chai.assert;

describe("Solution", function() {
  it("should test for something", function() {
    assert(factorial(0), 1);
    assert(factorial(1), 1);
    assert(factorial(5), 120);
    assert(factorial(8),40320);
    assert(factorial(15),1307674368000);
  });
});

Recent Moves:

SuppliedOrange

Factorial In Javascript

The factorial of a number is the product of all the numbers from 1 to that number

Like factorial of 3 would be 1 x 2 x 3

function factorial (n) {
  if (n <= 0) return 0
  
  let i = fact = 1
  while (i <= n) { 
  fact *= i
  i++
  }
  return fact
  
}

const chai = require("chai");
const assert = chai.assert;

describe("Solution", function() {
  it("should test for something", function() {
    assert(factorial(5), 120);
    assert(factorial(8),40320);
    assert(factorial(15),1307674368000);
  });
});

treeplatevs.rowcased

Add two integers

Code

Diff

```
addition(a,b)=>a+b;
```

Recent Moves:

treeplatevs.neonoFailed Tests

Random-tested adding

Test Cases

Diff

// See https://pub.dartlang.org/packages/test
import "package:test/test.dart";
import "package:solution/solution.dart";
import "dart:math";

void main() {
  group("Tests", () {
    test('1+1=', ()=> expect(addition(1, 1), equals(2)));
    test('2+0=', ()=> expect(addition(2, 0), equals(2)));
    test('123+321=', ()=> expect(addition(123, 321), equals(444)));
    Random r = Random();
    int a = r.nextInt(1000);
    int b = r.nextInt(1000);
    test('Random', ()=> expect(addition(a, b), equals(a+b)));
  });
}

 const code = String.raw`
-−
+succ = \ n f x . f (n f x)
-−
+pair = \a.\b.\c.c a b
-−
+fst = \pair.pair (\a.\_.a)
-−
+snd = \pair.pair (\_.\b.b)
-−
+plus = \pair.\f.\x.(fst pair) f ((snd pair) f x)
-−
+next = \prev.pair (snd prev) (plus prev)
-−
+fibonacci = \n. fst (n next (pair (\_.\b.b) (succ (\_.\b.b))))
-−
+`
 Y = \ f . ( \ x . f (x x) ) ( \ x . f (x x) )
 True = \ t f . t
 False = \ t f . f
 Succ = \ n s z . s (n s z)
 Pred = \ n s z . n ( \ f g . g (f s) ) (\_.z) \x.x
 Minus = \ m n . n Pred m
 Times = \ m n s . m (n s)
 isZero = \ n . n (\_.False) True
 isNotZero = \ n . n (\_.True) False
 And = \ x y . x y x
 Or = \ x . x x
 GT = \ x y . isNotZero (Minus x y)
 Mod = \ n m . ( \ r . isZero (Minus m r) 0 r ) (( \ n m . ( \ d . isZero d n (Mod d m) ) (Minus n m) ) n m)
-−
+// Stress testing -- "LetRec", "BinaryScott"
-−
+// Testing implementation of a "String" - ie. Arrays and related functions
-−
+const stress = String.raw`
-−
+# bools
-−
+id = \ x . x
-−
+true = \ a b . a
-−
+false = \ a b . b
-−
+not = \ b . b false true
-−
+and = \ a b . a b false
-−
+or = \ a b . a true b
-−
+xor = \ a b . a (b false true) b
 # function isPrime(n) {
 #   const trial = function trial(i) {
 #     return i * i > n || n % i != 0 && trial(i+1) ;
 #   } ;
 #   return n > 1 && trial(2) ;
 # }
-−
+# ints -- z = endbit, f = offbit, t = onbit
-−
+zero = \ z _ _ . z
-−
+succ = \ n _ f t . n (t zero) t (\ m . f (succ m))
-−
+bool = \ n . n false (\ _ . true) (\ _ . true)
-−
+pred = \ n z f t . n z (\ m . t (pred m)) (\ m . bool m (f m) z)
-−
+odd = \ n . n false false true
-−
+even = \ n . not (odd n)
-−
+mul2 = \ n _ f _ . f n
-−
+addSlow = \ a b . bool b (addSlow (succ a) (pred b)) a
-−
+subSlow = \ a b . bool a (bool b (subSlow (pred a) (pred b)) a) (zero)
-−
-−
+# arrays as foldr (strings)
 isPrime = \ n . ( \ trial . And (GT n 1) (trial 2) )
                 ( Y \ trial i . Or (GT (Times i i) n) (And (isNotZero (Mod n i)) (trial (Succ i))) )
 `

 const code = String.raw`
-−
+succ = \ n f x . f (n f x)
-−
+pair = \a.\b.\c.c a b
-−
+fst = \pair.pair (\a.\_.a)
-−
+snd = \pair.pair (\_.\b.b)
-−
+plus = \pair.\f.\x.(fst pair) f ((snd pair) f x)
-−
+next = \prev.pair (snd prev) (plus prev)
-−
+fibonacci = \n. fst (n next (pair (\_.\b.b) (succ (\_.\b.b))))
-−
+`
-−
-−
+// Stress testing -- "LetRec", "BinaryScott"
-−
+// Testing implementation of a "String" - ie. Arrays and related functions
-−
+const stress = String.raw`
 # bools
-−
+id = \ x . x
 true = \ a b . a
 false = \ a b . b
-−
+not = \ b . b false true
-−
+and = \ a b . a b false
-−
+or = \ a b . a true b
-−
+xor = \ a b . a (b false true) b
-−
+# ints -- z = endbit, f = offbit, t = onbit
-−
+zero = \ z _ _ . z
-−
+succ = \ n _ f t . n (t zero) t (\ m . f (succ m))
-−
+bool = \ n . n false (\ _ . true) (\ _ . true)
-−
+pred = \ n z f t . n z (\ m . t (pred m)) (\ m . bool m (f m) z)
-−
+odd = \ n . n false false true
-−
+even = \ n . not (odd n)
-−
+mul2 = \ n _ f _ . f n
-−
+addSlow = \ a b . bool b (addSlow (succ a) (pred b)) a
-−
+subSlow = \ a b . bool a (bool b (subSlow (pred a) (pred b)) a) (zero)
 # numbers
 zero = false
 succ = \ n f x . f (n f x)
 add = \ a b f x . a f (b f x)
 mul = \ a b f . a (b f)
 three = \ f x . f ( f ( f x ))
 ten = succ (mul three three)
 thirtytwo = succ (succ (mul ten three))
 thirtythree = succ thirtytwo
 fortyfour = succ (add ten thirtythree)
 seventytwo = mul (succ ( succ (add three three))) (mul three three)
 hundred = mul ten ten
 hundredone = succ hundred
 hundredeight = succ (add three (add three hundredone))
 hundredeleven = add three hundredeight
 hundredforteen = add three hundredeleven
 hundrednineteen = succ (succ (add three hundredforteen))
 # data
 pair = \ a b c . c a b
 nil = \ _ . false
 cons = \ c s . pair true (pair c s)
-−
+# arrays as foldr (strings)
 # [72, 101, 108, 108, 111, 44, 32, 119, 111, 114, 108, 100, 33]
 hello = cons seventytwo
        (cons hundredone
        (cons hundredeight
        (cons hundredeight
        (cons hundredeleven
        (cons fortyfour
        (cons thirtytwo
        (cons hundrednineteen
        (cons hundredeleven
        (cons hundredforteen
        (cons hundredeight
        (cons hundred
        (cons thirtythree
        nil ))))))))))))
 `

 const code = String.raw`
-−
+succ = \ n f x . f (n f x)
-−
+pair = \a.\b.\c.c a b
-−
+fst = \pair.pair (\a.\_.a)
-−
+snd = \pair.pair (\_.\b.b)
-−
+plus = \pair.\f.\x.(fst pair) f ((snd pair) f x)
-−
+next = \prev.pair (snd prev) (plus prev)
-−
+fibonacci = \n. fst (n next (pair (\_.\b.b) (succ (\_.\b.b))))
-−
+`
-−
-−
+// Stress testing -- "LetRec", "BinaryScott"
-−
+// Testing implementation of a "String" - ie. Arrays and related functions
-−
+const stress = String.raw`
-−
+# bools
-−
+id = \ x . x
-−
+true = \ a b . a
-−
+false = \ a b . b
-−
+not = \ b . b false true
-−
+and = \ a b . a b false
-−
+or = \ a b . a true b
-−
+xor = \ a b . a (b false true) b
-−
-−
+# ints -- z = endbit, f = offbit, t = onbit
-−
+zero = \ z _ _ . z
-−
+succ = \ n _ f t . n (t zero) t (\ m . f (succ m))
-−
+bool = \ n . n false (\ _ . true) (\ _ . true)
-−
+pred = \ n z f t . n z (\ m . t (pred m)) (\ m . bool m (f m) z)
-−
+odd = \ n . n false false true
-−
+even = \ n . not (odd n)
-−
+mul2 = \ n _ f _ . f n
-−
+addSlow = \ a b . bool b (addSlow (succ a) (pred b)) a
-−
+subSlow = \ a b . bool a (bool b (subSlow (pred a) (pred b)) a) (zero)
-−
-−
+# arrays as foldr (strings)
 add = \ m n s z . m s (n s z)
 go = \ return a b . return b (add a b)
 K = \ x _ . x
 fibonacci = \ n . n go K 0 1
 `

	1	−	int addition(int a, int b) => a + b;
1		+	addition(a,b)=>a+b;

Kumite

Filter by Language:

Encodings

Task

Encodings

Confirm