K. Crary. KML Reference Manual. Department of Computer Science, Cornell University, 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of refinement occurs in # ML i . For example, consider: ##.#x:#.typecase # of # 1 # 2 # e 1 . x initially has static type #, but in expression e 1 it is refined to # 1 # 2 . While type dispatch constructs in functional languages have been studied formally [HM95, Mor95, CWM98, CW99, etc. this work does not extend to object oriented languages as it neglects two important features: subtypes and the creation of new (i.e. generative) types. To my knowledge, this paper is the first to formalise type dispatch constructs common in object oriented languages. The tagging ....

....called Popcorn, a safe C like language. Popcorn has ML style exceptions, and the compiler was modified to use the new type tagging mechanisms instead of the old ad hoc mechanisms. 6 Related Work This work is closely related to work on type dispatch in functional languages [HM95, Mor95, CWM98, CW99, etc. In particular, the work on # R [CWM98] and its follow up LX [CW99] both address the implementation of # ML i type dispatch. There are two key di#erences between their work and mine. First, my tagging language is concerned with matching whole types and 14 their subtypes, whereas # ....

[Article contains additional citation context not shown here]

Karl Crary and Stephanie Weirich. Flexible type analysis. Technical report, Department of Computer Science, Cornell University, 4130 Upson Hall, Ithaca, NY 14853-7501, USA, 1999. Forthcoming, available at http://www.cs.cornell.edu/sweirich.

....suggested approaches to analyzing constraining the behavior with rules are: ffl Ko et. al [22] create an abstract program description of what a program is supposed to do. The abstract program contains conditions that have to be fulfilled for the program to be allowed to execute. ffl Levitt et. al [25] extend the AFS so that programs, as well as users, can get access restrictions. In addition to files, restrictions can also be set on file system operations, such as mkdir, rm etc. ffl Kephart [21] suggests (amongst other things) that decoy programs and files can be put into the file system to ....

Karl Levitt and Christopher Wee. A framework for auditing objects. Technical report, Department of Computer Science, UC Davis, 1995. .

No context found.

K. Crary. KML Reference Manual. Department of Computer Science, Cornell University, 1996.

No context found.

K. Crary. KML Reference Manual. Department of Computer Science, Cornell University, 1996.

....: # ; P Lemma 7.2 (Compiler Type Correctness) If # F e : # ; P then # TAL P 8 Extensions and Practice We claim that the framework presented here is a practical approach to compilation. To substantiate this claim, we are constructing a compiler called TALC that maps the KML programming language [11] to a variant of the TAL described here, suitably adapted for the Intel x86 family of processors. We have found it straightforward to enrich the target language type system to include support for other type constructors, such as references, higher order constructors, and recursive types. We ....

Karl Crary. KML Reference Manual. Department of Computer Science, Cornell University, 1996.

....code will either diverge or produce a TAL value of the appropriate type. 6 Extensions and Practice We claim that the framework presented here is a practical approach to compilation. To substantiate this claim, we are constructing a compiler called TALC that maps the KML programming language [10] to a variant of the TAL described here, suitably adapted for the Intel x86 family of processors. We have found it straightforward to enrich the target language type system to include support for other type constructors, such as references, higher order constructors, and recursive types. We ....

K. Crary. KML Reference Manual. Department of Computer Science, Cornell University, 1996.

....the work by Hieb et al. HDB90] cannot be modeled in this system without adding new primitives. However, we claim that the framework presented here is a practical approach to compilation. To substantiate this claim, we are constructing a compiler called TALC that maps the KML programming language [Cra96] to a variant of STAL described here, suitably adapted for the Intel x86 family of processors. We have found it straightforward to enrich the target language type system to include support for other type constructors, such as references, higher order constructors, and recursive types. The ....

Karl Crary. KML Reference Manual. Department of Computer Science, Cornell University, 1996.

....such as the work by Hieb et al. 15] cannot be modeled in this system without adding new primitives. However, we claim that the framework presented here is a practical approach to compilation. To substantiate this claim, we are constructing a compiler called TALC that maps the KML language [10] to a variant of STAL described here, suitably adapted for the Intel IA32 architecture. We have found it straightforward to enrich the target language type system to include support for other type constructors, such as references, higher order constructors, and recursive types. The compiler uses ....

Karl Crary. KML Reference Manual. Department of Computer Science, Cornell University, 1996.

....F e : P Lemma 7.2 (Compiler Type Correctness) If F e : P then TAL P 8 Extensions and Practice We claim that the framework presented here is a practical approach to compilation. To substantiate this claim, we are constructing a compiler called TALC that maps the KML programming language [11] to a variant of the TAL described here, suitably adapted for the Intel x86 family of processors. We have found it straightforward to enrich the target language type system to include support for other type constructors, such as references, higher order constructors, and recursive types. We ....

Karl Crary. KML Reference Manual. Department of Computer Science, Cornell University, 1996.

....code will either diverge or produce a TAL value of the appropriate type. 6 Extensions and Practice We claim that the framework presented here is a practical approach to compilation. To substantiate this claim, we are constructing a compiler called TALC that maps the KML programming language [10] to a variant of the TAL described here, suitably adapted for the Intel x86 family of processors. We have found it straightforward to enrich the target language type system to include support for other type constructors, such as references, higher order constructors, and recursive types. We ....

K. Crary. KML Reference Manual. Department of Computer Science, Cornell University, 1996.

....coercion, so the higher order solution proves to be a generalization of the second order one. We formalize the technique by giving a translation of programs from a source calculus into a subsumption free target calculus. This translation is used in the compiler for the KML programming language [15]. We also give a type theoretic construction that explains the translation as a construction of the source calculus that maintains constructivity while changing the interpretation of subtyping from one based on type inclusion to one based on the existence of semantics preserving coercions. This ....

....very much. The type theoretic construction also gives a framework for working out generalizations to more expressive type systems. In particular, the translation easily generalizes to the dependent record kinds of K [16] That generalized translation is put to practical use in the KML compiler [15]. We also claim, without elaboration, that the construction shows how to generalize the translation to Cardelli s formulation of F with monotone kinds [8] We also hope that the reconciliation of Section 5 can be used to manage complexity in formalized mathematics. In informal mathematics, a ....

Karl Crary. KML Reference Manual. Department of Computer Science, Cornell University, 1996.

No context found.

Karl Crary and Stephanie Weirich. Flexible type analysis. Technical report, Department of Computer Science, Cornell University, 4130 Upson Hall, Ithaca, NY 14853-7501, USA, 1999. Forthcoming, available at http://www.cs.cornell.edu/sweirich.

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