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
Hello Kevin,
I will work on this project until I get good results and complete all the tasks.
I am prepared to handle projects requiring Engineering skills.
Lets connect in chat so that we discuss further.
Zied B.
Hello, a pleasure to greet you, my name is Mubasir, I would be interested in working on your project, I have immediate availability I remain attentive to your comment
Hi. Experienced RUST developer here with 5+ years of hands-on experience in RUST development. I've worked on numerous SaaS-based web applications during the course of this time. To understand this scope better, I would appreciate your answers to my following relevant questions:
1. Can you share the complete scope of this project?
2. What are the user types of this application?
3. Can you share the mockup designs for the application?
Happy to provide you with my relevant portfolio work within the chat. Kindly initiate the chat so we can thoroughly discuss the scope of this project. Thanks!