enter search term and/or author name
The marriage of effects and monads
Philip Wadler, Peter Thiemann
Gifford and others proposed an effect typing discipline to delimit the scope of computational effects within a program, while Moggi and others proposed monads for much the same purpose. Here we marry effects to monads, uniting two...
Deciding the confluence of ordered term rewrite systems
Hubert Comon, Paliath Narendran, Robert Nieuwenhuis, Michael Rusinowitch
Resource-distribution via Boolean constraints
James Harland, David Pym
We consider the problem of searching for proofs in sequential presentations of logics with multiplicative (or intensional) connectives. Specifically, we start with the multiplicative fragment of linear logic and extend, on the one hand, to linear...
Fixed-parameter complexity of semantics for logic programs
Zbigniew Lonc, Miroslaw Truszczyński
A decision problem is called parameterized if its input is a pair of strings. One of these strings is referred to as a parameter. The following problem is an example of a parameterized decision problem with k serving as a...
A complete characterization of complete intersection-type preorders
M. Dezani-Ciancaglini, F. Honsell, F. Alessi
We characterize those type preorders which yield complete intersection-type assignment systems for λ-calculi, with respect to the three canonical set-theoretical semantics for intersection-types: the inference semantics, the...