Journal of Formalized Mathematics
Volume 5, 1993
University of Bialystok
Copyright (c) 1993 Association of Mizar Users

On Defining Functions on Binary Trees


Grzegorz Bancerek
Polish Academy of Sciences, Institute of Mathematics, Warsaw
Piotr Rudnicki
University of Alberta, Department of Computing Science, Edmonton

Summary.

This article is a continuation of an article on defining functions on trees (see [6]). In this article we develop terminology specialized for binary trees, first defining binary trees and binary grammars. We recast the induction principle for the set of parse trees of binary grammars and the scheme of defining functions inductively with the set as domain. We conclude with defining the scheme of defining such functions by lambda-like expressions.

This work was partially supported by NSERC Grant OGP9207 while the first author visited University of Alberta, May--June 1993.

MML Identifier: BINTREE1

The terminology and notation used in this paper have been introduced in the following articles [12] [9] [15] [14] [16] [17] [13] [7] [8] [5] [11] [10] [1] [2] [3] [4] [6]

Contents (PDF format)

Bibliography

[1] Grzegorz Bancerek. Introduction to trees. Journal of Formalized Mathematics, 1, 1989.
[2] Grzegorz Bancerek. K\"onig's Lemma. Journal of Formalized Mathematics, 3, 1991.
[3] Grzegorz Bancerek. Sets and functions of trees and joining operations of trees. Journal of Formalized Mathematics, 4, 1992.
[4] Grzegorz Bancerek. Joining of decorated trees. Journal of Formalized Mathematics, 5, 1993.
[5] Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Journal of Formalized Mathematics, 1, 1989.
[6] Grzegorz Bancerek and Piotr Rudnicki. On defining functions on trees. Journal of Formalized Mathematics, 5, 1993.
[7] Czeslaw Bylinski. Functions and their basic properties. Journal of Formalized Mathematics, 1, 1989.
[8] Czeslaw Bylinski. Functions from a set to a set. Journal of Formalized Mathematics, 1, 1989.
[9] Czeslaw Bylinski. Some basic properties of sets. Journal of Formalized Mathematics, 1, 1989.
[10] Patricia L. Carlson and Grzegorz Bancerek. Context-free grammar --- part I. Journal of Formalized Mathematics, 4, 1992.
[11] Agata Darmochwal. Finite sets. Journal of Formalized Mathematics, 1, 1989.
[12] Andrzej Trybulec. Tarski Grothendieck set theory. Journal of Formalized Mathematics, Axiomatics, 1989.
[13] Andrzej Trybulec. Tuples, projections and Cartesian products. Journal of Formalized Mathematics, 1, 1989.
[14] Andrzej Trybulec. Subsets of real numbers. Journal of Formalized Mathematics, Addenda, 2003.
[15] Zinaida Trybulec. Properties of subsets. Journal of Formalized Mathematics, 1, 1989.
[16] Edmund Woronowicz. Relations and their basic properties. Journal of Formalized Mathematics, 1, 1989.
[17] Edmund Woronowicz. Relations defined on sets. Journal of Formalized Mathematics, 1, 1989.

Received December 30, 1993


[ Download a postscript version, MML identifier index, Mizar home page]