Karl Crary  Home/Search
Context Related
| cmu.edu/People/crary/pap...thesis.ps.gz cmu.edu/~crary/papers/19...thesis.ps.gz cmu.edu/~crary/papers/19...thesis.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/People/crary/papers/ (more) From: cmu.edu/~crary/papers/ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The significance of type theory to the theory of programming languages has long been recognized. Advances in programming languages have often derived from understanding that stems from type theory. However, these applications of type theory to practical programming languages have been indirect; the differences between practical languages and type theory have prevented direct connections between the two. This dissertation presents systematic techniques directly relating practical programming... (Update)
Context of citations to this paper: More
...ends for toy languages meant to demonstrate the viability of Talx86 as a target language. We are also working on a front end for KML [Cra98], a variant of ML with higher order modules, full polymorphism, and subtyping among other features. 256 Conclusion This paper presents...
Cited by: More
Deciding Type Equivalence in a Language with Singleton Kinds - Stone, Harper (1999) (Correct)
Subtyping with Power Types - David Aspinall Http (2000) (Correct)
Type-Safe Linking and Modular Assembly Language - Glew, Morrisett (1999) (Correct)
Similar documents (at the sentence level):
9.8%: Admissibility of Fixpoint Induction over Partial Types - Crary (1998) (Correct)
8.4%: Programming Language Semantics in Foundational Type Theory - Crary (1996) (Correct)
Active bibliography (related documents): More All
1.5: Hybrid Partial-Total Type Theory - Scott Smith (1995) (Correct)
0.8: Simple, Efficient Object Encoding using Intersection Types - Crary (1999) (Correct)
0.6: Computational Complexity and Induction for Partial.. - Constable, Crary (1999) (Correct)
Similar documents based on text: More All
0.2: Design Of MEMS Via Efficient Simulation Of Fabrication - Hubbard, Antonsson (1996) (Correct)
0.2: Recent Developments In RF Front Ends Based Upon Active.. - Fredrick, Itoh (2001) (Correct)
0.1: Safe and Flexible Dynamic Linking of Native Code - Hicks, Weirich, Crary (2000) (Correct)
Related documents from co-citation: More All
11: A type theoretic approach to higher-order modules with sharing - Harper, Lillibridge - 1994
10: and separate compilation (context) - Leroy, modules
10: TIL: A type-directed optimizing compiler for ML - Tarditi, Morrisett et al. - 1995
BibTeX entry: (Update)
Karl Crary. Type-Theoretic Methodology for Practical Programming Languages. PhD thesis, Department of Computer Science, Cornell University, Ithaca, New York, 1998. Forthcoming. http://citeseer.ist.psu.edu/48403.html More
@techreport{ crary98typetheoretic,
author = "Karl Crary",
title = "Type-Theoretic Methodology for Practical Programming Languages",
number = "TR98-1699",
month = "19,",
pages = "0",
year = "1998",
url = "citeseer.ist.psu.edu/48403.html" }
Citations (may not include all citations):1074 The Definition of Standard ML (context) - Milner, Tofte et al. - 1997
1074 The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
592 Introduction to HOL: A Theorem Proving Environment for Highe.. (context) - Gordon, Melham - 1993
505 Implementing Mathematics with the Nuprl Proof Development Sy.. - Constable, Allen et al. - 1986
434 A framework for defining logics - Harper, Honsell et al.
369 Information and Computation (context) - Moggi, computation - 1991
311 Abstract types have existential type (context) - Mitchell, Plotkin - 1988
293 The essence of functional programming - Wadler - 1992
266 Information and Computation (context) - Coquand, Huet et al. - 1988
254 Comprehending monads - Wadler - 1992
244 Imperative functional programming - Jones, Wadler - 1993
215 A type-theoretic approach to higher-order modules with shari.. - Harper, Lillibridge - 1994
210 TIL: A typedirected optimizing compiler for ML - Tarditi, Morrisett et al. - 1996
201 to typed assembly language (context) - Morrisett, Walker et al. - 1998
162 Unboxed objects and polymorphic typing - Leroy - 1992
157 Edinburgh LCF: A Mechanised Logic of Computation (context) - Gordon, Milner et al. - 1979
141 Constructive mathematics and computer programming (context) - Martin-Lof - 1982
131 The essence of Algol (context) - Reynolds - 1981
125 Outline of a mathematical theory of computation (context) - Scott - 1970
121 Higher-order modules and the phase distinction - Harper, Mitchell et al. - 1990
101 Simple type-theoretic foundations for objectoriented program.. - Pierce, Turner - 1994
101 ACM Transactions on Programming Languages and Systems (context) - Harper, Mitchell et al. - 1993
101 ACM Transactions on Programming Languages and Systems (context) - Constable, Zlatin et al. - 1984
98 Using dependent types to express modular structure - MacQueen - 1986
97 Stack-based typed assembly language - Morrisett, Crary et al. - 1998
96 A survey of the project Automath (context) - de Bruijn - 1980
94 Equality in lazy computation systems - Howe - 1989
89 Springer-Verlag (context) - Abadi, Cardelli et al. - 1996
82 Typeful programming - Cardelli - 1991
79 Polymorphic type schemes and recursive definitions (context) - Mycroft - 1984
77 Lisp and Symbolic Computation (context) - Launchbury, Jones et al. - 1995
76 Toward a mathematical semantics for computer languages (context) - Scott, Strachey - 1971
75 Applicative functors and fully transparent higher-order modu.. - Leroy - 1995
75 A paradigmatic object-oriented programming language: Design - Bruce - 1994
67 Inheritance as implicit coercion (context) - Breazu-Tannen, Coquand et al. - 1991
65 A semantics for higher-order functors - MacQueen, Tofte - 1994
64 Metamathematical investigations of a calculus of constructio.. (context) - Coquand - 1990
56 The formulas-as-types notion of construction (context) - Howard - 1980
56 Explicit polymorphism and CPS conversion - Harper, Lillibridge - 1993
56 bounded quantification for object-oriented programming (context) - Canning, Cook et al. - 1989
52 A type-theoretic interpretation of Standard ML - Harper, Stone - 1998
47 The Coq Proof Assistant Reference Manual (context) - Barras, Boutin et al. - 1996
47 Enhancing the Nuprl Proof Development System and Applying it.. - Jackson - 1995
44 An analysis of Girard's paradox - Coquand - 1986
44 Structural subtyping and the notion of power type - Cardelli - 1988
43 Department of Computer Science (context) - Constable, of et al. - 1982
41 Comparing object encodings - Bruce, Cardelli et al. - 1997
41 Objective ML: A simple object-oriented extension of ML (context) - R'emy, Vouillon - 1997
40 Inheritance in Smalltalk-80: A denotational definition (context) - Kamin - 1988
40 Interpr'etation fonctionelle et 'elimination des coupures de.. (context) - Girard - 1972
40 modules and separate compilation (context) - Leroy - 1994
39 A Non-Type-Theoretic Semantics for Type-Theoretic Language (context) - Allen - 1987
36 School of Computer Science (context) - Morrisett, Types et al. - 1995
29 Proofs and Types (context) - Girard, Lafont et al. - 1988
28 Semantic foundations for embedding HOL in Nuprl - Howe - 1996
27 Programming objects with ML-ART: An extension to ML with abs.. (context) - R'emy - 1994
25 A non-type-theoretic definition of Martin-Lof's types (context) - Allen - 1987
25 Institut National de Recherche en Informatique et Automatiqu.. (context) - Leroy, Caml et al. - 1996
24 Partial objects in constructive type theory (context) - Constable, Smith - 1987
22 Personal communication (context) - Harper - 1993
22 Phase distinctions in type theory - Cardelli - 1988
20 School of Computer Science (context) - Filinski, Ph et al. - 1996
18 Relational interpretations of recursive types in an operatio.. - Birkedal, Harper - 1997
18 A theory of primitive objects: Untyped and first-order syste.. (context) - Abadi, Cardelli - 1994
18 Partial objects in the calculus of constructions - Audebaud - 1991
16 An interpretation of objects and object types (context) - Abadi, Cardelli et al. - 1996
15 Foundations for the implementation of higher-order subtyping - Crary - 1997
15 Computational foundations of basic recursive function theory - Constable, Smith - 1988
14 Theoretical Computer Science (context) - Harper, Pollack et al. - 1991
13 Formal objects in type theory using very dependent types - Hickey - 1996
13 The computational behaviour of Girard's paradox (context) - Howe - 1987
11 Cambridge University Press (context) - Whitehead, Russell - 1910
10 Computational complexity and induction for partial computabl.. - Constable, Crary - 1997
10 Recursive models for constructive set theories (context) - Beeson - 1982
9 Inductive Definition in Type Theory (context) - Mendler - 1987
9 Department of Computer Science (context) - Smith, in et al. - 1989
9 Constructing type systems over an operational semantics (context) - Harper - 1992
8 Admissibility of fixed-point induction in first-order logic .. (context) - Igarashi - 1972
7 Type' is not a type (context) - Meyer, Reinhold - 1986
7 de l'interpr'etation de Godel `a l'analyse, et son applicati.. (context) - Girard - 1971
7 Lattice theoretic models for various type-free calculi (context) - Scott - 1972
7 Catenable double-ended queues - Okasaki - 1997
7 An environment for automated reasoning about partial functio.. (context) - Basin - 1988
6 Oxford Logic Guides (context) - Dummett, Intuitionism - 1977
5 Semantics of constructive type theory (context) - Rezus - 1985
5 Domain interpretations of intuitionistic type theory (context) - Palmgren, Stoltenberg-Hansen - 1989
4 Hybrid partial-total type theory - Smith - 1995
4 An information system interpretation of Martin-Lof's partial.. (context) - Palmgren - 1993
3 Type theory as a foundation for computer science (context) - Constable - 1991
3 efficient object encoding using intersection types (context) - Crary - 1998
3 Formal reasoning about communications systems (context) - Kreitz - 1997
2 A semantics of objects in type theory (context) - Hickey - 1997
2 Frege structures revisited (context) - Aczel - 1983
2 The Nuprl Proof Development System (context) - Jackson - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cmu.edu/People/crary/papers/): More
Admissibility of Fixpoint Induction over Partial Types - Crary (1998) (Correct)
Typed Memory Management in a Calculus of Capabilities - Crary, Walker, Morrisett (1999) (Correct)
Programming Language Semantics in Foundational Type Theory - Crary (1996) (Correct)
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