- Higher-order Representation of Substructural Logics Carnegie Mellon University
- A Simple Proof of Call-by-Value Standardization Carnegie Mellon University
- GDP Festschrift ENTCS, to appear Syntactic Logical Relations for Polymorphic
- Foundational Certified Code in a Metalogical KARL CRARY and SUSMIT SARKAR
- Type-safe Distributed Programming with ML5 Tom Murphy VII, Karl Crary, and Robert Harper
- JFP 15 (2): 249291, 2005. c 2005 Cambridge University Press DOI: 10.1017/S0956796804005441 Printed in the United Kingdom
- A Symmetric Modal Lambda Calculus for Distributed Computing Tom Murphy VII
- Safe and Flexible Dynamic Linking of Native Michael Hicks1
- Principles and a Preliminary Design for ML2000 The ML2000 Working Group
- Toward a Foundational Typed Assembly Language December 5, 2002
- A Type System for Higher-Order Modules Derek Dreyer Karl Crary Robert Harper
- Small proof witnesses for LF Susmit Sarkar1
- A Typed Interface for Garbage Collection Joseph C. Vanderwaart Karl Crary
- Toward a Foundational Typed Assembly Language December 5, 2002
- Towards a Mechanized Metatheory of Standard ML Daniel K. Lee Karl Crary Robert Harper
- An Expressive, Scalable Type Theory for Certified Code Karl Crary Joseph C. Vanderwaart
- Under consideration for publication in J. Functional Programming 1 Intensional Polymorphism in TypeErasure
- Typed Compilation of Inclusive Subtyping Carnegie Mellon University
- StackBased Typed Assembly Language GREG MORRISETT \Lambda
- Distributed Control Flow with Classical Modal Logic
- Typed Memory Management via Static Capabilities DAVID WALKER
- From System F to Typed Assembly Language GREG MORRISETT
- From System F to Typed Assembly Language \Lambda Greg Morrisett David Walker Karl Crary Neal Glew
- Programming Language Semantics in Foundational Type Theory Karl Crary \Lambda
- An Expressive, Scalable Type Theory for Certified Code Karl Crary Joseph C. Vanderwaart
- Programming Language Semantics in Foundational Type
- Foundations for the Implementation of HigherOrder Subtyping Karl Craryy
- Simple, Efficient Object Encoding using Intersection Types Carnegie Mellon University
- A Syntactic Account of Singleton Types via Hereditary Substitution Carnegie Mellon University
- A Separate Compilation Extension to Standard ML David Swasey Tom Murphy VII Karl Crary Robert Harper
- Typed Compilation of Recursive Datatypes Joseph C. Vanderwaart Derek Dreyer Leaf Petersen
- A Type Theory for Memory Allocation and Data Layout Leaf Petersen Robert Harper Karl Crary Frank Pfenning
- A Typed Interface for Garbage Collection Joseph C. Vanderwaart Karl Crary
- Toward a Foundational Typed Assembly Language Carnegie Mellon University
- A Type Theory for Memory Allocation and Data Layout # Leaf Petersen Robert Harper Karl Crary Frank Pfenning
- A Simpli ed Account of the Metatheory of Linear LF 1
- Toward a Foundational Typed Assembly Language Carnegie Mellon University
- A Type System for HigherOrder Modules # Derek Dreyer Karl Crary Robert Harper
- Sound and Complete Elimination of Singleton Carnegie Mellon University
- Programming Language Semantics in Foundational
- Transparent and Opaque Interpretations of Karl Crary Robert Harper Perry Cheng
- Admissibility of Fixpoint Induction over Partial Types
- Trustless Grid Computing in ConCert # BorYuh Evan Chang, Karl Crary, Margaret DeLap, Robert Harper,
- Typed Compilation of Recursive Datatypes # Joseph C. Vanderwaart Derek Dreyer Leaf Petersen
- Explicit Contexts in LF Carnegie Mellon University
- TYPE-THEORETIC METHODOLOGY FOR PRACTICAL PROGRAMMING LANGUAGES
- Principles and a Preliminary Design for ML2000 The ML2000 Working Group \Lambda
- Explicit Contexts in LF Carnegie Mellon University
- Trustless Grid Computing in ConCert Bor-Yuh Evan Chang, Karl Crary, Margaret DeLap, Robert Harper,
- Foundations for the Implementation of Higher-Order Subtyping Karl Craryy
- Programming Language Semantics in Foundational Type Theory Karl Crary*
- Transparent and Opaque Interpretations of Datatypes
- Simple, Efficient Object Encoding using Intersection Types Karl Crary
- Admissibility of Fixpoint Induction over Partial Types
