| Language: | Slovenian |
|---|---|
| Year of publishing: | 2024 |
| Typology: | 2.11 - Undergraduate Thesis |
| Organization: | UL FRI - Faculty of Computer and Information Science |
| Publisher: | [K. Bogataj] |
| UDC: | 004:51(043.2) |
| COBISS: |
214135811
|
| Views: | 95 |
| Downloads: | 9 |
| Average score: | 0 (0 votes) |
| Metadata: |
|
| Secondary language: | English |
|---|---|
| Secondary title: | Implementation and optimization of impossible functionals |
| Secondary abstract: | In this work, I address the so-called infinite functionals, which enable the exhaustive search of infinite compact sets. I implement a search function for predicates on the Cantor set in the lazy functional programming language Haskell. I implement optimizations using various techniques, some of which exploit lazy evaluation, I also implement pure functional memoization. I explain the operation of computational effects using monads and apply them for monadic optimizations of the search function. |
| Secondary keywords: | functional;Cantor set;monad;memoization;computer science;computer and information science;computer science and mathematics;interdisciplinary studies;diploma; |
| Type (COBISS): | Bachelor thesis/paper |
| Study programme: | 1000407 |
| Thesis comment: | Univ. v Ljubljani, Fak. za računalništvo in informatiko |
| Pages: | 1 spletni vir (1 datoteka PDF (41 str.)) |
| ID: | 25392610 |