| Karl Crary. Programming language semantics in foundational type theory (extended version). Technical Report CS TR98-1666, Cornell University, 1998. |
....as a semantic metalanguage for defining the semantics of programming languages. Reynolds [41] gives a type theoretic interpretation of Idealized Algol. Harper and Mitchell [23] do the same for a fragment of Standard ML. Harper and Stone [25] define a type theoretic semantics for Standard ML. Crary [11] defines the semantics of a higher order kernel programming language with recursion, records, and modules using Nuprl [8] There is no other work that defines the semantics of specialization using type theory. The closest is probably Davies s and Pfenning s work [16, 15] that connects modal and ....
Karl Crary. Programming language semantics in foundational type theory (extended version). Technical Report CS TR98-1666, Cornell University, 1998.
....the formalism of choice to support programming, verification and the logical foundations of computer science. The language of types underlies modern programming languages like Java and ML, and the theory of types drives significant efforts in compilation [24, 43, 31, 34, 36, 7, 40] and semantics [8, 20, 16]. Theorem proving systems based on type theory have been used for the verification of both hardware and software, and have also been very widely used for the formalization of mathematics. One of the major reasons type theory has enjoyed such wide successes is that it is a natural highlevel ....
Karl Crary. Programming language semantics in foundational type theory. In International Conference on Programming Concepts and Methods, Shelter Island, New York, 1998. Chapman & Hall. Extended version published as Cornell University technical report TR98-1666.
No context found.
Crary, K. (1998b) Programming language semantics in foundational type theory.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC