Toward a foundational typed assembly language
Author:
Open Access
- 15 January 2003
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 38 (1) , 198-212
Abstract
We present the design of a typed assembly language called TALT that supports heterogeneous tuples, disjoint sums, and a general account of addressing modes. TALT also implements the von Neumann model in which programs are stored in memory, and supports relative addressing. Type safety for execution and for garbage collection are shown by machine-checkable proofs. TALT is the first formalized typed assembly language to provide any of these features.Keywords
This publication has 12 references indexed in Scilit:
- Oracle-based checking of untrusted software2001
- A certifying compiler for Java2000
- Typability and type checking in System F are equivalent and undecidableAnnals of Pure and Applied Logic, 1999
- From system F to typed assembly languageACM Transactions on Programming Languages and Systems, 1999
- Type Structure for Low-Level Programming Languages1999
- From ML to Ada: Strongly-typed language interoperability via source translationJournal of Functional Programming, 1998
- Simple garbage-collector-safety1996
- A framework for defining logicsJournal of the ACM, 1993
- Implementing the meta-theory of deductive systemsLecture Notes in Computer Science, 1992
- Garbage collection in an uncooperative environmentSoftware: Practice and Experience, 1988