Bc. Adam Krupička

Master's thesis

Coinductive Formalization of SECD Machine in Agda

Coinductive Formalization of SECD Machine in Agda
Abstract:
V tejto práci formalizujeme SECD stroj v jazyku Agda. Za plného využitia závislých typov v tomto jazyku definujeme typovanú syntax inštrukcií pre SECD stroj. Potom definujeme sémantiku tohto stroja za použitia koindukcie. Nakoniec zavádzame λ kalkul, z ktorého definujeme kompilátor do SECD inštrukcií.
Abstract:
In this thesis we give a formalization of SECD machine in a language called Agda. We take full advantage of the presence of dependent types in Agda and define typed assembly code for this machine. Then we give semantics to the typed assembly by the use of coinduction. Finally, we define a λ calculus and give a compilation procedure to SECD assembly, using a well-known approach.
 

Keywords

SECD Agda formalization coinduction
 
Language used: English
Date on which the thesis was submitted / produced: 12. 12. 2018
Identifier: https://is.muni.cz/th/vhz48/

Thesis defence

  • Date of defence: 8. 2. 2019
  • Supervisor: RNDr. Martin Jonáš
  • Reader: doc. Mgr. Jan Obdržálek, PhD.

Citation record

Cite this text

Full text of thesis

Contents of on-line thesis archive
Published in Theses:
  • světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Masarykova univerzita, Fakulta informatiky
Složka Reference to the local database directory of the institution

Masaryk University

Faculty of Informatics

Master programme / field:
Informatics / Theoretical Informatics

Theses on a related topic

List of theses with an identical keyword.
  • No theses on a related topic available.