First Page | Document Content | |
---|---|---|
Date: 2016-08-01 05:50:11Software engineering Computer programming Declarative programming Higher-order functions Programming language comparisons Recursion Fold FO Haskell features Standard ML | Proving Correctness via Free Theorems The Case of the destroy/build-Rule Janis Voigtl¨ander Technische Universit¨ at DresdenAdd to Reading ListSource URL: www.janis-voigtlaender.euDownload Document from Source WebsiteFile Size: 122,81 KBShare Document on Facebook |