Zobrazeno 1 - 10
of 112
pro vyhledávání: '"Ponse, Alban"'
Autor:
Ponse, Alban, Staudt, Daan J. C.
We consider a family of two-valued "fully evaluated left-sequential logics" (FELs), of which Free FEL (defined by Staudt in 2012) is most distinguishing (weakest) and immune to atomic side effects. Next is Memorising FEL, in which evaluations of sube
Externí odkaz:
http://arxiv.org/abs/2403.14576
Autor:
Bergstra, Jan A., Ponse, Alban
Both two-valued and three-valued conditional logic (CL), defined by Guzm\'an and Squier (1990) and based on McCarthy's non-commutative connectives, axiomatise a short-circuit logic (SCL) that defines more identities than MSCL (Memorising SCL), which
Externí odkaz:
http://arxiv.org/abs/2304.14821
Autor:
Papuc, Dalia, Ponse, Alban
Short-circuit evaluation denotes the semantics of propositional connectives in which the second argument is evaluated only if the first argument does not suffice to determine the value of the expression. In programming, short-circuit evaluation is wi
Externí odkaz:
http://arxiv.org/abs/2203.09321
Short-circuit evaluation denotes the semantics of propositional connectives in which the second argument is evaluated only if the first argument does not suffice to determine the value of the expression. Short-circuit evaluation is widely used in pro
Externí odkaz:
http://arxiv.org/abs/1810.02142
Autor:
Ponse, Alban, Staudt, Daan J. C.
Publikováno v:
Journal of Applied Non-Classical Logics, 28(1):35-71, 2018
Short-circuit evaluation denotes the semantics of propositional connectives in which the second argument is evaluated only if the first argument does not suffice to determine the value of the expression. Free short-circuit logic is the equational log
Externí odkaz:
http://arxiv.org/abs/1707.05718
Autor:
Bergstra, Jan A., Ponse, Alban
Publikováno v:
Logical Methods in Computer Science, Volume 17, Issue 1 (February 18, 2021) lmcs:6031
A datatype defining rewrite system (DDRS) is an algebraic (equational) specification intended to specify a datatype. When interpreting the equations from left-to-right, a DDRS defines a term rewriting system that must be ground-complete. First we def
Externí odkaz:
http://arxiv.org/abs/1608.06212
Autor:
Bergstra, Jan A., Ponse, Alban
Poly-infix operators and operator families are introduced as an alternative for working modulo associativity and the corresponding bracket deletion convention. Poly-infix operators represent the basic intuition of repetitively connecting an ordered s
Externí odkaz:
http://arxiv.org/abs/1505.01087
Autor:
Bergstra, Jan A., Ponse, Alban
Proposition algebra is based on Hoare's conditional connective, which is a ternary connective comparable to if-then-else and used in the setting of propositional logic. Conditional statements are provided with a simple semantics that is based on eval
Externí odkaz:
http://arxiv.org/abs/1504.08321
Autor:
Bergstra, Jan A., Ponse, Alban
Publikováno v:
Indagationes Mathematicae, 27(3):727-748, 2016
In the well-known construction of the field of fractions of an integral domain, division by zero is excluded. We introduce "fracpairs" as pairs subject to laws consistent with the use of the pair as a fraction, but do not exclude denominators to be z
Externí odkaz:
http://arxiv.org/abs/1411.4410
Autor:
Bergstra, Jan A., Ponse, Alban
Common meadows are fields expanded with a total inverse function. Division by zero produces an additional value denoted with "a" that propagates through all operations of the meadow signature (this additional value can be interpreted as an error elem
Externí odkaz:
http://arxiv.org/abs/1406.6878