Each of these extracts the corresponding portion of the lambda-calculus expression. We can now write a version of occurs-free? that depends only on the interface. occurs-free? : Sym × LcExp → Bool ...

In pure lambda calculus, numerals and booleans are also expressed in terms of functions but to make it easy, the language supports integer and boolean literals, alongwith binary operations such as ...

The Vine programming language is a new experimental language built on interaction nets. It features interoperability between functional and imperative programming patterns. Vine is a statically ...