Skip to content
This repository has been archived by the owner on May 20, 2018. It is now read-only.

Ad hoc compilation strategies #159

Open
1 task
robrix opened this issue Oct 31, 2015 · 0 comments
Open
1 task

Ad hoc compilation strategies #159

robrix opened this issue Oct 31, 2015 · 0 comments
Labels

Comments

@robrix
Copy link
Contributor

robrix commented Oct 31, 2015

With #158, we will be able to compile well-typed programs to well-typed LLVM. However, the general compilation strategy may not be very efficient, e.g. for datatypes, which are encoded as functions.

Any ad hoc compilation strategy which preserves the semantics is well-formed, and some of them may be vastly more efficient.

Therefore, we should be able to select a different compilation strategy for some (sub-)programs, e.g.:

  • Boolean → 1-bit integer.
  • Maybe → pointer w/ 0 representing the nothing case.
  • Maybe Boolean → 2-bit integer.
  • List Boolean → bitfield.
@robrix robrix added the feature label Oct 31, 2015
@robrix robrix changed the title “Ad hoc” compilation strategies Ad hoc compilation strategies Oct 31, 2015
Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Labels
Projects
None yet
Development

No branches or pull requests

1 participant