Giml

-- linked list data type and map operation

main = ffi( "console.log", head (map (add 1) list) )

List a =
	| Nil
	| Cons { head : a, tail : List a }

list =
	Cons { head: 1, tail: Cons { head: 2, tail: Nil } }

head list =
	case list of
		| Cons { head: head } ->
			head

map f xs =
	case xs of
		| Nil -> Nil
		| Cons { head: x, tail: rest } ->
			Cons { head: f x, tail: map f rest }

"use strict";
var map = function(f) {
  return function(xs) {
    return (function(_case_0) {
        if ("Nil" === _case_0._constr) {
          return (function() {
              return {
                "_constr": "Nil",
                "_field": {}
              };
            })
            ();
        }
        if ("Cons" === _case_0._constr && true && true) {
          return (function(x, rest) {
              return (function(_data) {
                  return {
                    "_constr": "Cons",
                    "_field": _data
                  };
                })
                ({
                  "head": f(x),
                  "tail": map(f)(rest)
                });
            })
            (_case_0._field.head, _case_0._field.tail);
        }
      })
      (xs);
  };
};
var list = (function(_data) {
    return {
      "_constr": "Cons",
      "_field": _data
    };
  })
  ({
    "head": 1,
    "tail": (function(_data) {
        return {
          "_constr": "Cons",
          "_field": _data
        };
      })
      ({
        "head": 2,
        "tail": {
          "_constr": "Nil",
          "_field": {}
        }
      })
  });
var head = function(list) {
  return (function(_case_1) {
      if ("Cons" === _case_1._constr && true) {
        return (function(head) {
          return head;
        })(_case_1._field.head);
      }
    })
    (list);
};
var main = function() {
  return console.log(head(map((function(x) {
      return function(y) {
        return x + y;
      };
    })(1))
    (list)
  ));
};
main();