Proofs weak_pumping and pumping
Budget: $30 – $250 USD
1 day, $70. for:
2 proofs you will provide (weak_pumping and pumping) must differ significantly from the ones I previously shared with you, as well as any existing proofs available on the Internet. The order of tactics, the overall structure, and the content should be distinct in such a way that it is impossible to recognize any relationship between the proofs you write and those available online.
Additionally, it is crucial that the proofs are error-free when executed in Cook.
you need to complete:(don't change signature just complete the code where written (* FILL IN HERE *) to
1.weak_pumping
2.pumping
from the next file that I will send to you (IndProp)
don't use other imports that are not in this file.
Objective:
The project should involve basic implementation and the utilization of tactics in Coq, drawing concepts from selected chapters in the "Software Foundations" book (https://softwarefoundations.cis.upenn.edu/lf-current/toc.html).
chapters:
Functional Programming in Coq
Proof by Induction
Working with Structured Data
Polymorphism and Higher-Order Functions
More Basic Tactics
Logic in Coq
Inductively Defined Propositions
Total and Partial Maps
The Curry-Howard Correspondence
Simple Imperative Programs
More Automation
2 proofs you will provide (weak_pumping and pumping) must differ significantly from the ones I previously shared with you, as well as any existing proofs available on the Internet. The order of tactics, the overall structure, and the content should be distinct in such a way that it is impossible to recognize any relationship between the proofs you write and those available online.
Additionally, it is crucial that the proofs are error-free when executed in Cook.
you need to complete:(don't change signature just complete the code where written (* FILL IN HERE *) to
1.weak_pumping
2.pumping
from the next file that I will send to you (IndProp)
don't use other imports that are not in this file.
Objective:
The project should involve basic implementation and the utilization of tactics in Coq, drawing concepts from selected chapters in the "Software Foundations" book (https://softwarefoundations.cis.upenn.edu/lf-current/toc.html).
chapters:
Functional Programming in Coq
Proof by Induction
Working with Structured Data
Polymorphism and Higher-Order Functions
More Basic Tactics
Logic in Coq
Inductively Defined Propositions
Total and Partial Maps
The Curry-Howard Correspondence
Simple Imperative Programs
More Automation