coded up TypedDB
This commit is contained in:
parent
ae7bd1f265
commit
b4f79811ca
2 changed files with 18 additions and 3 deletions
19
Notes.md
19
Notes.md
|
@ -29,7 +29,24 @@ The following comments were collected on the Agda mailing list.
|
||||||
|
|
||||||
## Untyped lambda calculus
|
## Untyped lambda calculus
|
||||||
|
|
||||||
* http://www.cse.chalmers.se/~nad/listings/partiality-monad/Lambda.Simplified.Delay-monad.Interpreter.html
|
* Nils Anders Danielsson <nad@cse.gu.se>
|
||||||
|
+
|
||||||
|
http://www.cse.chalmers.se/~nad/listings/partiality-monad/Lambda.Simplified.Delay-monad.Interpreter.html
|
||||||
|
+ /~nad/repos/codata/Lambda/Closure/Functional
|
||||||
|
* untyped lambda calculus by Gallais
|
||||||
|
+ https://gist.github.com/gallais/303cfcfe053fbc63eb61
|
||||||
|
* lambda calculus
|
||||||
|
+ https://github.com/pi8027/lambda-calculus/tree/master/agda/Lambda
|
||||||
|
|
||||||
|
## Agda resources
|
||||||
|
* Chalmers class
|
||||||
|
+ http://www.cse.chalmers.se/edu/year/2017/course/DAT140_Types/
|
||||||
|
* Dybjer lecture notes
|
||||||
|
+ http://www.cse.chalmers.se/edu/year/2017/course/DAT140_Types/LectureNotes.pdf
|
||||||
|
* Ulf Norell and James Chapman lecture notes
|
||||||
|
+ http://www.cse.chalmers.se/~ulfn/darcs/AFP08/LectureNotes/AgdaIntro.pdf
|
||||||
|
* Chalmer Take Home exam 2017
|
||||||
|
+ http://www.cse.chalmers.se/edu/year/2017/course/DAT140_Types/TakeHomeExamTypes2017.pdf
|
||||||
|
|
||||||
## Syntax for lambda calculus
|
## Syntax for lambda calculus
|
||||||
|
|
||||||
|
|
|
@ -161,10 +161,8 @@ substitution. Working from top to bottom (from the high-level
|
||||||
property we are actually interested in to the lowest-level
|
property we are actually interested in to the lowest-level
|
||||||
technical lemmas), the story goes like this:
|
technical lemmas), the story goes like this:
|
||||||
|
|
||||||
<!--
|
|
||||||
- The _preservation theorem_ is proved by induction on a typing derivation.
|
- The _preservation theorem_ is proved by induction on a typing derivation.
|
||||||
derivation, pretty much as we did in chapter [Types]({{ "Types" | relative_url }})
|
derivation, pretty much as we did in chapter [Types]({{ "Types" | relative_url }})
|
||||||
-->
|
|
||||||
|
|
||||||
- The one case that is significantly different is the one for the
|
- The one case that is significantly different is the one for the
|
||||||
`βλ·` rule, whose definition uses the substitution operation. To see that
|
`βλ·` rule, whose definition uses the substitution operation. To see that
|
||||||
|
|
Loading…
Reference in a new issue