<--- Back to Details
First PageDocument Content
Software engineering / Computer programming / Declarative programming / Higher-order functions / Programming language comparisons / Recursion / Fold / FO / Haskell features / Standard ML
Date: 2016-08-01 05:50:11
Software 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 Dresden

Add to Reading List

Source URL: www.janis-voigtlaender.eu

Download Document from Source Website

File Size: 122,81 KB

Share Document on Facebook

Similar Documents

“DONot Fold, Spindle or Mutilate”: A Cultural History of the Punch Card Steven Lubar One hundred years have passed since Herman Hollerith invented the punch card to tabulate the 1890census. That’s also, almost exac

“DONot Fold, Spindle or Mutilate”: A Cultural History of the Punch Card Steven Lubar One hundred years have passed since Herman Hollerith invented the punch card to tabulate the 1890census. That’s also, almost exac

DocID: 1xVGz - View Document

Isomer Info Sheet   Isomer is a lightweight solution for Singapore Government informational services that  employs UX best practices.    The goal of Isomer is three-fold: 

Isomer Info Sheet   Isomer is a lightweight solution for Singapore Government informational services that  employs UX best practices.    The goal of Isomer is three-fold: 

DocID: 1xVx1 - View Document

Cut  Fold First simple steps

Cut Fold First simple steps

DocID: 1xVvw - View Document

General Brochure_tri-fold_final

General Brochure_tri-fold_final

DocID: 1xUrP - View Document

MVPAGE 1 of 2  HERE FOLD

MVPAGE 1 of 2 HERE FOLD

DocID: 1vs0T - View Document