David Sabel


Computer Scientist


Home Research Publications Talks Teaching Software
The LRSX Tool
The LRSX Tool implements a procedure to automatically prove correctness of program transformations for higher-order program calculi with recursive and shared bindings (i.e. so-called letrec-expressions). The tool (and further information) can be found on this webpage
The LRSX Unification Tool
The LRSX Unification Tool implements a new algorithm for unification of meta-expressions in lambda calculi with recursive and shared bindings (i.e. so-called letrec-expressions). The tool (and further information) can be found on this webpage.
cycsrs - Proving Termination of Cycle Rewriting
The tool cycsrs combines several techniques and tools to prove termination of cycle rewriting. It participated in the Termination Competition 2015 and in the Termination and Complexity Competition 2016. The tool and a web-interface can be found on this webpage.
SHFSTM - Software Transactional Memory
An alternative implementation of Software Transactional Memory in Haskell can be found on this webpage.
GBC - Grammar-Based Compression
Several algorithms on grammar-compressed matrices, grammar-compressed strings and grammar-compressed terms can be found here.
Allen's Interval Logic
Allen's interval logic is a calculus for temporal logic. A web-interface can be found here. A Haskell implementation as a Cabal-package is allen-0.1.0.0.tar.gz.
HasFuse
The (somewhat outdated) webpage of HasFuse (Haskell with FUNDIO-based side-effects) can be found here.
(c) 2018 PD Dr. David Sabel, Imprint, Privacy Policy Last modified: $Author: sabel $, $Date: 2018/04/10 13:02:19 $