Mathematics never saw much of a reason to deal with something called nondeterminism. It
works with values, functions, sets, and relations. In computing science, however …

We propose an approach to declarative programming which integrates the functional and
relational paradigms by taking possibly non-deterministic lazy functions as the fundamental …

Neural networks are sensitive to hyper-parameter and architecture choices. Automated
Machine Learning (AutoML) is a promising paradigm for automating these choices. Current …

The term “referential transparency” is frequently used to indicate that a programming
language has certain useful substitution properties. We observe, however, that the formal …

Programs increasingly rely on randomization in applications such as cryptography and
machine learning. Analyzing randomized programs has been a fruitful research direction …

Apparently noncompositional phenomena in natural languages can be analyzed like
computational side effects in programming languages: anaphora can be analyzed like state …

Type-free lazy λ-calculus is enriched with angelic parallelism and demonic nondeterminism.
Call-by-name and call-by-value abstractions are considered and the operational semantics …

Inside many software languages lives an expression language that caters for the
computation of single values from single values. These languages' fixation on single …

In this paper we present a non-deterministic call-by-need (untyped) lambda calculus λ nd
with a constant choice and a let-syntax that models sharing. Our main result is that λ nd has …

Non-confluent and non-terminating rewrite systems are interesting from the point of view of
programming. In particular, existing functional logic languages use such kind of rewrite …