First project overview

The project I am going for is a total functional programming language. The thing that makes it unique is a way of implementing the integration between primitive and non-primitive functions. 

the idea is summarized below:

In most total functional programming languages, the relationship to non-total functions within that language is often poorly made and poorly thought out. This project attempts to rectify this with a better system for implementing composition on primitive and non-primitive (or the equivalent in a different system) recursive functions. This is achieved through branching computation and making use of the bottom type for hypothetical non-halting functions.

For future reference the base of this language is built around the mu-recursive functions / Peano arithmetic, this ends up being similar to the ml family. The full specification of this language will be written later on.

The initial timetable is below:

Deliverable

Duration

Completion Date

Dependencies

Further research into Walther recursion

1 Day

Monday week 3

None

Formal language specification

2-3 Days

Friday week 3

Further research into Walther recursion

Lexer

1 afternoon

Saturday week 3

None (maybe formal language specification)

Parser

2-3 Days

Wednesday week 4

Lexer (for testing), Formal language specification

Base execution engine

1-2 Week/s

week 7

Parser, Formal language specification

Primitive recursion semantics checker

2 days - 2 weeks

week 7

Parser, Formal language specification

Primitive - non primitive integration 

1-2 week/s

week 7

Primitive recursion semantics checker, Formal language specification, Base execution Engine (note: it might be helpful to write this at the same time as the base execution engine)

Extension with ml like algebraic data types and prolog esque argument unification

2-5 weeks

Week 14

Primitive recursion semantics checker, Formal language specification, base Execution Engine, Primitive - non Primitive integration

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