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

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.

Constitution, laws and regulations of the American Board of Commissioners for Foreign Missions.

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

A Chinese appeal to Christendom concerning Christian mission / by Lin Shao-yang [pseud.].

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

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

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

African missionary heroes and heroines / by H.K.W. Kumm.

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

Wonders in the western isles, being a narrative of the commencement and progress of mission work in western Polynesia.

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

The world mission of the Christian religion, by Wade Crawford Barclay; C.A. Bowen, D.D., general editor.

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

First ten annual reports of the American Board of Commissioners for Foreign Missions : with other documents of the Board.

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

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 Provide Concurrency Support in the Sensorium Execution Environment (SXE)

The SNBENCH is a general-purpose programming environment and run-time system targeted towards a variety of Sensor applications such as environmental sensing, location sensing, video sensing, etc. In its current structure, the run-time engine of the SNBENCH namely, the Sensorium Execution Environment (SXE) processes the entities of execution in a single thread of operation. In order to effectively support applications that are time-sensitive and need priority, it is imperative to process the tasks discretely so that specific policies can be applied at a much granular level. The goal of this project was to modify the SXE to enable efficient use of system resources by way of multi-tasking the individual components. Additionally, the transformed SXE offers the ability to classify and employ different schemes of processing to the individual tasks.