coder054

/**
 * DERIVING THE Y COMBINATOR IN 7 EASY STEPS
 *
 * Ionut G. Stan  |  [email protected]  |  http://igstan.ro  |  http://twitter.com/igstan
 *
 *
 * The Y combinator is a method of implementing recursion in a programming
 * language that does not support it natively (actually, it's used more for
 * exercising programming brains). The requirement is the language to support
 * anonymous functions.

coder054

function cons(x, y) {
  return function(w) { return w(x, y) };
};

function car(z) {
  return z(function(x, y) { return x });
};

function cdr(z) {
  return z(function(x, y) { return y });

coder054

-module(words).
-export([strlen/1]).
%Assignment: Write a function that uses recursion to return the number of words in a string.

% If we send an empty list, return 0.
strlen([]) -> 0;
%Entry point for this module
strlen(Sentence) -> count(Sentence, 1).
 %Base case. When its finally empty return the sum count.
 count([], Count) -> Count;

coder054

// Add a 401 response interceptor
window.axios.interceptors.response.use(function (response) {
    return response;
}, function (error) {
    if (401 === error.response.status) {
        swal({
            title: "Session Expired",
            text: "Your session has expired. Would you like to be redirected to the login page?",
            type: "warning",
            showCancelButton: true,

coder054

noremap f e
noremap p r
noremap b t
noremap j y
noremap l u
noremap u i
noremap y o
noremap ' p
noremap r s
noremap s d