• # SUBSEXPL

• Referenced in 3 articles [sw00923]
• manipulation of expressions of the $\lambda$-calculus and of three different styles of explicit substitutions ... visualization of the contractions of the $\lambda$-calculus in de Bruijn notation, and of guided ... conditionals and repetitions in the $\lambda$-calculus are available.\parThe system can be executed over ... teaching basic properties of the $\lambda$-calculus such as: computational adequacy, the usefulness...
• # PELCR

• Referenced in 4 articles [sw20841]
• PELCR, parallel environment for optimal lambda-calculus reduction. In this article we present the implementation ... Lévy’s optimal reduction for the λ-calculus on parallel (or distributed) computing systems ... PELCR (parallel environment for optimal lambda-calculus reduction), relies on a strategy for directed virtual...
• # TILC

• Referenced in 2 articles [sw17746]
• TILC: The Interactive Lambda-Calculus Tracer. This paper introduces TILC: the interactive lambda-calculus tracer ... main basic concepts of pure untyped lambda-calculus. This is achieved by allowing users ... sort of parse-tree of the lambda-terms and automatically reproducing these interactions ... operational semantics of lambda-calculus. TILC has been built using HASKELL, and the tools wxHaskell...
• # Hazelnut

• Referenced in 2 articles [sw22659]
• Hazelnut: a bidirectionally typed structure editor calculus. Structure editors allow programmers to edit the tree ... based on a small bidirectionally typed lambda calculus extended with holes and a cursor. Hazelnut...
• # Anagopos

• Referenced in 1 article [sw17745]
• graph visualizer for term rewriting and lambda calculus. We present Anagopos, an open source tool ... visualizing reduction graphs of terms in lambda calculus and term rewriting. Anagopos allows step...