Sound and complete elimination of singleton kinds

Authors:
Karl Crary
Affiliations:
Carnegie Mellon University, Pittsburgh, PA
Venue:
ACM Transactions on Computational Logic (TOCL)
Year:
2007

Citing 20
Cited 2

Higher-order modules and the phase distinction

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Manifest types, modules, and separate compilation

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A type-theoretic approach to higher-order modules with sharing

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Compiling polymorphism using intensional type analysis

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Applicative functors and fully transparent higher-order modules

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Typed closure conversion

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Typed cross-module compilation

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Implementing typed intermediate languages

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Transparent modules with fully syntatic signatures

Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Flexible type analysis

Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
From system F to typed assembly language

ACM Transactions on Programming Languages and Systems (TOPLAS)
Deciding type equivalence in a language with singleton kinds

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A type-theoretic interpretation of standard ML

Proof, language, and interaction
Typed memory management via static capabilities

ACM Transactions on Programming Languages and Systems (TOPLAS)
A type system for certified binaries

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A type system for higher-order modules

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Subtyping with Singleton Types

CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
A modular module system

Journal of Functional Programming
Intensional polymorphism in type-erasure semantics

Journal of Functional Programming
Stack-based typed assembly language

Journal of Functional Programming

Dynamic Translucency with Abstraction Kinds and Higher-Order Coercions

Electronic Notes in Theoretical Computer Science (ENTCS)
A syntactic account of singleton types via hereditary substitution

Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice

Quantified Score

Hi-index	0.00

Visualization

Abstract

Singleton kinds provide an elegant device for expressing type equality information resulting from modern module languages, but they can complicate the metatheory of languages in which they appear. I present a translation from a language with singleton kinds to one without, and prove this translation to be sound and complete. This translation is useful for type-preserving compilers generating typed target languages. The proof of soundness and completeness is done by normalizing type equivalence derivations using Stone and Harper's type equivalence decision procedure.