Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Conditions - if then else. #3

Open
dannywillems opened this issue Apr 17, 2017 · 1 comment
Open

Conditions - if then else. #3

dannywillems opened this issue Apr 17, 2017 · 1 comment
Labels
DIFFICULTY:hard Syntactic sugar

Comments

@dannywillems
Copy link
Owner

See Church encoding.
@dannywillems dannywillems mentioned this issue Apr 18, 2017
Closed
@dannywillems
Copy link
Owner Author

It implies to work in two times when parsing and resolve types equation as in OCaml.
We need to have a ParseTree where we have no types except those annotating terms like params or recursive modules or ascription and another, TypedTree which annotates all nodes of the ParseTree.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
DIFFICULTY:hard Syntactic sugar
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@dannywillems