Download ACM transactions on programming languages and systems by Ron K. (ed.) Cytron PDF

By Ron K. (ed.) Cytron

Show description

Read or Download ACM transactions on programming languages and systems (January) PDF

Similar programming books

Beginning Perl (3rd Edition)

This can be a ebook for these folks who believed that we didn’t have to examine Perl, and now we all know it truly is extra ubiquitous than ever. Perl is very versatile and robust, and it isn’t petrified of internet 2. zero or the cloud. initially touted because the duct tape of the web, Perl has considering advanced right into a multipurpose, multiplatform language current totally in every single place: heavy-duty net functions, the cloud, platforms management, average language processing, and monetary engineering.

Extra info for ACM transactions on programming languages and systems (January)

Sample text

1998. Implementing typed intermediate languages. In Proceedings of the 1998 ACM SIGPLAN International Conference on Functional Programming. ACM, New York, 313–323. , AND PAPASPYROU, N. 2001. A type system for certified binaries. Tech. Rep. YALEU/DCS/TR-1211, Dept. of Computer Science, Yale University, New Haven, Conn. SHELDON, M. A. AND GIFFORD, D. K. 1990. Static dependent types for first class modules. In Proceedings of the 1990 ACM Conference on LISP and Functional Programming. ACM, New York, 20–29.

A linear logical framework. In Proceedings of the 11th IEEE Symposium on Logic in Computer Science. 264–275. , NECULA, G. , AND CLINE, K. 2000. A certifying compiler for Java. In Proceedings of the 2000 ACM Conference on Programming Language Design and Implementation. ACM, New York, 95–107. CONSTABLE, R. 1985. Constructive mathematics as a programming logic I: Some principles of theory. Ann. Disc. Math. 24. COQUAND, T. AND HUET, G. 1988. The calculus of constructions. Inf. Comput. 76, 95–120. CRARY, K.

In Elim[I, A ](A){ B}, the term A of type I is being analyzed. The sequence B contains the set of branches of Elim, one for each constructor of I . In the case when Ci = X , which implies that A is of the form Ctor (i, I ), the Elim just selects the Bi branch: Elim[I, A ](Ctor (i, I )){ B} ❀ι Bi . In the case when Ci = Y : B. X , where X does not occur free in B, A must be of the form Ctor (i, I ) A, with Ai of type Bi . The Elim selects the Bi branch and passes the constructor arguments to it.

Download PDF sample

Rated 4.71 of 5 – based on 30 votes