Agda User Manual v2.6.3Taste of Agda Preliminaries Programming With Dependent Types: Vectors Agda as a Proof Assistant: Proving Associativity of Addition Building an Executable Agda Program Where to go from here? A List of Tutorials type Fin 0. For more details, see the section on coverage checking. Agda as a Proof Assistant: Proving Associativity of Addition In this section we state and prove the associativity of addition on the that x and y are equal objects. By writing a function that returns an object of type x ≡ y, we are proving that the two terms are equal. Now we can state associativity: given three (possibly different) natural0 码力 | 379 页 | 354.83 KB | 1 年前3
Agda User Manual v2.6.2Taste of Agda Preliminaries Programming With Dependent Types: Vectors Agda as a Proof Assistant: Proving Associativity of Addition Building an Executable Agda Program Where to go from here? A List of Tutorials type Fin 0. For more details, see the section on coverage checking. Agda as a Proof Assistant: Proving Associativity of Addition In this section we state and prove the associativity of addition on the that x and y are equal objects. By writing a function that returns an object of type x ≡ y, we are proving that the two terms are equal. Now we can state associativity: given three (possibly different) natural0 码力 | 348 页 | 414.11 KB | 1 年前3
Agda User Manual v2.6.2.2Taste of Agda Preliminaries Programming With Dependent Types: Vectors Agda as a Proof Assistant: Proving Associativity of Addition Building an Executable Agda Program Where to go from here? A List of Tutorials type Fin 0. For more details, see the section on coverage checking. Agda as a Proof Assistant: Proving Associativity of Addition In this section we state and prove the associativity of addition on the that x and y are equal objects. By writing a function that returns an object of type x ≡ y, we are proving that the two terms are equal. Now we can state associativity: given three (possibly different) natural0 码力 | 354 页 | 433.60 KB | 1 年前3
Agda User Manual v2.6.2.1Taste of Agda Preliminaries Programming With Dependent Types: Vectors Agda as a Proof Assistant: Proving Associativity of Addition Building an Executable Agda Program Where to go from here? A List of Tutorials type Fin 0. For more details, see the section on coverage checking. Agda as a Proof Assistant: Proving Associativity of Addition In this section we state and prove the associativity of addition on the that x and y are equal objects. By writing a function that returns an object of type x ≡ y, we are proving that the two terms are equal. Now we can state associativity: given three (possibly different) natural0 码力 | 350 页 | 416.80 KB | 1 年前3
Agda User Manual v2.6.1.3[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 r/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, Swansea University Abstraction Pattern matching lambda Local Definitions: let and where let-expressions where-blocks Proving properties More Examples (for Beginners) Lexical Structure Tokens Layout Literate Agda Literal0 码力 | 305 页 | 375.80 KB | 1 年前3
Agda User Manual v2.6.1.2[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 r/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, Swansea University Abstraction Pattern matching lambda Local Definitions: let and where let-expressions where-blocks Proving properties More Examples (for Beginners) Lexical Structure Tokens Layout Literate Agda Literal0 码力 | 304 页 | 375.60 KB | 1 年前3
Agda User Manual v2.6.1.1[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 r/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, Swansea University Abstraction Pattern matching lambda Local Definitions: let and where let-expressions where-blocks Proving properties More Examples (for Beginners) Lexical Structure Tokens Layout Literate Agda Literal0 码力 | 297 页 | 375.42 KB | 1 年前3
Agda User Manual v2.6.1[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 r/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, Swansea University Abstraction Pattern matching lambda Local Definitions: let and where let-expressions where-blocks Proving properties More Examples (for Beginners) Lexical Structure Tokens Layout Literate Agda Literal0 码力 | 297 页 | 375.42 KB | 1 年前3
Agda User Manual v2.6.0.1jp/yoriyuki.yamagata/AgdaTutorial20080908.ppt] Anton Setzer. Lecture notes on Interactive Theorem Proving [http://www.cs.swan.ac.uk/~csetzer/lectures/intertheo/07/interactiveTheoremProvingForAgdaU [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, Swansea University Abstraction Pattern matching lambda Local Definitions: let and where let-expressions where-blocks Proving properties More Examples (for Beginners) Lexical Structure Tokens Layout Literate Agda Literal0 码力 | 256 页 | 247.15 KB | 1 年前3
Agda User Manual v2.6.0jp/yoriyuki.yamagata/AgdaTutorial20080908.ppt] Anton Setzer. Lecture notes on Interactive Theorem Proving [http://www.cs.swan.ac.uk/~csetzer/lectures/intertheo/07/interactiveTheoremProvingForAgdaU [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, Swansea University Abstraction Pattern matching lambda Local Definitions: let and where let-expressions where-blocks Proving properties More Examples (for Beginners) Lexical Structure Tokens Layout Literate Agda Literal0 码力 | 256 页 | 246.87 KB | 1 年前3
共 34 条
- 1
- 2
- 3
- 4













