{"id":13610660,"url":"https://github.com/olewhalehunter/libra","last_synced_at":"2025-04-13T01:32:08.226Z","repository":{"id":81164335,"uuid":"103774291","full_name":"olewhalehunter/libra","owner":"olewhalehunter","description":"a lazy interpreter of binary relational algebra ","archived":false,"fork":false,"pushed_at":"2017-09-20T02:45:01.000Z","size":53,"stargazers_count":2,"open_issues_count":0,"forks_count":1,"subscribers_count":3,"default_branch":"master","last_synced_at":"2024-08-01T19:55:28.637Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"Prolog","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/olewhalehunter.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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}},"created_at":"2017-09-16T18:22:11.000Z","updated_at":"2022-11-14T05:19:23.000Z","dependencies_parsed_at":"2023-10-29T04:00:48.182Z","dependency_job_id":null,"html_url":"https://github.com/olewhalehunter/libra","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/olewhalehunter%2Flibra","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/olewhalehunter%2Flibra/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/olewhalehunter%2Flibra/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/olewhalehunter%2Flibra/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/olewhalehunter","download_url":"https://codeload.github.com/olewhalehunter/libra/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":223558243,"owners_count":17165094,"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-08-01T19:01:46.831Z","updated_at":"2024-11-07T17:30:19.232Z","avatar_url":"https://github.com/olewhalehunter.png","language":"Prolog","funding_links":[],"categories":["Uncategorized"],"sub_categories":["Uncategorized"],"readme":"# Libra - Lazy Interpreter of Binary Relational Algebra\n\n* What is [Relational Programming](http://cs.adelaide.edu.au/~dwyer/TR95-10_TOC.html)?\n* [William E. Byrd on Relational Programming with miniKanren](https://www.youtube.com/watch?v=8gh4Ald4yZQ)\n* [Bruce MacLennan, 1983](https://calhoun.nps.edu/bitstream/handle/10945/29066/relationalprogra83012macl.pdf)\n\n\"Ordinary programming languages calculate functions. Sometimes a function is inappropriate. For example, 4 has two square roots, +2 and -2, but an ordinary programming language provides a sqrt function that returns only one of the roots. So if we want to find both roots of a quadratic equation, we have to deal with each root separately. In a relational language, we need only to specify one solution, and the program will find both. This is because it will treat sqrt as a binary relation. A binary relation is similar in concept to a function, but can map an argument to any number of values (including zero).\n\nRelations have many uses in computer science. The Z Specification Language makes heavy use of relational algebra notation. One reason is that programs are usually required to establish an input-output relationship, but there are often many outputs that are allowable. For example, a program may be asked to find any solution to a problem, or it may be asked to list all solutions, but in no particular order. A functional specification is bound to specify some particular solution or some particular order. A functional specification is usually an over-specification. \"\n\nported to GNU Prolog from Barry Dwyer's Open Prolog (defunct) source","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Folewhalehunter%2Flibra","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Folewhalehunter%2Flibra","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Folewhalehunter%2Flibra/lists"}