28 research outputs found

    Enteric Protozoa of Some Amphibians of the Elk Mountains, Colorado

    Get PDF
    Author Institution: Department of Velerinary Medicine, Oregon State University, Corvallis, Orego

    INCIDENCE OF COCCIDIA (EIMERIDAE) IN ADULT EWES AND LAMBS ON ST. CROIX

    Get PDF
    INCIDENCE OF COCCIDIA (EIMERIDAE) IN ADULT EWES AND LAMBS ON ST. CROI

    Restructuring the University - An Experiential Exercise

    No full text
    The author presents and comments on an experiential exercise addressing organizational structure and goal attainment

    Tinte: developing a prototype for typesetting music in Clean : a case study

    No full text
    This paper describes the development of a typesetting program for music in the lazy functional programming language Clean. The system transforms a description of the music to be typeset in a dvi-file just like TEX does with mathematical formulae. The implementation makes heavy use of higher order functions. It has been implemented in just a few weeks and is able to typeset quite impressive examples. The system is easy to maintain and can be extended to typeset arbitrary complicated musical constructs. The paper can be considered as a status report of the implementation as well as a reference manual for the resulting system

    Termination proofs for a lazy functional language by abstract reduction : (draft)

    No full text
    Automatic termination proofs of functional programming languages are an often challenged problem Most work in this area is done on strict languages Orderings for arguments of recursive calls are generated In lazily evaluated languages arguments for functions are not necessarily evaluated to a normal form It is not a trivial task to de ne orderings on expressions that are not in normal form or that do not even have a normal form We propose a method based on an abstract reduction process that reduces up to the point when su cient ordering relations can be found The proposed method is able to nd termination proofs for lazily evaluated programs that involve non terminating subexpressions Analysis is performed on a higher order polymorphic typed language and termi nation of higher order functions can be proved too The calculus can be used to derive information on a wide range on di erent notions of termination
    corecore