{"id":15563738,"url":"https://github.com/glutexo/y","last_synced_at":"2025-09-19T06:33:16.881Z","repository":{"id":67724678,"uuid":"158524779","full_name":"Glutexo/y","owner":"Glutexo","description":"Different approaches to a factorial, hopefully resulting in using a combinator","archived":false,"fork":false,"pushed_at":"2018-12-22T13:04:11.000Z","size":4,"stargazers_count":0,"open_issues_count":2,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-01-19T06:40:51.162Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Ruby","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Glutexo.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2018-11-21T09:39:53.000Z","updated_at":"2018-12-22T13:04:13.000Z","dependencies_parsed_at":"2024-04-19T08:48:54.254Z","dependency_job_id":null,"html_url":"https://github.com/Glutexo/y","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Glutexo%2Fy","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Glutexo%2Fy/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Glutexo%2Fy/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Glutexo%2Fy/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Glutexo","download_url":"https://codeload.github.com/Glutexo/y/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243222824,"owners_count":20256345,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-10-02T16:25:40.222Z","updated_at":"2025-09-19T06:33:11.825Z","avatar_url":"https://github.com/Glutexo.png","language":"Ruby","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Factorials, combined #\n\n## Intro ##\n\nI started hearing about the “Y combinator” from many directions. Since functional programming is appealing to me, I’d like to get to know more about this mythical beast.\n\nThere is [an exhaustive article][link] on this topic. It explains the idea on a factorial function, mostly using Scheme. I started with the two approaches using Ruby, going only one bit at a time.\n\n## Howto ##\n\nInstall the dependencies.\n\n```\n$ bundle install\n```\n\nRun the tests.\n\n```\n$ ruby test.rb\n```\n\nRun the non-recursive factorial.\n\n```\n$ ruby run.rb 20\n```\n\n## Progress ##\n\n* [x] Write a non-recursive factorial using a loop\n* [x] Write a recursive factorial using a named function\n* [ ] Write a recursive factorial using only lambdas\n* [ ] ???\n* [ ] Profit\n\n## Links ##\n\n* [The Y Combinator (Slight Return)][link] by Mike Vainer\n\n[link]: https://mvanier.livejournal.com/2897.html","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fglutexo%2Fy","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fglutexo%2Fy","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fglutexo%2Fy/lists"}