12 citations · 26 across the 7 of their papers we have counts for
8 papers
Diverse Representation via Computational Participatory Elections -- Lessons from a Case Study
Florian Evéquoz, Johan Rochel, Vijay Keswani +1
Elections are the central institution of democratic processes, and often the elected body -- in either public or private governance -- is a committee of individuals. To ensure the…
Unfolding Semantics of the Untyped λ-Calculus with letrec
Jan Rochel
We investigate the relationship between finite terms in λ-letrec, the λ-calculus with letrec, and the infinite λ-terms they express. We say that a lambda-letrec term expresses a la…
Maximal Sharing in the Lambda Calculus with letrec
Clemens Grabmayer, Jan Rochel
Increasing sharing in programs is desirable to compactify the code, and to avoid duplication of reduction work at run-time, thereby speeding up execution. We show how a maximal deg…
Term Graph Representations for Cyclic Lambda-Terms
Clemens Grabmayer, Jan Rochel
We study various representations for cyclic lambda-terms as higher-order or as first-order term graphs. We focus on the relation between `lambda-higher-order term graphs' (lambda-h…
Expressibility in the Lambda Calculus with mu
Clemens Grabmayer, Jan Rochel
We address a problem connected to the unfolding semantics of functional programming languages: give a useful characterization of those infinite lambda-terms that are lambda_{letrec…
Term Graph Representations for Cyclic Lambda-Terms
Clemens Grabmayer, Jan Rochel
We study various representations for cyclic lambda-terms as higher-order or as first-order term graphs. We focus on the relation between 'lambda-higher-order term graphs' (lambda-h…
Expressibility in the Lambda Calculus with Letrec
Clemens Grabmayer, Jan Rochel
We investigate the relationship between finite terms in lambda-letrec, the lambda calculus with letrec, and the infinite lambda terms they express. As there are easy examples of la…
Repetitive Reduction Patterns in Lambda Calculus with letrec (Work in Progress)
Jan Rochel, Clemens Grabmayer
For the lambda-calculus with letrec we develop an optimisation, which is based on the contraction of a certain class of 'future' (also: virtual) redexes. In the implementation of f…