{"id":16559718,"url":"https://github.com/psub/master-thesis","last_synced_at":"2026-03-07T19:32:28.559Z","repository":{"id":16394344,"uuid":"19145115","full_name":"pSub/master-thesis","owner":"pSub","description":"A Language for the Specification and Efficient Implementation of Type Systems","archived":false,"fork":false,"pushed_at":"2025-09-26T07:11:59.000Z","size":1681,"stargazers_count":5,"open_issues_count":0,"forks_count":1,"subscribers_count":8,"default_branch":"master","last_synced_at":"2025-09-26T09:15:16.789Z","etag":null,"topics":["automated-theorem-provers","domain-specific-language","master-thesis","typesystem"],"latest_commit_sha":null,"homepage":"","language":"TeX","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/pSub.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}},"created_at":"2014-04-25T12:23:17.000Z","updated_at":"2025-09-26T07:12:03.000Z","dependencies_parsed_at":"2022-09-15T18:13:10.112Z","dependency_job_id":null,"html_url":"https://github.com/pSub/master-thesis","commit_stats":null,"previous_names":[],"tags_count":1,"template":false,"template_full_name":null,"purl":"pkg:github/pSub/master-thesis","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pSub%2Fmaster-thesis","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pSub%2Fmaster-thesis/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pSub%2Fmaster-thesis/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pSub%2Fmaster-thesis/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/pSub","download_url":"https://codeload.github.com/pSub/master-thesis/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pSub%2Fmaster-thesis/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":30227851,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-03-07T19:01:10.287Z","status":"ssl_error","status_checked_at":"2026-03-07T18:59:58.103Z","response_time":53,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"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":["automated-theorem-provers","domain-specific-language","master-thesis","typesystem"],"created_at":"2024-10-11T20:26:54.609Z","updated_at":"2026-03-07T19:32:28.548Z","avatar_url":"https://github.com/pSub.png","language":"TeX","funding_links":[],"categories":[],"sub_categories":[],"readme":"A Language for the Specification and Efficient Implementation of Type Systems\n===\n\nAbstract\n---\n\nType systems are important tools to detect semantic inconsistencies,\nto establish abstractions and to guide programmers in the development\nprocess. However, there is currently a lack of established tools\nsupporting the development of type systems, tools like lexer and\nparser generators but for type systems. We introduce a declarative\nspecification language for type systems that allows to specify type\nsystems in a natural deductive style. We generate two products out of\na type system specification: A first-order formula representation to\nfacilitate the use of automated theorem provers and a type\nchecker. The type checker generator uses results proven by automated\ntheorem provers to check the applicability of optimization strategies\nand the first-order formula representation is also a reference\nimplementation. Both results aim to accelerate the development cycle\nfor type systems and to narrow the gap between theory and practice.\n\nQuick-Start-Guide\n---\n\n    * Clone repository\n    * Install vampire and make sure it is in PATH\n    * Install Eclipse plugin Spoofax (https://spoofax.dev/getting-started/)\n    * Import project into Eclipse\n    * Build the project to make sure everything works\n    * Restart Eclipse\n    * Choose a type system from the folder syntax/specification/\n    * Comment all lines after `rules`\n    * Click on `Generation` -\u003e `Generate SDF`\n    * Build the project again\n    * Uncomment the lines after `rules`\n\nNow you are ready to select actions from the `Typecheck` and\n`Verification` menus, add new typing rules and conjectures. Changes in\nthe sections meta-variables, contexts and judgments require the\nregeneration of the sdf file and a rebuild of the project.\n\nDocuments\n---\n\n   * [Master thesis](https://users.pascal-wittmann.de/pascal/master-thesis/thesis.pdf)\n   * [Slides of the defense](https://users.pascal-wittmann.de/pascal/master-thesis/slides-of-the-defense.pdf)\n   * [Summary for SPLASH SRC application](https://users.pascal-wittmann.de/pascal/master-thesis/summary-for-splash-src-application.pdf)\n   * [Slides for SRC at SPLASH](https://users.pascal-wittmann.de/pascal/master-thesis/slides-for-src-at-splash.pdf)\n   * [Poster for SPLASH Poster Track](https://users.pascal-wittmann.de/pascal/master-thesis/poster-for-splash.pdf)\n   * [Slides for the HessPL workshop](https://users.pascal-wittmann.de/pascal/master-thesis/slides-for-hesspl.pdf)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpsub%2Fmaster-thesis","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fpsub%2Fmaster-thesis","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpsub%2Fmaster-thesis/lists"}