CiteSeerX — Propositions ∧ ⊃ ⊤ ∨ ⊥ ∀ ∃

Propositions ∧ ⊃ ⊤ ∨ ⊥ ∀ ∃

by Unknown Authors

690	Untersuchungen uber das logische Schlieen - Gentzen - 1934
514	The formulas-as-types notion of construction, in - Howard - 1980
330	Dependent Types in Practical Programming - Xi - 1998
316	Constructive mathematics and computer programming - Martin-Löf - 1985
185	Eliminating array bound checking through dependent types - Xi, Pfenning - 1998
143	On the meaning of the logical constants and the justification of the logical laws. - Martin-Lof - 1996
85	Some properties of conversion - Church, Rosser - 1936
22	Red-black trees in a functional setting - Okasaki - 1999 (Show Context) Citation Context ... idea is to implement a set as a red-black tree. Red-black trees are an efficient data structure for representing dictionaries whose keys are ordered. Here we follow the presentation by Chris Okasaki =-=[Oka99]-=-. The underlying data structure is a binary tree whose nodes are labelled with the members of the set. If we can ensure that the tree is sufficiently balanced, the height of such a tree will be logari...