Defining Functions on Equivalence Classes

07/17/2019
by   Lawrence C. Paulson, et al.
0

A quotient construction defines an abstract type from a concrete type, using an equivalence relation to identify elements of the concrete type that are to be regarded as indistinguishable. The elements of a quotient type are equivalence classes: sets of equivalent concrete values. Simple techniques are presented for defining and reasoning about quotient constructions, based on a general lemma library concerning functions that operate on equivalence classes. The techniques are applied to a definition of the integers from the natural numbers, and then to the definition of a recursive datatype satisfying equational constraints.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/11/2019

Equivalence classes of Niho bent functions

Equivalence classes of Niho bent functions are described for all known t...
research
11/05/2008

When are two algorithms the same?

People usually regard algorithms as more abstract than the programs that...
research
07/28/2022

Regression verification of unbalanced recursive functions with multiple calls (long version)

Given two programs p_1 and p_2, typically two versions of the same progr...
research
07/01/2020

Equational Reasoning for MTL Type Classes

Ability to use definitions occurring in the code directly in equational ...
research
01/12/2018

Symbolic Timed Observational Equivalence

Intruders can infer properties of a system by measuring the time it take...
research
08/16/2017

A fix-point characterization of Herbrand equivalence of expressions in data flow frameworks

The problem of determining Herbrand equivalence of terms at each program...
research
06/30/2021

Hypothetical Expected Utility

This paper provides a model to analyze and identify a decision maker's (...

Please sign up or login with your details

Forgot password? Click here to reset