1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.PL2020★ 1 cited
Check Your (Students') Proofs-With Holes
Dennis Renz, Sibylle Schwarz, Johannes Waldmann
Cyp (Check Your Proofs) (Durner and Noschinski 2013; Traytel 2019) verifies proofs about Haskell-like programs. We extended Cyp with a pattern matcher for programs and proof terms,…
cs.LO2020
Sparse Tiling through Overlap Closures for Termination of String Rewriting
Alfons Geser, Dieter Hofbauer, Johannes Waldmann
We over-approximate reachability sets in string rewriting by languages defined by admissible factors, called tiles. A sparse set of tiles contains only those that are reachable in…
cs.PL2018
When You Should Use Lists in Haskell (Mostly, You Should Not)
Johannes Waldmann
We comment on the over-use of lists in functional programming. With this respect, we review history of Haskell and some of its libraries, and hint at current developments.