Are you interested in designing functional program?
In this course you will learn about the latest work on the design, implementations, principles, and uses of functional programming. It will covers the entire spectrum of work, from practice to theory, including its peripheries. The topics include are testing and debugging functional reactive programming, generic functional parallel algorithms: scan and FFT , prototyping a query compiler using Coq, symbolic conditioning of arrays in probabilistic programs, Space-Search and so on.
Assessment
This course does not involve any written exams. Students need to answer 5 assignment questions to complete the course, the answers will be in the form of written work in pdf or word. Students can write the answers in their own time. Each answer needs to be 200 words (1 Page). Once the answers are submitted, the tutor will check and assess the work.
Certification
Edukite courses are free to study. To successfully complete a course you must submit all the assignment of the course as part of the assessment. Upon successful completion of a course, you can choose to make your achievement formal by obtaining your Certificate at a cost of £49.
Having an Official Edukite Certification is a great way to celebrate and share your success. You can:
- Add the certificate to your CV or resume and brighten up your career
- Show it to prove your success
Course Credit: University of Oxford
Course Curriculum
| Module: 01 | |||
| Compositional Creativity: Some Principles for Talking to Computers | 00:54:00 | ||
| Super 8 Languages for Making Movies (Functional Pearl) | 00:17:00 | ||
| Testing and Debugging Functional Reactive Programming | 00:18:00 | ||
| Lock-Step Simulation Is Child’s Play (Experience Report) | 00:16:00 | ||
| Scaling up Functional Programming Education: Under the Hood of the OCaml MOOC | 00:19:00 | ||
| Faster Coroutine Pipelines | 00:19:00 | ||
| A Pretty But Not Greedy Printer (Functional Pearl) | 00:14:00 | ||
| Generic Functional Parallel Algorithms: Scan and FFT | 00:19:00 | ||
| Module: 02 | |||
| A Unified Approach to Solving Seven Programming Problems (Functional Pearl) | 00:20:00 | ||
| Prototyping a Query Compiler using Coq (Experience Report) | 00:19:00 | ||
| A Framework for Adaptive Differential Privacy | 00:18:00 | ||
| Symbolic Conditioning of Arrays in Probabilistic Programs | 00:17:00 | ||
| Abstracting Definitional Interpreters | 00:19:00 | ||
| On the Expressive Power of User-Defined Effects: Effect Handlers, Monadic Reflection, Delimited Control | 00:18:00 | ||
| Imperative Functional Programs that Explain their Work | 00:18:00 | ||
| Module: 03 | |||
| Effect-Driven QuickChecking of Compilers | 00:18:00 | ||
| Assuring AI | 00:53:00 | ||
| Persistence for the Masses: RRB-Vectors in a Systems Language | 00:18:00 | ||
| Verified Low-Level Programming Embedded in F | 00:18:00 | ||
| A Relational Logic for Higher-Order Programs | 00:17:00 | ||
| Verifying Efficient Function Calls in CakeML | 00:20:00 | ||
| Better Living through Operational Semantics: An Optimizing Compiler for Radio Protocols | 00:18:00 | ||
| Module: 04 | |||
| How to Prove Your Calculus Is Decidable: Practical Applications of Second-Order Algebraic Theories and Computation | 00:17:00 | ||
| Foundations of Strong Call by Need | 00:19:00 | ||
| No-Brainer CPS Conversion | 00:14:00 | ||
| Kami: A Platform for High-Level Parametric Hardware Specification and Its Modular Verification | 00:19:00 | ||
| SpaceSearch: A Library for Building and Verifying Solver-Aided Tools | 00:18:00 | ||
| Local Refinement Typing | 00:14:00 | ||
| Compiling to Categories | 00:18:00 | ||
| Module: 05 | |||
| Visitors Unchained | 00:18:00 | ||
| Herbarium Racketensis: A Stroll through the Woods (Functional Pearl) | 00:20:00 | ||
| A Specification for Dependent Types in Haskell | 00:19:00 | ||
| Normalization by Evaluation for Sized Dependent Types | 00:20:00 | ||
| A Metaprogramming Framework for Formal Verification | 00:16:00 | ||
| Whip: Higher-Order Contracts for Modern Services | 00:18:00 | ||
| Manifest Sharing with Session Types | 00:21:00 | ||
| Module: 06 | |||
| Gradual Session Types | 00:20:00 | ||
| Theorems for Free for Free: Parametricity, With and Without Types | 00:20:00 | ||
| On Polymorphic Gradual Typing | 00:18:00 | ||
| Gradual Typing with Union and Intersection Types | 00:17:00 | ||
| Constrained Type Families | 00:16:00 | ||
| Automating Sized-Type Inference for Complexity Analysis | 00:19:00 | ||
| Inferring Scope through Syntactic Sugar | 00:17:00 | ||
| Assessment | |||
| Submit Your Assignment | 00:00:00 | ||
| Certification | 00:00:00 | ||
Course Reviews
No Reviews found for this course.
Related Courses
