The mismatch between the operational semantics of the lambda calculus and the actual behavior of implementations is a major obstacle for compiler writers. They cannot explain the behavior of their evaluator in terms of source level syntax, and they cannot easily compare distinct implementations of diierent lazy strategies. In this paper we derive an equational characterization of call-by-need a...

We shall consider generated pseudo-operations of the following form: x⊕ y = g(−1) (g(x) + g(y)) , x ̄ y = g(−1) (g(x)g(y)) , where g is a positive strictly monotone generating function and g(−1) is its pseudo-inverse. Using this type of pseudo-operations, the Riemann-Stieltjes type integral will be introduced and investigated.

We investigate the complexity of enumerating pseudo-intents in the lectic order. We look at the following decision problem: Given a formal context and a set of n pseudo-intents determine whether they are the lectically first n pseudo-intents. We show that this problem is coNPhard. We thereby show that there cannot be an algorithm with a good theoretical complexity for enumerating pseudo-intents...

Let F $F$ be a totally real field and n ⩽ 4 $n\leqslant 4$ natural number. We study the monodromy groups of any $n$ -dimensional strictly compatible system { ρ λ } $\lbrace \rho _\lambda \rbrace _\lambda$ $\lambda$ -adic representations with distinct Hodge–Tate numbers such that 0 $\rho _{\lambda _0}$ is irreducible for some $\lambda _0$ . When = Q $F=\mathbb {Q}$ , $n=4$ fully symplectic, foll...