{"id":{"repo_id":"bu","oai_identifier":"oai:open.bu.edu:2144/49330"},"canonical_url":"https://search.ndltd.org/etd/bu/oai:open.bu.edu:2144/49330","repository":{"repo_id":"bu","name":"Boston University","base_url":"https://open.bu.edu/oai/request"},"display":{"title":"PULER","abstract":"We address the prevalent challenge of Algebraic Data Type duplication in compiler implementations, which results in increased effort, diminished functionality, and complications in synchronizing language constructs across the compiler. To investigate a novel design solution, we present Tree Shaping, a solution to the expression problem. We then implement an experimental compiler using Tree Shaping and examine its potential implications. This compiler processes programs written in PULER, an ML-based programming language that boasts distinct features such as unification rules for type mismatches. Contrary to traditional compilers that terminate and generate an error when encountering a type mismatch, PULER regards type mismatches as first-class citizens.","abstract_html":"We address the prevalent challenge of Algebraic Data Type duplication in compiler implementations, which results in increased effort, diminished functionality, and complications in synchronizing language constructs across the compiler. To investigate a novel design solution, we present Tree Shaping, a solution to the expression problem. We then implement an experimental compiler using Tree Shaping and examine its potential implications. This compiler processes programs written in PULER, an ML-based programming language that boasts distinct features such as unification rules for type mismatches. Contrary to traditional compilers that terminate and generate an error when encountering a type mismatch, PULER regards type mismatches as first-class citizens.","abstract_has_math":false,"creators":["El Mabsout, Bassel"],"institution":"Boston University","degree_name":"Master of Science","degree_level":"masters","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":["Mancuso, Renato"],"committee_chairs":[],"committee_members":[],"year":2023,"date_issued":"2023","date_published":"2023","updated_at":"2026-11-18T20:14:09Z","subjects":["Computer science","Compiler design","Programming languages"],"languages":["en_US"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[{"key":"dc:identifier.orcid","label":"ORCID","values":["0000-0002-7969-0096"],"render_values":[{"text":"0000-0002-7969-0096","href":"https://orcid.org/0000-0002-7969-0096","code":true}]}]},"links":{"outbound_url":"https://hdl.handle.net/2144/49330","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/2144/49330","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://open.bu.edu/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aopen.bu.edu%3A2144%2F49330","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Mancuso, Renato"]},{"key":"dc:creator","label":"Author","values":["El Mabsout, Bassel"]},{"key":"dc:identifier.orcid","label":"ORCID","values":["0000-0002-7969-0096"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2024-09-25T14:53:00Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2024-09-25T14:53:00Z"]},{"key":"dc:date.issued","label":"Date","values":["2023"]},{"key":"dc:date.updated","label":"Dc Date Updated","values":["2024-09-25T01:01:42Z"]},{"key":"dc:type","label":"Dc Type","values":["Thesis/Dissertation"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Boston University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer science","Compiler design","Programming languages"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/2144/49330"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["We address the prevalent challenge of Algebraic Data Type duplication in compiler implementations, which results in increased effort, diminished functionality, and complications in synchronizing language constructs across the compiler. To investigate a novel design solution, we present Tree Shaping, a solution to the expression problem. We then implement an experimental compiler using Tree Shaping and examine its potential implications. This compiler processes programs written in PULER, an ML-based programming language that boasts distinct features such as unification rules for type mismatches. Contrary to traditional compilers that terminate and generate an error when encountering a type mismatch, PULER regards type mismatches as first-class citizens."]},{"key":"dc:title","label":"Title","values":["PULER"]}]}],"canonical_facts":{"dc:contributor.advisor":["Mancuso, Renato"],"dc:creator":["El Mabsout, Bassel"],"dc:date.accessioned":["2024-09-25T14:53:00Z"],"dc:date.available":["2024-09-25T14:53:00Z"],"dc:date.issued":["2023"],"dc:date.updated":["2024-09-25T01:01:42Z"],"dc:description.abstract":["We address the prevalent challenge of Algebraic Data Type duplication in compiler implementations, which results in increased effort, diminished functionality, and complications in synchronizing language constructs across the compiler. To investigate a novel design solution, we present Tree Shaping, a solution to the expression problem. We then implement an experimental compiler using Tree Shaping and examine its potential implications. This compiler processes programs written in PULER, an ML-based programming language that boasts distinct features such as unification rules for type mismatches. Contrary to traditional compilers that terminate and generate an error when encountering a type mismatch, PULER regards type mismatches as first-class citizens."],"dc:identifier.orcid":["0000-0002-7969-0096"],"dc:identifier.uri":["https://hdl.handle.net/2144/49330"],"dc:language.iso":["en_US"],"dc:subject":["Computer science","Compiler design","Programming languages"],"dc:title":["PULER"],"dc:type":["Thesis/Dissertation"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["masters"],"thesis:degree_name":["Master of Science"],"thesis:institution_name":["Boston University"]},"updated_at":"2026-11-18T20:14:09Z"}