Paper in proceedings, 2006

Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify such reasoning.
Two languages are defined, one total and one partial, with identical syntax. The semantics of the partial language includes partial and infinite values, and all types are lifted, including the function spaces. A partial equivalence relation (PER) is then defined, the domain of which is the total subset of the partial language. For types not containing function spaces the PER relates equal values, and functions are related if they map related values to related values.
It is proved that if two closed terms have the same semantics in the total language, then they have related semantics in the partial language. It is also shown that the PER gives rise to a bicartesian closed category which can be used to reason about values in the domain of the relation.

non-strict and strict languages

partial and infinite values

inductive and coinductive types

partial and total languages

lifted types

Equational reasoning

Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)

Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)

Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)

206-217

Computer Science

1-59593-027-2