Basic Programming language for Computable Functions
Budget: $10 – $80 AUD
Haskell project
Develop a type inference algorithm for the simply typed lambda calculus with fixed points, pairs, natural numbers, and lists: I call this the Basic Programming language for Computable Functions (BPCF).
To achieve this you will need to collect the type of equations and solve them incrementally. In addition, as an optional extra, you can arrange for programs applied to values to be evaluated on the modern SECD machine.
bid only if you have the skills to discuss more
Develop a type inference algorithm for the simply typed lambda calculus with fixed points, pairs, natural numbers, and lists: I call this the Basic Programming language for Computable Functions (BPCF).
To achieve this you will need to collect the type of equations and solve them incrementally. In addition, as an optional extra, you can arrange for programs applied to values to be evaluated on the modern SECD machine.
bid only if you have the skills to discuss more