Results 11 to 20 of about 2,593,900 (78)
Classical Combinatory Logic [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Combinatory logic shows that bound variables can be eliminated without loss of expressiveness. It has applications both in the foundations of mathematics and in the implementation of functional programming languages.
Karim Nour
doaj +1 more source
A Type System Describing Unboundedness [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We consider nondeterministic higher-order recursion schemes as recognizers of languages of finite words or finite trees. We propose a type system that allows to solve the simultaneous-unboundedness problem (SUP) for schemes, which asks, given a set of ...
Paweł Parys
doaj +1 more source
IMP with exceptions over decorated logic [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 In this paper, we facilitate the reasoning about impure programming languages, by annotating terms with “decorations”that describe what computational (side) effect evaluation of a term may involve.
Burak Ekici
doaj +1 more source
The First-Order Theory of Ordering Constraints over Feature Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 The system FT< of ordering constraints over feature trees has been introduced as an extension of the system FT of equality constraints over feature trees.
Martin Müller +2 more
doaj +1 more source
Solving equations over small unary algebras [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We consider the problem of solving a system of polynomial equations over fixed algebra $A$ which we call MPolSat($A$). We restrict ourselves to unary algebras and give a partial characterization of complexity of MPolSat($A$). We isolate a preorder $P(A)$
Przemyslaw Broniek
doaj +1 more source
Undecidable problems concerning densities of languages [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 In this paper we prove that the question whether a language presented by a context free grammar has density, is undecidable. Moreover we show that there is no algorithm which, given two unambiguous context free grammars on input, decides whether the ...
Jakub Kozik
doaj +1 more source
The call-by-value λµ∧∨-calculus [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 In this paper, we introduce the $λ μ ^{∧∨}$ - call-by-value calculus and we give a proof of the Church-Rosser property of this system. This proof is an adaptation of that of Andou (2003) which uses an extended parallel reduction method and complete ...
Karim Nour, Khelifa Saber
doaj +1 more source
Non-Determinism and Nash Equilibria for Sequential Game over Partial Order [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 In sequential games of traditional game theory, backward induction guarantees existence of Nash equilibrium by yielding a sub-game perfect equilibrium.
Stéphane Le Roux
doaj +1 more source
On-line coloring of $I_s$-free graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 An on-line vertex coloring algorithm receives vertices of a graph in some externally determined order. Each new vertex is presented together with a set of the edges connecting it to the previously presented vertices.
Iwona Cieslik, Marcin Kozik, Piotr Micek
doaj +1 more source
Note on paraconsistency and reasoning about fractions [PDF]
, 2014 We apply a paraconsistent logic to reason about fractions.Comment: 6 ...
Bergstra, Jan A., Bethke, Inge
core +2 more sources