Home

Welcome to the lambda-p wiki!

Lambda-p at its core is a Syntax/notation that has very few semantics and closely follows the syntax of the lambda calculus. When looking at the notation you'll see it has no execution semantics; all semantics are driven by the libraries referenced by the notation. At the top level of the notation, everything is contained within routines. The scope of everything within a routine is other statements or parameters within the routine.

This deviates greatly from traditional programming languages that tie a wide range of semantics to the syntax of the language. The primary advantage is that the notation is independent of the execution environment; hopefully this will allow flexibility and offer new areas of research in compiler tools.

Lambda-p has a flexible Binding phase. Most programming languages have a fixed binding defined in a declarative fashion essentially limiting them to having a fixed signature. In lambda-p the binding phase is performed procedurally allowing compile-time, argument-dependent, function-generators, giving the performance and reliability of static function call generation and moving additional run-time computations to compile-time.