Wouter swierstra showed in his phd thesis how to implement stateful com-putations in the dependently typed functional programming language agda in particular he deﬁned a notion of state which is parameterized by a list of types indicating what kind of data are to be stored in the respective loca-tions. Norell  for further understanding of agda the thesis will be organized in several parts part 2 reviews the necessary syntax and functionalities of agda part 3 shows current developments of modeling imperative program-ming languages inside agda it will introduce monads and wouter swier-stra’s model of dependently typed memory.
Reddit is also anonymous so you can be yourself, with your reddit profile and persona disconnected from your real-world identity jump to content (msc thesis, pdf) 6 12 comments agda vs coq by wouter swierstra (with some input from bruno bernardo, peter dybjer, and hugo herbelin).
1 program derivation an algebra of scans ralf hinze in dexter kozen, editor, proceedings of the seventh international conference on mathematics of program construction (mpc 2004), stirling, scotland, uk, july 12-14, 2004. Papers using agda list of papers sorted by name of first author: a (favonia), phd thesis a mechanization of the blakers-massey connectivity theorem in homotopy type theory by kuen-bang hou dependent types for distributed arrays by wouter swierstra and thorsten altenkirch.
Agda is a dependently typed functional programming language originally developed by ulf norell at chalmers university of technology with implementation described in his phd thesis the current version of agda was originally known as agda 2.
Wouter swierstra february 2009 thesis submitted to the university of nottingham for the degree of doctor of philosophy. Publications from algebra to abstract machine: a verified generic construction carlos tomé cortiñas and wouter swierstra tyde 2018 wouter swierstra thesis accepted for the degree of doctor of philosophy a tutorial implementation of a dependently-typed lambda calculus andres loeh, conor mcbride, and wouter swierstra. Lar approach to doing teletype io in his thesis , and cites related work dating back more than twenty years [16, 19] rather than use such structures to perform io, however, we use them to construct a pure model of functions in the io monad quite conveniently, the iott data type also forms a monad.
Ics this thesis aims to provide an introduction to homotopy type theory geared toward programmers familiar with dependently typed programming, but unfa-miliar with topology we will present applications of homotopy type theory to programming, such as quotient types and dealing with views on abstract types. Wouter swierstra showed in his phd thesis how to implement stateful computations in the dependently typed functional programming language agda in particular he defined a notion of state which is parameterized by a list of types indicating what kind of data are to be stored in the respective locations. Wouter swierstra wouter first learned haskell as an undergraduate in 1999 in utrecht after completing his degree, he went on to do a phd about functional programming languages at the university of nottingham.
Propositional equality (in this thesis denoted by ⌘ ) in martin-lof’s type theory,¨ propositional equality is deﬁned using the so called identity types: an inductive familywithreﬂ asitsonlyconstructor thisconstructionessentiallyimportsdef-initional equality into the type theory.
Type checking and normalisation james maitland chapman, bsc in writing this thesis and his helpful feedback, and conor mcbride for his meticulous and highly constructive comments on a complete draft i would also like to thank wouter swierstra, peter hancock, nicolas oury and peter. Slim: functionalreactive userinterfaceprogramming jaapvanderplas august 26, 2016 msc thesis ica-3998312 supervisors: dr wouter swierstra dr atze dijkstra department of information and computing sciences. The refinement calculus, , defines a formal methodology that can be used to construct a derivation of a program from its specification step by step crucially, the refinement calculus presents single language for describing both programs and specifications deriving complex programs using the refinement calculus is no easy task.