The life of Father de Smet, S.J. (1801-1873) by E. Laveille, S.J., authorized translation by Marian Lindsay, introduction by Charles Coppens ...

http://www.archive.org/details/lifeoffatherdesm00laverich

Western missions and missionaries : a series of letters / by P.J. de Smet.

http://www.archive.org/details/westernmissionsa00smetrich

Letter to Rev. Epaphras "Kible". 05/12/1801

Handwritten letter from T. Merritt to Rev. Epaphras "Kible[sic]" regarding the latter's desire for Merritt to take on his preaching circuit citing ailing health. Dated May 12, 1801.

Letter to Rev. Epaphras Kibby. 01/11/1801

Handwritten letter from Timothy Merritt to Rev. Epaphras Kibby regarding lodging and preaching schedule. Sent in care of Mr. Lambert. Dated Jan. 11, 1801, Bath, ME.

In Memoriam Lucinda Freeman Hoyt

Memoriam.

Metlakahtla : a true narrative of the red man / by George T.B. Davis.

http://www.archive.org/details/metlakahtltruena00davirich

Men and missions / by William T. Ellis ; with a foreword by John B. Sleman, Jr. ; and with a statistical and historical appendix compiled by Abigail J. Davies.

http://www.archive.org/details/menandmissions003181mbp

Pioneering in the Congo. by John McKendree Springer ...

http://www.archive.org/details/pioneeringincong00spririch

Boundbrook, or, Amy Rushton's mission / by A.J. Greenough.

http://www.archive.org/details/boundbrookoramyr00greeiala

Stranger than fiction. [electronic resource] By the Rev. J.J. Halcombe

http://digilib.bu.edu/archive/strangerthanfict00halcrich/strangerthanfict00halcrich.djvu

Type Inference For Recursive Definitions

We consider type systems that combine universal types, recursive types, and object types. We study type inference in these systems under a rank restriction, following Leivant's notion of rank. To motivate our work, we present several examples showing how our systems can be used to type programs encountered in practice. We show that type inference in the rank-k system is decidable for k ≤ 2 and undecidable for k ≥ 3. (Similar results based on different techniques are known to hold for System F, without recursive types and object types.) Our undecidability result is obtained by a reduction from a particular adaptation (which we call "regular") of the semi-unification problem and whose undecidability is, interestingly, obtained by methods totally different from those used in the case of standard (or finite) semi-unification.

Extending snBench to Support Hierarchical and Configurable Scheduling

It is useful in systems that must support multiple applications with various temporal requirements to allow application-specific policies to manage resources accordingly. However, there is a tension between this goal and the desire to control and police possibly malicious programs. The Java-based Sensor Execution Environment (SXE) in snBench presents a situation where such considerations add value to the system. Multiple applications can be run by multiple users with varied temporal requirements, some Real-Time and others best effort. This paper outlines and documents an implementation of a hierarchical and configurable scheduling system with which different applications can be executed using application-specific scheduling policies. Concurrently the system administrator can define fairness policies between applications that are imposed upon the system. Additionally, to ensure forward progress of system execution in the face of malicious or malformed user programs, an infrastructure for execution using multiple threads is described.