Skip to content

GitLab

  • Projects
  • Groups
  • Snippets
  • Help
    • Loading...
  • Help
    • Help
    • Support
    • Community forum
    • Submit feedback
    • Contribute to GitLab
  • Sign in
C
compiler
  • Project overview
    • Project overview
    • Details
    • Activity
    • Releases
  • Repository
    • Repository
    • Files
    • Commits
    • Branches
    • Tags
    • Contributors
    • Graph
    • Compare
  • Issues 16
    • Issues 16
    • List
    • Boards
    • Labels
    • Service Desk
    • Milestones
  • Operations
    • Operations
    • Incidents
  • Analytics
    • Analytics
    • Repository
    • Value Stream
  • Wiki
    • Wiki
  • Snippets
    • Snippets
  • Members
    • Members
  • Collapse sidebar
  • Activity
  • Graph
  • Create a new issue
  • Commits
  • Issue Boards
  • clean-compiler-and-rts
  • compiler
  • Issues
  • #63

Closed
Open
Opened Mar 19, 2020 by Camil Staps@cstaps🚀Developer

More aggressive optimizations for lambdas

In clean-and-itasks/iTasks-SDK!387 (merged) I noticed that writing \_ k -> key == k was faster than const ((==) key). This is even the case if const were a macro.

Is it possible to fill in arguments of lambdas when they are already known? For example, I would expect to see the same code generated for these two Start rules:

Start = ((\x _ -> x) ((==) 0)) () 1
Start = (\_ -> (==) 0) () 1
To upload designs, you'll need to enable LFS and have admin enable hashed storage. More information
Assignee
Assign to
None
Milestone
None
Assign milestone
Time tracking
None
Due date
None
Reference: clean-compiler-and-rts/compiler#63