Singleton: a general-purpose dependently-typed assembly language

Authors:
Simon Winwood;Manuel Chakravarty
Affiliations:
National ICT Australia & University of New South Wales, Sydney, Australia;The University of New South Wales, Sydney, Australia
Venue:
Proceedings of the 7th ACM SIGPLAN workshop on Types in language design and implementation
Year:
2011

Citing 15
Cited 0

Refinement types for ML

PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
From system F to typed assembly language

ACM Transactions on Programming Languages and Systems (TOPLAS)
An axiomatic basis for computer programming

Communications of the ACM
CCured: type-safe retrofitting of legacy code

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A dependently typed assembly language

Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
An expressive, scalable type theory for certified code

Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Guarded recursive datatype constructors

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Inductive Definitions in the system Coq - Rules and Properties

TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
A linear logical framework

Information and Computation
A Syntactic Approach to Foundational Proof-Carrying Code

Journal of Automated Reasoning
Interactive Theorem Proving and Program Development

Interactive Theorem Proving and Program Development
A type system for certified binaries

ACM Transactions on Programming Languages and Systems (TOPLAS)
Refinement Types for Secure Implementations

CSF '08 Proceedings of the 2008 21st IEEE Computer Security Foundations Symposium
Dependent types from counterexamples

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Using dependent types to certify the safety of assembly code

SAS'05 Proceedings of the 12th international conference on Static Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present Singleton, a dependently typed assembly language. Based upon the calculus of inductive constructions, Singleton's type system allows procedures abstracting over terms, types, propositions, and proof terms. Furthermore, Singleton includes generalised singleton types. In addition to the primitive singleton types of other languages, these generalised singleton types allow the values from arbitrary inductive types to be associated with the contents of registers and memory locations. Along with Singleton's facility for term and proof abstraction, generalised singleton types allow strong statements to be made about the functional behaviour of Singleton programs. We have formalised basic properties of Singleton's type system, namely type safety and a type erasure property, using the Coq proof assistant.