10 resultados para Union Pacific Railway

em Boston University Digital Common


Relevância:

30.00% 30.00%

Publicador:

Resumo:

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

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The print copy of this sermon is held by Pitts Theology Library. The Pitts Theology Library's digital copy was produced as part of the ATLA/ATS Cooperative Digital Resources Initiative (CDRI), funded by the Luce Foundation. Reproduction note: Electronic reproduction. Atlanta, Georgia : Pitts Theology Library, Emory University, 2003. (Thanksgiving Day Sermons, ATLA Cooperative Digital Resources Initiative, CDRI). Joint CDRI project by: Andover-Harvard Library (Harvard Divinity School), Pitts Theology Library (Emory University), and Princeton Theological Seminary Libraries.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The CIL compiler for core Standard ML compiles whole programs using a novel typed intermediate language (TIL) with intersection and union types and flow labels on both terms and types. The CIL term representation duplicates portions of the program where intersection types are introduced and union types are eliminated. This duplication makes it easier to represent type information and to introduce customized data representations. However, duplication incurs compile-time space costs that are potentially much greater than are incurred in TILs employing type-level abstraction or quantification. In this paper, we present empirical data on the compile-time space costs of using CIL as an intermediate language. The data shows that these costs can be made tractable by using sufficiently fine-grained flow analyses together with standard hash-consing techniques. The data also suggests that non-duplicating formulations of intersection (and union) types would not achieve significantly better space complexity.