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.

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

Pipes for lambda clauses #1639

Closed
jonaprieto opened this issue Nov 22, 2022 · 1 comment · Fixed by #1781
Closed

Pipes for lambda clauses #1639

jonaprieto opened this issue Nov 22, 2022 · 1 comment · Fixed by #1781

Comments

@jonaprieto
Copy link
Collaborator

Add pipes instead of semicolons, as follows:

f : (A : Type) -> List A -> Nat;
f := \ {
     []        := 0
   | (x :: xs) := 1 + f xs
  };
@jonaprieto jonaprieto added this to the 0.3 milestone Nov 22, 2022
@janmasrovira janmasrovira self-assigned this Nov 23, 2022
@lukaszcz
Copy link
Collaborator

lukaszcz commented Jan 5, 2023

I just thought that maybe it's not so clear if we should have pipes here. Because one can see this also as analogous to a function definition where we end each clause with a semicolon. But on the other hand it does reflect the syntax of inductive types with the pipe. I don't know.

jonaprieto added a commit that referenced this issue Jan 19, 2023
* Closes #1597 
* Closes #1624 
* Closes #1633 

The tutorial uses syntax which has not been implemented yet: it depends
on
- #1637, 
- #1716, 
- #1639,
- #1638.

The tutorial also assumes the following issues are done: 
- #1720, and
- #1701.

Co-authored-by: Jonathan Cubides <[email protected]>
@janmasrovira janmasrovira linked a pull request Jan 27, 2023 that will close this issue
jonaprieto pushed a commit that referenced this issue Jan 30, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging a pull request may close this issue.

3 participants