{"id":17770783,"url":"https://github.com/sacerdot/minimalist-type-theory-in-lambda-prolog","last_synced_at":"2026-01-08T19:32:26.160Z","repository":{"id":68221250,"uuid":"68519730","full_name":"sacerdot/Minimalist-Type-Theory-In-Lambda-Prolog","owner":"sacerdot","description":"An implementation in Lambda-Prolog of the Minimalist Type Theory","archived":false,"fork":false,"pushed_at":"2018-12-08T14:20:19.000Z","size":9891,"stargazers_count":4,"open_issues_count":6,"forks_count":3,"subscribers_count":4,"default_branch":"master","last_synced_at":"2025-02-07T09:33:44.342Z","etag":null,"topics":["lambdaprolog","proof-checking","type-theory"],"latest_commit_sha":null,"homepage":"","language":"Prolog","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/sacerdot.png","metadata":{"files":{"readme":"README","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":"2016-09-18T12:20:47.000Z","updated_at":"2023-02-12T22:42:21.000Z","dependencies_parsed_at":null,"dependency_job_id":"a7ad1a3b-ba9e-4310-8b32-af1e76ffb7f3","html_url":"https://github.com/sacerdot/Minimalist-Type-Theory-In-Lambda-Prolog","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/sacerdot%2FMinimalist-Type-Theory-In-Lambda-Prolog","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sacerdot%2FMinimalist-Type-Theory-In-Lambda-Prolog/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sacerdot%2FMinimalist-Type-Theory-In-Lambda-Prolog/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sacerdot%2FMinimalist-Type-Theory-In-Lambda-Prolog/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sacerdot","download_url":"https://codeload.github.com/sacerdot/Minimalist-Type-Theory-In-Lambda-Prolog/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246660077,"owners_count":20813338,"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":["lambdaprolog","proof-checking","type-theory"],"created_at":"2024-10-26T21:27:07.142Z","updated_at":"2026-01-08T19:32:21.128Z","avatar_url":"https://github.com/sacerdot.png","language":"Prolog","funding_links":[],"categories":[],"sub_categories":[],"readme":"TODO:\na) test.elpi: splittare in codice di testing (un file) + libreria di tests (un altro file)\nb) commentare i predicati entry-point (completato per gli entry-point dell'estrazione)\nz) passare a un if-then-else al posto di (a, ! ; b)\n\nFOOD FOR BRAIN:\n1. abstract common code in extraction/{starify,extract,_...}_lib and main/process_entry\n2. dal momento che l'input del extract_* non è ben tipato, durante l'iterazione\n   sulle lib entry è inutile assumere tutte le ipotesi di tipaggio/conversione\n\n===========\n\n## Code extraction ##\n* test.elpi:\n  - pack_and_translate_library:  entrypoint\n  - translib:                    entrypoint for debugging on Index-th entry\n  - translate_entry:             obvious\n  - ...\n  - library of micro-tests for extraction, etc.\n\n  * lib_mapping: old_entry extracted_entry mask\n\n  - starify_lib: well typed (wt) MTTi -\u003e (wt) MTTi\n      \u003c\u003e propS |-\u003e extractor_singleton\n  - extract_lib: (wt) MTTi -\u003e (wt) MTTi\n  - translate_lib: (wt) MTTi -\u003e {OCaml,Haskell}\n  - translate_program_list: traduce frammenti wt MTTi -\u003e^3 {OCaml,Haskell}\n  - get_call_signature:\n\n* extraction.elpi:\n  defines {starify,extract}_lib\n\n* to_language.elpi:\n  defines translate_lib\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsacerdot%2Fminimalist-type-theory-in-lambda-prolog","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsacerdot%2Fminimalist-type-theory-in-lambda-prolog","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsacerdot%2Fminimalist-type-theory-in-lambda-prolog/lists"}