graph-rewriting-lambdascope: Implementation of Lambdascope as an interactive graph-rewriting system

[ application, bsd3, compilers-interpreters, program ] [ Propose Tags ]

Lambdascope is an optimal implementation of the λβ-calculus described in the paper "Lambdascope - Another optimal implementation of the lambda-calculus" by Vincent van Oostrom, Kees-Jan van de Looij, and Marijn Zwitserlood. Examples of lambda terms are supplied in the "examples" directory.

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

Versions [RSS] 0.4.3, 0.4.4, 0.4.5, 0.4.6, 0.4.7, 0.4.8, 0.4.9, 0.4.10, 0.4.11, 0.5, 0.5.2, 0.5.3, 0.5.4, 0.5.5, 0.5.6, 0.5.7, 0.5.8, 0.5.9, 0.5.10, 0.5.11
Dependencies base (>=4 && <4.3), base-unicode-symbols (>=0.2 && <0.3), GLUT (>=2.2 && <2.3), graph-rewriting (>=0.4.4 && <0.5), graph-rewriting-gl (>=0.6 && <0.7), graph-rewriting-layout (>=0.4.1 && <0.5), IndentParser (>=0.2 && <0.3), OpenGL (>=2.4 && <2.5), parsec (>=2.1 && <2.2) [details]
License BSD-3-Clause
Copyright (c) 2010, Jan Rochel
Author Jan Rochel
Maintainer jan@rochel.info
Category Graphs, Application
Uploaded by JanRochel at 2010-09-22T16:28:58Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Executables lambdascope
Downloads 14217 total (49 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
All reported builds failed as of 2016-12-28 [all 6 reports]