tal: An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)

[ language, library, mit ] [ Propose Tags ] [ Report a vulnerability ]

"From System F to Typed-Assembly Language"


[Skip to Readme]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1.0.0
Dependencies base (>=4.7 && <5), containers, mtl, pretty, transformers, unbound [details]
License MIT
Copyright 2015 Stephanie Weirich
Author Stephanie Weirich
Maintainer sweirich@cis.upenn.edu
Category Language
Home page https://github.com/sweirich/tal
Source repo head: git clone https://github.com/sweirich/tal
Uploaded by sweirich at 2016-08-23T17:23:04Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 786 total (1 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2016-08-23 [all 1 reports]

Readme for tal-0.1.0.0

[back to package description]

An implementation of a type-preserving Compiler, derived from the paper

From System F to Typed Assembly Language by Morrisett, Walker, Crary, Glew

I was inspired to implement this paper while preparing a talk for Papers We Love Philadelphia.

The implementation includes all passes described in the paper:

  • F ==> K (Typed CPS conversion)
  • K ==> C (Polymorphic closure conversion)
  • C ==> H (Hoisting, reuses the C language)
  • H ==> A (Allocation)
  • A ==> TAL (Code generation)

Each language (F, K, C, A, TAL) is defined in the corresponding source file. These implementations include the abstract syntax, small-step operational semantics, and type checker for the languages. The file Util.hs contains definitions common to all implementations.

The compiler itself is in the file Translate.hs. To run the compiler, load this file into ghci and try out one of the sample programs from F.hs.

In particular, you can try

 Translate*> printM $ compile F.sixfact

to see the TAL output for the factorial function applied to six.

If you would like to compile and then run this function you can try:

 Translate*> test F.sixfact