Christopher A. Stone, Robert Harper  Home/Search
Context Related
| cmu.edu/anon/1999/CMUCS99155.ps 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/~fox/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Work on the TILT compiler for Standard ML led us to study a language with singleton kinds: S(A) is the kind of all types provably equivalent to the type A. Singletons are interesting because they provide a very general form of definitions for type variables and allow fine-grained control of type computations. Internally, TILT represents programs using a predicative variant of Girard's F! enriched with singleton kinds, dependent product and function kinds (\Sigma and \Pi), and a sub-kinding... (Update)
Cited by: More
Strict Bidirectional Type Checking - Adam Chlipala Computer (Correct)
Modular Type Classes - Derek Dreyer Toyota (2006) (Correct)
Typed Compilation of Recursive Datatypes - Vanderwaart, Dreyer, Petersen.. (Correct)
Similar documents (at the sentence level):
26.9%: Deciding Type Equivalence in a Language with Singleton Kinds - Stone, Harper (2000) (Correct)
Active bibliography (related documents): More All
0.1: Type-Safe Linking and Modular Assembly Language - Glew, Morrisett (1999) (Correct)
0.1: Basic theory of F-bounded quantification - Baldan, Ghelli, Raffaetą (Correct)
0.1: Typed Cross-Module Compilation - Shao (1998) (Correct)
Similar documents based on text:
99.0: Unknown - (Correct)
Related documents from co-citation: More All
24: A type theoretic approach to higher-order modules with sharing - Harper, Lillibridge - 1994
21: Higher-order modules and the phase distinction - Harper, Mitchell et al. - 1990
20: Applicative functors and fully transparent higher-order modules - Leroy - 1995
BibTeX entry: (Update)
Christopher A. Stone and Robert Harper. Deciding type equivalence in a language with singleton kinds. Technical Report CMUCS -99-155, Department of Computer Science, Carnegie Mellon University, 1999. http://citeseer.ist.psu.edu/stone99deciding.html More
@inproceedings{ stone00deciding,
author = "Christopher A. Stone and Robert Harper",
title = "Deciding Type Equivalence in a Language with Singleton Kinds",
booktitle = "{ACM} {S}ymposium on {P}rinciples of {P}rogramming {L}anguages ({POPL}), Boston, Massachusetts",
month = "19--21,",
pages = "214--227",
year = "2000",
url = "citeseer.ist.psu.edu/stone99deciding.html" }
Citations (may not include all citations):566 Proof-Carrying Code - Necula - 1997
215 A Type-Theoretic Approach to Higher-Order Modules with Shari.. - Harper, Lillibridge - 1994
210 TIL: A Type-Directed Optimizing Compiler for ML - Tarditi, Morrisett et al. - 1996
138 Typed Closure Conversion - Minamide, Morrisett et al. - 1996
128 and separate compilation (context) - Leroy, modules - 1994
121 Higher-order Modules and the Phase Distinction - Harper, Mitchell et al. - 1990
96 An Algorithm for Testing Conversion in Type Theory (context) - Coquand - 1991
75 Applicative Functors and Fully Transparent Higher-Order Modu.. - Leroy - 1995
48 Translucent Sums: A Foundation for Higher-Order Module Syste.. - Lillibridge - 1997
38 Pure Type Systems with definitions - Severi, Poll - 1994
35 Typed Cross-Module Compilation - Shao - 1998
32 Subtyping with Singleton Types - Aspinall - 1995
27 Lambda-Splitting: A Higher-Order Approach to Cross-Module Op.. - Blume, Appel - 1997
18 Type-Theoretic Methodology for Practical Programming Languag.. - Crary - 1998
16 Department of Computer Science (context) - Morrisett, Walker et al. - 1997
8 Available as CMU Technical Report CMU-CS (context) - Morrisett, Types et al. - 1995
6 Decidability and Confluence of fijtop Reduction in F (context) - Curien, Ghelli - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cmu.edu/~fox/publications.html): More
A Modal Analysis of Staged Computation - Davies, Pfenning (1995) (Correct)
Toward a Practical Type Theory for Recursive Modules - Dreyer, Harper, Crary (2001) (Correct)
Replication-Based Incremental Copying Collection - Nettles, O'Toole, Pierce.. (1993) (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