graph-rewriting-lambdascope: Lambdascope, an optimal evaluator of the lambda calculus, as an interactive graph-rewriting system

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

Lambdascope is an optimal evaluator 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. Call "lambdascope" with one of the files from the "examples" directory as an argument. For usage of the GUI see GraphRewriting.GL.UI. Use the "--lmo" flag for leftmost outermost evalution and "--bench" for non-graphical evaluation to weak head normal form.

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.8 && <4.10), base-unicode-symbols (>=0.2 && <0.3), GLUT (>=2.2 && <2.8), graph-rewriting (>=0.7.8), graph-rewriting-gl (>=0.7.6), graph-rewriting-layout (>=0.5.4), graph-rewriting-strategies (>=0.2.4), IndentParser (>=0.2 && <0.3), OpenGL (>=3.0 && <3.1), parsec (>=3.1 && <3.2) [details]
License BSD-3-Clause
Copyright (c) 2010, Jan Rochel
Author Jan Rochel
Maintainer jan@rochel.info
Category Compilers/Interpreters, Application
Home page http://rochel.info/#graph-rewriting
Uploaded by JanRochel at 2017-05-23T14:51:18Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Executables lambdascope
Downloads 14236 total (46 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
Last success reported on 2017-05-23 [all 3 reports]