{"id":16312238,"url":"https://github.com/namin/scalogno","last_synced_at":"2025-03-20T21:31:53.705Z","repository":{"id":10933171,"uuid":"13237867","full_name":"namin/scalogno","owner":"namin","description":"prototyping logic programming in Scala","archived":false,"fork":false,"pushed_at":"2022-03-25T21:33:36.000Z","size":241,"stargazers_count":41,"open_issues_count":0,"forks_count":9,"subscribers_count":7,"default_branch":"aplas","last_synced_at":"2025-03-08T18:49:14.100Z","etag":null,"topics":["logic-programming","metaprogramming","scala","smt","tabling"],"latest_commit_sha":null,"homepage":null,"language":"Scala","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":"ahmontero/dop","license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/namin.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}},"created_at":"2013-10-01T07:53:17.000Z","updated_at":"2024-11-24T16:13:29.000Z","dependencies_parsed_at":"2022-09-01T12:22:44.882Z","dependency_job_id":null,"html_url":"https://github.com/namin/scalogno","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/namin%2Fscalogno","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/namin%2Fscalogno/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/namin%2Fscalogno/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/namin%2Fscalogno/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/namin","download_url":"https://codeload.github.com/namin/scalogno/tar.gz/refs/heads/aplas","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244085005,"owners_count":20395523,"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":["logic-programming","metaprogramming","scala","smt","tabling"],"created_at":"2024-10-10T21:47:30.026Z","updated_at":"2025-03-20T21:31:53.453Z","avatar_url":"https://github.com/namin.png","language":"Scala","funding_links":[],"categories":[],"sub_categories":[],"readme":"scalogno\n========\n\nScalogno as presented in APLAS'19 ([PDF](https://namin.seas.harvard.edu/files/namin/files/scalogno.pdf)).\n\n- [2.1 Relations as Functions](src/test/scala/scalogno/core.scala#L274)\n- [2.1 edge example](src/test/scala/scalogno/core.scala#L281)\n- [2.1 path def example](src/main/scala/scalogno/core.scala#L189)\n- [2.1 path example](src/test/scala/scalogno/core.scala#L289)\n- [2.2 Higher-Order Relations as Higher-Order Functions](src/test/scala/scalogno/core.scala#L299)\n- [2.2 reflexive transitive closure](src/test/scala/scalogno/core.scala#L318)\n- [2.3 Object-Oriented Encapsulation](src/main/scala/scalogno/core.scala#L186)\n- [2.3 example](src/test/scala/scalogno/core.scala#L272)\n- [3.1 Designing Logic Engines for Meta-Programming (Fig 1)](src/main/scala/scalogno/engine.scala)\n- [3.3 path rule def example](src/test/scala/scalogno/core.scala#L336)\n- [3.3 path example](src/test/scala/scalogno/core.scala#L347)\n- [3.4 Clause Reification as Controlled Side Effect](src/main/scala/scalogno/meta.scala#L62)\n\n- [4 fib example](src/test/scala/scalogno/tabling.scala#L91)\n- [4.2 Memoization with Symbolic State Transitions](src/main/scala/scalogno/tabling.scala)\n- [4.3 Example: Tabled Graph Evaluation](src/test/scala/scalogno/tabling.scala#L133)\n- [4.3 example](src/test/scala/scalogno/tabling.scala#L192)\n- [4.4 Definite Clause Grammar (DFG)](src/test/scala/scalogno/tabling.scala#L6)\n- [4.4 example](src/test/scala/scalogno/tabling.scala#L28)\n\nBeyond APLAS:\n\n- the [all](https://github.com/namin/scalogno/tree/all) branch adds an SMT solver as a backend, and combines it with tabling too. Work remains to refactor the combination into composable modules, and ... find a killer app beyond shortest paths. :)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnamin%2Fscalogno","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnamin%2Fscalogno","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnamin%2Fscalogno/lists"}