View Proposal
-
Proposer
-
Marko Doko
-
Title
-
Converting primitive recursion to folding in Isabelle/HOL
-
Goal
-
-
Description
- This project is part of a bigger research project to improve on how proofs about programming languages are done. Every primitive recursive function can be expressed as a fold. The goal of the project is to investigate how this can be applied when bound variables are involved. There already exists a fold that automatically renames variables "out of the way", so the main question is what proofs does the user need to supply and how could they supply it? You do not need to have previous experience with theorem proving, but you have to be interested in it.
For more information, please contact Jan van Brügge (jsv2000@hw.ac.uk).
- Resources
-
-
Background
-
-
Url
-
-
Difficulty Level
-
Challenging
-
Ethical Approval
-
None
-
Number Of Students
-
1
-
Supervisor
-
Marko Doko
-
Keywords
-
-
Degrees
-
Bachelor of Science in Computer Science
Bachelor of Science in Computer Systems
Bachelor of Science in Information Systems
Bachelor of Science in Software Development for Business (GA)
Master of Engineering in Software Engineering
Master of Design in Games Design and Development
Master of Science in Artificial Intelligence
Master of Science in Artificial Intelligence with SMI
Master of Science in Business Information Management
Master of Science in Computer Science for Cyber Security
Master of Science in Computer Systems Management
Master of Science in Computing (2 Years)
Master of Science in Data Science
Master of Science in Human Robot Interaction
Master of Science in Information Technology (Business)
Master of Science in Information Technology (Software Systems)
Master of Science in Network Security
Master of Science in Robotics
Master of Science in Software Engineering
Bachelor of Science in Computing Science
Bachelor of Engineering in Robotics
Bachelor of Science in Computer Science (Cyber Security)