Compiling Agda to System Fω in Theory

dc.contributor.authorUlm, Gregor
dc.contributor.departmentGöteborgs universitet/Institutionen för data- och informationsteknikswe
dc.contributor.departmentUniversity of Gothenburg/Department of Computer Science and Engineeringeng
dc.date.accessioned2015-07-20T13:07:22Z
dc.date.available2015-07-20T13:07:22Z
dc.date.issued2015-07-20
dc.description.abstractWe develop a theoretical foundation for compiling the programming language Agda to System Fω, which is a stepping stone towards a compiler from Agda to Haskell. The practical relevance for software engineering and the problem of providing correctness guarantees for programs is highlighted. After describing relevant λ- calculi, we specify the semantics for compiling Agda to System Fω. Finally, we illustrate those compilation rules by manually translating several Agda code examples to System Fω.sv
dc.identifier.urihttp://hdl.handle.net/2077/39972
dc.language.isoengsv
dc.setspec.uppsokTechnology
dc.subjectLanguagessv
dc.subjectLambda calculus and related systemssv
dc.subjectTypessv
dc.subjectCompilerssv
dc.titleCompiling Agda to System Fω in Theorysv
dc.typetext
dc.type.degreeStudent essay
dc.type.uppsokM2

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
gupea_2077_39972_1.pdf
Size:
560 KB
Format:
Adobe Portable Document Format
Description:
Bachelor Thesis

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
876 B
Format:
Item-specific license agreed upon to submission
Description: