LEA

leading the innovation in designing a programming language easy for everyone.

find out more

We are all about empowering people via programmability in design:

Innovations in process automation are poised to open up exciting design opportunities. In this avenue, LEA strives to take the human element seriously so as to ensure that the benefit of such innovations is inclusive, diverse and sensible. General programmability in design is key in empowering people to make informed decisions about their process automation needs, in enabling adaptive design and in sustaining the usefulness of design artefacts. LEA has been developing a paradigm-shifting dataflow programming language called LEAF. The language is designed with non-programmers in mind, and is based on the flow not of controls but of data so that anyone can apply easy-to-understand, data-centric reasonging processes to accomplish programming tasks. By empowering people with coding capabilities, LEAF redefines how digital technologies can be produced, distributed and consumed. Using LEAF does not require a rigorous Jedi training nor a degree in computer science. All that is needed is the passion to create wonderful things without neglecting the aspect of programmability by the people for the people.

Programming languages are out of reach for the many

As it stands, less than 0.5% of people in the world know how to read and write any programming language. Attempts to lower the bar for programming, epitomised by code.org campaigns or by introducing English-like coding syntax, albeit helpful, are doomed to repeat the failure of popularising mathematics at scale. Why so? Because conventional programming languages are difficult and aesthetically boring no matter how they are presented.

LEAF is easy and much more avant-garde in its visuals, making it fun to play with. Please browse through example LEAF constructs in the following to get a taste of this exciting new language on the block.

Recursion

Recursion is a way of defining a problem in terms of itself and its predecessor or successor. Shown here is an example of how recursion can be constructed in LEAF to perform factorial calculation. The example LEAF code was authored to accept input via query strings, and to expect query string variables named "input" and "rec". Here, "input" is a starting number (largest) in factorial calculation. "rec" is used to select which execution path, therefore which recursion method, to take in the main LEAF graph.


Following are links to the LEAFgon page with arbitrary input values to serve as starting points.
recursion with input=3 and rec=leaflisp
recursion with input=3 and rec=leaf
recursion with input=3 and rec=ycomb

LEAFlisp

LEAFlisp is a Lisp dialect with very simple syntax, forming a part of the LEAF language to fill the gap of offering textual flexibility. LEAFlisp nodes in LEAF constructs can be used to convert input data into output data, based on some user-defined data-processing logic.


Please check this LEAFlisp example showcasing an example data-processing logic that addresses how a new employee's projected contribution can be converted to an equity ownership in a startup. The calculation is based on Paul Graham's (Y-Combinator cofounder) note on the equity equation.


Please note: in order to open the text editor menu for seeing the LEAFlisp code, the LEAFlisp node with a wizard hat needs to be touched or clicked for over half a second. Once you are in the editor, you can run the code by pressing Ctrl-G on your keyboard. Don't forget to head over to the LEAFgon page first before touching the hat! The hat imagery you see on this page is just for illustrative purposes, not the real deal. :)

Get in touch,
find out about our exciting projects,
and join the revolution to start the future!

Address

LE Automaton Ltd
9-11 Standard Road, Standard Studios
London NW10 6EX
United Kingdom

Primary Contact

Dr Sunny Park
Director
spark{at}leautomaton{dot}com