Pisa - Facilitating conjecture generation in Lean

dc.contributor.authorFühr, Nor
dc.contributor.authorNygren, Erik
dc.contributor.departmentChalmers tekniska högskola / Institutionen för data och informationstekniksv
dc.contributor.departmentChalmers University of Technology / Department of Computer Science and Engineeringen
dc.contributor.examinerJohansson, Moa
dc.contributor.supervisorEinarsdóttir, Sólrún
dc.date.accessioned2026-01-16T09:17:40Z
dc.date.issued2025
dc.date.submitted
dc.description.abstractAs time has passed, the rigour needed for mathematical proofs has increased. Interactive theorem provers were introduced to help with proof verification during proof development. This project aims to aid users while they use a particular interactive theorem prover, known as Lean 4, by facilitating the use of conjecture generation for the language. Conjecture generation can help users understand the domain that they are working in, or automate what proofs might be needed for a more intricate proof. To facilitate conjecture generation in Lean, a tool called Pisa was introduced. It utilizes tooling from Haskell to generate conjectures. To be able to utilize Haskell tooling for conjecture generation, a translation from Lean to Haskell was created, that supports data type translation and has an interpreter for functions. The translation works for enumerable, recursive, and polymorphic data types. With the translation, generation of conjectures is performed and then translated back into Lean code for the user to prove them. This was all tied into a macro, that is callable from the users’ editor, meaning that usage of Pisa can be done while adding and modifying definitions.
dc.identifier.coursecodeDATX05
dc.identifier.urihttp://hdl.handle.net/20.500.12380/310907
dc.language.isoeng
dc.setspec.uppsokTechnology
dc.subjectTranspilation
dc.subjectConjecture generation
dc.subjectTheory exploration
dc.subjectInteractive theorem prover
dc.subjectInterpreter
dc.titlePisa - Facilitating conjecture generation in Lean
dc.type.degreeExamensarbete för masterexamensv
dc.type.degreeMaster's Thesisen
dc.type.uppsokH
local.programmeComputer science – algorithms, languages and logic (MPALG), MSc

Ladda ner

Original bundle

Visar 1 - 1 av 1
Hämtar...
Bild (thumbnail)
Namn:
CSE 25-145 NF EN.pdf
Storlek:
473.28 KB
Format:
Adobe Portable Document Format

License bundle

Visar 1 - 1 av 1
Hämtar...
Bild (thumbnail)
Namn:
license.txt
Storlek:
2.35 KB
Format:
Item-specific license agreed upon to submission
Beskrivning: