Mechanizing Coinduction and Corecursion in Higher-order Logic

Details Mechanizing Coinduction and Corecursion in Higher-order Logic Mechanizing Coinduction and Corecursion in Higher-order Logic

2000-10-31

arxiv.org/abs/cs/9711105v1

published in Journal of Logic and Computation 7 (March 1997), 175-204

Computer Science

Logic in Computer Science

Scientific paper

A theory of recursive and corecursive definitions has been developed in higher-order logic (HOL) and mechanized using Isabelle. Least fixedpoints express inductive data types such as strict lists; greatest fixedpoints express coinductive data types, such as lazy lists. Well-founded recursion expresses recursive functions over inductive data types; corecursion expresses functions that yield elements of coinductive data types. The theory rests on a traditional formalization of infinite trees. The theory is intended for use in specification and verification. It supports reasoning about a wide range of computable functions, but it does not formalize their operational semantics and can express noncomputable functions also. The theory is illustrated using finite and infinite lists. Corecursion expresses functions over infinite lists; coinduction reasons about such functions.

Affiliated with

Also associated with

No associations

Rating

Mechanizing Coinduction and Corecursion in Higher-order Logic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Mechanizing Coinduction and Corecursion in Higher-order Logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mechanizing Coinduction and Corecursion in Higher-order Logic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-446316