
LISP
 Referenced in 126 articles
[sw07201]
 notation of Alonzo Church’s lambda calculus. It quickly became the favored programming language...

Featherweight Java
 Referenced in 89 articles
[sw16204]
 even assignment) to obtain a small calculus, Featherweight Java, for which rigorous proofs ... similar relation to Java as the lambdacalculus does to languages such...

Church
 Referenced in 49 articles
[sw08946]
 based on the Lisp model of lambda calculus, containing a pure Lisp as its deterministic...

HOPLA
 Referenced in 14 articles
[sw02330]
 viewed as an extension of the lambda calculus with a “prefixed sum”, in which types...

PLAN
 Referenced in 13 articles
[sw22065]
 based on the simply typed lambda calculus and provides a restricted set of primitives...

Transactors
 Referenced in 6 articles
[sw20929]
 calculus, an extended lambdacalculus based on the actor model, and illustrate its usage through...

MixML
 Referenced in 6 articles
[sw22612]
 language called LTG – namely, a polymorphic lambda calculus with singleassignment references and recursive type...

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 lambdacalculus 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 lambdacalculus reduction), relies on a strategy for directed virtual...

TILC
 Referenced in 2 articles
[sw17746]
 TILC: The Interactive LambdaCalculus Tracer. This paper introduces TILC: the interactive lambdacalculus tracer ... main basic concepts of pure untyped lambdacalculus. This is achieved by allowing users ... sort of parsetree of the lambdaterms and automatically reproducing these interactions ... operational semantics of lambdacalculus. TILC has been built using HASKELL, and the tools wxHaskell...

CRSX
 Referenced in 4 articles
[sw23630]
 Rule and term syntax based on lambdacalculus and term rewriting conventions including Unicode support...

MicroRogue
 Referenced in 2 articles
[sw13590]
 system combining the central ideas of $lambda$calculus and term rewriting. The rewriting is explicit...

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...

TemplateCoq
 Referenced in 2 articles
[sw27569]
 extract Coq terms to a CBV $lambda$calculus [13]. However, the syntax lacked semantics...

Knuth Bendix Orders
 Referenced in 3 articles
[sw28584]
 Bendix orders for higherorder terms without lambdaabstraction and proves many useful properties about ... basis of a higherorder superposition calculus...

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...

lambda
 Referenced in 1 article
[sw05521]
 Lambda is an interactive Lambda calculus interpreter. It reduces lambda expressions and converts them into...

foetus
 Referenced in 1 article
[sw22668]
 introduce a simple functional language foetus (lambda calculus with tuples, constructors and pattern matching) supplied...

XFun
 Referenced in 1 article
[sw14200]
 based on a typed lambda calculus that enables its inmemory implementation...

VMlambda
 Referenced in 1 article
[sw17460]
 standard simply typed callbyvalue lambdacalculus. Although this extension, VMlambda, is simple...