Media Summary: Why would we believe that a program is correct? Source The natural numbers are a quintessential data type in Functions such as addition and multiplication (on the natural numbers) are written recursively in
Simpl Vs Reflexivity Software Foundations In Coq Lf Basics - Detailed Analysis & Overview
Why would we believe that a program is correct? Source The natural numbers are a quintessential data type in Functions such as addition and multiplication (on the natural numbers) are written recursively in Comparisons for equality and inequality on the Parametric polymorphism is useful not just with lists, but also pairs and options in Pairs and tuples are types that represent a fixed-length sequence
Higher-order functions can take functions as input and returns functions as output. The former is explored in the context Why would a programmer care deeply about program correctness? Deeply enough to go to the trouble
