In a graph G = (V, E) provided with a linear order ”<” on V , a chordless path with vertices a, b, c, d and edges ab, bc, cd is called an obstruction if both a < b and d < c hold. Chvátal [2] defined the class of perfectly orderable graphs (i.e., graphs possessing an acyclic orientation of the edges such that no obstruction is induced) and proved that they are perfect. We introduce here the cla...

Functional language compilers implement only weak-head reduction. However, there are cases where head normal forms or full normal forms are needed. Here, we study how to use cps conversion for the compilation of head and strong reductions. We apply cps expressions to a special continuation so that their head or strong normal form can be obtained by the usual weak-head reduction. We remain withi...

Knowledge about accuracy, reliability and validity by pre-university students and science teachers (Chapter 2) CoE model 82 coe 47 relevant for evaluation arV in inquiries Conclusion 23 coe items relevant for evaluation arV in inquiry by novices Feasibility of revised instrument as self-evaluation instrument for pre-university students (Chapter 4) Design eQI instrument (ch.4) teaching-learning ...