About
10
Publications
380
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
82
Citations
Introduction
Current institution
Education
September 2016 - August 2021
September 2015 - July 2016
September 2006 - June 2007
Publications
Publications (10)
This paper explores how Generative AI can be incorporated into software development education. We present examples of formative and summative assessments, which explore various aspects of ChatGPT, including its coding capabilities, its ability to construct arguments as well as ethical issues of using ChatGPT and similar tools in education and the w...
This paper explores how Generative AI (GenAI) can be introduced within summative assessment components in software engineering education. We present an example of an assessment which allows learners to use GenAI in a freeform, constructionist manner, as part of a large, software development project. This work is inspired by previously executed AI-f...
This portfolio gives an overview of the Algorithms and Automata module taught at Swansea University in the academic years 2022/23 and 2023/24. It explores the specifics of teaching computational thinking for a degree apprenticeship programme. The key aspect that distinguishes this module from similar modules taught as a part of traditional computer...
We describe insights gained from incorporating ChatGPT into assignments for our Software Engineering Degree Apprenticeshipprogramme, including attitudes expressed by the learners and their employers regarding our approach
We present an interactive proof system dedicated to program extraction from proofs. In a previous paper [5] the underlying theory IFP (Intuitionistic Fixed Point Logic) was presented and its soundness proven. The present contribution describes a prototype implementation and explains its use through several case studies. The system benefits from an...
We prove soundness of an optimized realizability interpretation for a logic supporting strictly positive induction and coinduction. The optimization concerns the special treatment of Harrop formulas which yields simpler extracted programs. We show that wellfounded induction is an instance of strictly positive induction and derive from this a new co...
