{"id":{"repo_id":"vilnius","oai_identifier":"oai:vu.lt:elaba:308336787"},"canonical_url":"https://search.ndltd.org/etd/vilnius/oai:vu.lt:elaba:308336787","repository":{"repo_id":"vilnius","name":"Vilnius University","base_url":"https://epublications.vu.lt/oai"},"display":{"title":"Category theory applications in computer science /","abstract":"This work investigates how concepts from category theory, which on first sight may seem very abstract, can be applied to practical problems in computer science, particularly in functional programming and formal program verification. The work mainly focuses on such categorical structures as monoids, monads, Kleisli categories and F-coalgebras. By using Haskell programming language, categorical definitions are connected with conrete implementations in functional programming. This makes it possible to show that categorical ideas are not only theoretical constructions, but also useful programming patterns that can be applied for writing more modular and compositional code. The work explains how monoids can be used for composing computations, how monads can simulate impurity in pure functional programs, how Kleisli categories provide composition for effectful computations, and how F-coalgebras can model potentially infinite state-based systems. Apart of exploring different categorical structures, the work also develops a categorical framework, where programs are treated as morphisms, predicates live as objects in a preorder category and predicate transformers capture program meaning through weakest-precondition reasoning. The framework is then extended to handle conditional statements and loops. Categorical ideas such as functors, monoids, coproducts and fixed points give the framework a mathematical shape. In this framework, a minimalistic programming language is represented in categorical terms, while program correctness is checked using Hoare triples. The weakest-precondition functor connects the syntax of programs with their semantic meaning. The framework allows validation of programs over finite memory states. The implemented Haskell prototype shows that this categorical framework can validate sequential programs, conditionals and loops.","abstract_html":"This work investigates how concepts from category theory, which on first sight may seem very abstract, can be applied to practical problems in computer science, particularly in functional programming and formal program verification. The work mainly focuses on such categorical structures as monoids, monads, Kleisli categories and F-coalgebras. By using Haskell programming language, categorical definitions are connected with conrete implementations in functional programming. This makes it possible to show that categorical ideas are not only theoretical constructions, but also useful programming patterns that can be applied for writing more modular and compositional code. The work explains how monoids can be used for composing computations, how monads can simulate impurity in pure functional programs, how Kleisli categories provide composition for effectful computations, and how F-coalgebras can model potentially infinite state-based systems. Apart of exploring different categorical structures, the work also develops a categorical framework, where programs are treated as morphisms, predicates live as objects in a preorder category and predicate transformers capture program meaning through weakest-precondition reasoning. The framework is then extended to handle conditional statements and loops. Categorical ideas such as functors, monoids, coproducts and fixed points give the framework a mathematical shape. In this framework, a minimalistic programming language is represented in categorical terms, while program correctness is checked using Hoare triples. The weakest-precondition functor connects the syntax of programs with their semantic meaning. The framework allows validation of programs over finite memory states. The implemented Haskell prototype shows that this categorical framework can validate sequential programs, conditionals and loops.","abstract_has_math":false,"creators":["Eliseenko, Vitas,"],"institution":"Institutional Repository of Vilnius University","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2026,"date_issued":"2026","date_published":"2026","updated_at":"2026-11-19T10:12:55Z","subjects":["Category theory, functional programming, Haskell, monoid, monad, Kleisli category, F-coalgebra, Hoare logic, weakest precondition, predicate transformer, program semantics, program correctness, categorical abstractions"],"languages":["eng"],"rights":["info:eu-repo/semantics/openAccess"],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://repository.vu.lt/VU:ELABAETD308336787&prefLang=en_US","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://repository.vu.lt/VU:ELABAETD308336787&prefLang=en_US","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":"open","embargo_until":null,"access_note":null},"source_record":{"url":"https://epublications.vu.lt/oai?verb=GetRecord&metadataPrefix=oai_dc&identifier=oai%3Avu.lt%3Aelaba%3A308336787","prefix":"oai_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Eliseenko, Vitas,"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2026"]},{"key":"dc:publisher","label":"Institution","values":["Institutional Repository of Vilnius University"]},{"key":"dc:relation","label":"Dc Relation","values":["https://epublications.vu.lt/object/elaba:308336787/308336787.pdf"]},{"key":"dc:type","label":"Dc Type","values":["info:eu-repo/semantics/bachelorThesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Category theory, functional programming, Haskell, monoid, monad, Kleisli category, F-coalgebra, Hoare logic, weakest precondition, predicate transformer, program semantics, program correctness, categorical abstractions"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["info:eu-repo/semantics/openAccess"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://repository.vu.lt/VU:ELABAETD308336787&prefLang=en_US"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["This work investigates how concepts from category theory, which on first sight may seem very abstract, can be applied to practical problems in computer science, particularly in functional programming and formal program verification. The work mainly focuses on such categorical structures as monoids, monads, Kleisli categories and F-coalgebras. By using Haskell programming language, categorical definitions are connected with conrete implementations in functional programming. This makes it possible to show that categorical ideas are not only theoretical constructions, but also useful programming patterns that can be applied for writing more modular and compositional code. The work explains how monoids can be used for composing computations, how monads can simulate impurity in pure functional programs, how Kleisli categories provide composition for effectful computations, and how F-coalgebras can model potentially infinite state-based systems. Apart of exploring different categorical structures, the work also develops a categorical framework, where programs are treated as morphisms, predicates live as objects in a preorder category and predicate transformers capture program meaning through weakest-precondition reasoning. The framework is then extended to handle conditional statements and loops. Categorical ideas such as functors, monoids, coproducts and fixed points give the framework a mathematical shape. In this framework, a minimalistic programming language is represented in categorical terms, while program correctness is checked using Hoare triples. The weakest-precondition functor connects the syntax of programs with their semantic meaning. The framework allows validation of programs over finite memory states. The implemented Haskell prototype shows that this categorical framework can validate sequential programs, conditionals and loops."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Category theory applications in computer science /","Kategorijų teorijos taikymai informatikoje."]}]}],"canonical_facts":{"dc:creator":["Eliseenko, Vitas,"],"dc:date":["2026"],"dc:description":["This work investigates how concepts from category theory, which on first sight may seem very abstract, can be applied to practical problems in computer science, particularly in functional programming and formal program verification. The work mainly focuses on such categorical structures as monoids, monads, Kleisli categories and F-coalgebras. By using Haskell programming language, categorical definitions are connected with conrete implementations in functional programming. This makes it possible to show that categorical ideas are not only theoretical constructions, but also useful programming patterns that can be applied for writing more modular and compositional code. The work explains how monoids can be used for composing computations, how monads can simulate impurity in pure functional programs, how Kleisli categories provide composition for effectful computations, and how F-coalgebras can model potentially infinite state-based systems. Apart of exploring different categorical structures, the work also develops a categorical framework, where programs are treated as morphisms, predicates live as objects in a preorder category and predicate transformers capture program meaning through weakest-precondition reasoning. The framework is then extended to handle conditional statements and loops. Categorical ideas such as functors, monoids, coproducts and fixed points give the framework a mathematical shape. In this framework, a minimalistic programming language is represented in categorical terms, while program correctness is checked using Hoare triples. The weakest-precondition functor connects the syntax of programs with their semantic meaning. The framework allows validation of programs over finite memory states. The implemented Haskell prototype shows that this categorical framework can validate sequential programs, conditionals and loops."],"dc:format":["application/pdf"],"dc:identifier":["https://repository.vu.lt/VU:ELABAETD308336787&prefLang=en_US"],"dc:language":["eng"],"dc:publisher":["Institutional Repository of Vilnius University"],"dc:relation":["https://epublications.vu.lt/object/elaba:308336787/308336787.pdf"],"dc:rights":["info:eu-repo/semantics/openAccess"],"dc:subject":["Category theory, functional programming, Haskell, monoid, monad, Kleisli category, F-coalgebra, Hoare logic, weakest precondition, predicate transformer, program semantics, program correctness, categorical abstractions"],"dc:title":["Category theory applications in computer science /","Kategorijų teorijos taikymai informatikoje."],"dc:type":["info:eu-repo/semantics/bachelorThesis"]},"updated_at":"2026-11-19T10:12:55Z"}