Third Post 22/08/2021

This week I wasn't as active in this assignment. This is because I all but finished it! I finished the integration and found the bug, shortly after the previous post. I then got to do online schooling wher I mostly worked on other assignments and things I have been very busy with and putting off in this assignment. I am not going to implement custom data types yet, and am going to do that after the prototype is due, although I am begginging to fear this moment. This is because I hvae tried to write the code to fit in with this but I have not stuck tothat and a lot of the code base relies on only ever using 0 and s so updating it is going to be an almost complete refactor of the system. In other news I also thought of an idea. I think I might be able to run some sort of logic programming / nondeterminstic algorithm with the splitting of the call stack. Although I am having a hard time building out this idea with purely numbers, I might be able to get a better understanding of what might be possible after I start development on custom data types (specifically lists). I was thinking a non-deterministic sorting algortihm could be cool, if very slow (as I didn't use real concurrency I emulated it through cycling through multiple call stacks). As I didn't do much this week I didn't face many challenges. It has been a while since I fixed that bug (and I just finished a hackathon) so I can't tell you what was the problem and how it was solved, I remember it taking no more than a couple hours. As of now I am waiting on the document desdribing exaclty what we need to submit for the prototype, and then I will do so. One thing I need to consider is to research as to how unique my idea is and total functional programming languages. I had this idea before I really knew that much about total functional programming languages so I might have ended up implementing something that already exists, or has been solved by smarter people than I. I am currently way ahead of the timeline put out in my PDD (project definition document, this was pasted in the initial post), although as mentioned previously, this was due to an increased focus on this assignment which I am now refocusing onto other assignments. What I will probably work on next week is finishing up, polishing the code, refactoring the code to be a bit nicer, adding comments and anyhting else requried by the prototype assignment document (which has yet to be released).

Comments

Post a Comment

Popular posts from this blog

Fifth post

 This week I was reading a bit about maths and other things and discovered that my approach to primitive recursion has already been done. It is called structural recursion https://en.wikipedia.org/wiki/Structural_induction. (this is about my definition of primitive recursion, not the integration. Also as a side note, I am using primitive recursion in place of terminating recursion because I am lazy with my terminology, I apologize). I also realized that my project wasn't that interesting and that my type system especially was kinda lame. I feel as if I can go harder and make my type system more interesting and worth doing. I also feel that the amount of time I've given myself too much time so I'll end up not really doing much for most of it. Due to these reasons, I have been exploring some type theories to see if there's anything I can mangle into a type system for this assignment.  The main candidates (so far, this is early days of research) are: - Hindley Milner ...
Read more

Twelfth post (end post)

This is the conclusion of the project. As I write this I have completely finished the language to where I wanted it to be. I am very happy with how it turned out. I am currently trying to describe the project mathematically and write a proof that the non-deterministic execution environment that I wrote does in fact halt.  It was fun to work on a long-form project like this, I have never done something as massive as this before and it was cool to do. I think I got to 1.2k lines which doesn't sound like much but it is 1.2k lines of some serious thinking. Not a lot of filler code in the project. On that note I did really have to think hard creating this, there were a lot of algorithms that I didn't have the time to read about and learn so I had to write them myself. It was challenging and very fun.  I think at the start of this project I didn't really have the strongest grasp on the areas I was talking about, but as time has gone on, especially lately, I have come to really un...
Read more

Fourth Post

I did a little bit of commenting and added a tutorial to make the project suitable to submit. During this I discovered a problem with my defininition of primitive functions, but it is too late to fix before the prototype is due. I am planning to update the defintion to probably just be the primitive functions, although I am considering two alternatives, substructural or hilbert recursion. I then submitted the project and will do no further work for a few weeks while I catch up on other assignments. note: I did miss last weeks blog post and probably did the work listed above then, it's hard to remember, it's been very hectic. Sorry I'll try to stick closer to the one post a week format from now on.
Read more