Last active
March 5, 2018 17:20
-
-
Save hanshoglund/d652af3d703c095918cf3e4b95cac17e to your computer and use it in GitHub Desktop.
Booleans.md
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Given a basic typed lambda calculus E | |
E := x | E E | \x:T -> E | |
| Succ E | Z | |
| (E, E) | E.fst | E.snd | |
| True | False | if E then E else E | |
and a base boolean language B | |
B := | |
| E && E | |
| E || E | |
| not E | |
| True | |
| False | |
Can we compile E -> B? |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment