is not yet complete but contain “holes” which can be filled in later. Editors with support for interactive development of Agda programs include Emacs via the Emacs mode, Atom via the agda mode for Atom Pad [https://agdapad.quasicoherent.io/] Note In this introduction we use several of Agda’s interactive commands to get information from the typechecker and manipulate code with holes. Here is a list C-c in VS Code): Compile an Agda program. See Notation for key combinations for a full list of interactive commands (keybindings). Programming With Dependent Types: Vectors In the code below, we model

reflection. Code [http://www.cse.chalmers.se/~ulfn/code/tphols09/] Anton Setzer. Lecture notes on Interactive Theorem Proving [http://www.cs.swan.ac.uk/~csetzer/lectures/intertheo/07/interactiveTheoremProvingForAgdaU blob/master/CS410-notes.pdf], videos from 2017 [https://github.com/pigworker/CS410-17/]. Interactive Theorem proving [http://www.cs.swan.ac.uk/~csetzer/lectures/intertheo/07/] (CS__336), Anton Setzer proof of the former theorem: primitive primWord64ToNatInjective : ∀ a b → primWord64ToNat a ≡ primWord64ToNat b → a ≡ b is in the Properties module. The proof of the latter theorem is not primitive

reflection. Code [http://www.cse.chalmers.se/~ulfn/code/tphols09/] Anton Setzer. Lecture notes on Interactive Theorem Proving [http://www.cs.swan.ac.uk/~csetzer/lectures/intertheo/07/interactiveTheoremProvingForAgdaU blob/master/CS410-notes.pdf], videos from 2017 [https://github.com/pigworker/CS410-17/]. Interactive Theorem proving [http://www.cs.swan.ac.uk/~csetzer/lectures/intertheo/07/] (CS__336), Anton Setzer proof of the former theorem: primitive primWord64ToNatInjective : ∀ a b → primWord64ToNat a ≡ primWord64ToNat b → a ≡ b is in the Properties module. The proof of the latter theorem is not primitive

reflection. Code [http://www.cse.chalmers.se/~ulfn/code/tphols09/] Anton Setzer. Lecture notes on Interactive Theorem Proving [http://www.cs.swan.ac.uk/~csetzer/lectures/intertheo/07/interactiveTheoremProvingForAgdaU blob/master/CS410-notes.pdf], videos from 2017 [https://github.com/pigworker/CS410-17/]. Interactive Theorem proving [http://www.cs.swan.ac.uk/~csetzer/lectures/intertheo/07/] (CS__336), Anton Setzer proof of the former theorem: primitive primWord64ToNatInjective : ∀ a b → primWord64ToNat a ≡ primWord64ToNat b → a ≡ b is in the Properties module. The proof of the latter theorem is not primitive

reflection. Code [http://www.cse.chalmers.se/~ulfn/code/tphols09/] Anton Setzer. Lecture notes on Interactive Theorem Proving [http://www.cs.swan.ac.uk/~csetzer/lectures/intertheo/07/interactiveTheoremProvingForAgdaU blob/master/CS410-notes.pdf], videos from 2017 [https://github.com/pigworker/CS410-17/]. Interactive Theorem proving [http://www.cs.swan.ac.uk/~csetzer/lectures/intertheo/07/] (CS__336), Anton Setzer proof of the former theorem: primitive primWord64ToNatInjective : ∀ a b → primWord64ToNat a ≡ primWord64ToNat b → a ≡ b is in the Properties module. The proof of the latter theorem is not primitive

is not yet complete but contain “holes” which can be filled in later. Editors with support for interactive development of Agda programs include Emacs via the Emacs mode, Atom via the agda mode for Atom Pad [https://agdapad.quasicoherent.io/] Note In this introduction we use several of Agda’s interactive commands to get information from the typechecker and manipulate code with holes. Here is a list C-c in VS Code): Compile an Agda program. See Notation for key combinations for a full list of interactive commands (keybindings). Programming With Dependent Types: Vectors In the code below, we model

is not yet complete but contain “holes” which can be filled in later. Editors with support for interactive development of Agda programs include Emacs via the Emacs mode, Atom via the agda mode for Atom Pad [https://agdapad.quasicoherent.io/] Note In this introduction we use several of Agda’s interactive commands to get information from the typechecker and manipulate code with holes. Here is a list C-c in VS Code): Compile an Agda program. See Notation for key combinations for a full list of interactive commands (keybindings). Programming With Dependent Types: Vectors In the code below, we model

is not yet complete but contain “holes” which can be filled in later. Editors with support for interactive development of Agda programs include Emacs via the Emacs mode, Atom via the agda mode for Atom Pad [https://agdapad.quasicoherent.io/] Note In this introduction we use several of Agda’s interactive commands to get information from the typechecker and manipulate code with holes. Here is a list C-c in VS Code): Compile an Agda program. See Notation for key combinations for a full list of interactive commands (keybindings). Programming With Dependent Types: Vectors In the code below, we model

[http://staff.aist.go.jp/yoriyuki.yamagata/AgdaTutorial20080908.ppt] Anton Setzer. Lecture notes on Interactive Theorem Proving [http://www.cs.swan.ac.uk/~csetzer/lectures/intertheo/07/interactiveTheoremProvingForAgdaU Programming [https://github.com/pigworker/CS410-13] (CS410), Conor McBride, Strathclyde, Fall 2013. Interactive Theorem proving [http://www.cs.swan.ac.uk/~csetzer/lectures/intertheo/07/] (CS__336), Anton Setzer (~ j) Glue types In order to be able to prove the univalence theorem we also have to add “Glue” types. These lets us turn equivalences between types into paths between

[http://staff.aist.go.jp/yoriyuki.yamagata/AgdaTutorial20080908.ppt] Anton Setzer. Lecture notes on Interactive Theorem Proving [http://www.cs.swan.ac.uk/~csetzer/lectures/intertheo/07/interactiveTheoremProvingForAgdaU Programming [https://github.com/pigworker/CS410-13] (CS410), Conor McBride, Strathclyde, Fall 2013. Interactive Theorem proving [http://www.cs.swan.ac.uk/~csetzer/lectures/intertheo/07/] (CS__336), Anton Setzer (~ j) Glue types In order to be able to prove the univalence theorem we also have to add “Glue” types. These lets us turn equivalences between types into paths between