Results 31 to 40 of about 9,301 (306)
Divergence and unique solution of equations [PDF]
Logical Methods in Computer Science, 2019 We study proof techniques for bisimilarity based on unique solution of equations. We draw inspiration from a result by Roscoe in the denotational setting of CSP and for failure semantics, essentially stating that an equation (or a system of equations ...
Adrien Durier +2 more
doaj +1 more source
A Complete Axiomatisation for Quantifier-Free Separation Logic [PDF]
Logical Methods in Computer Science, 2021 We present the first complete axiomatisation for quantifier-free separation logic. The logic is equipped with the standard concrete heaplet semantics and the proof system has no external feature such as nominals/labels.
Stéphane Demri +2 more
doaj +1 more source
Proof Nets for the Multimodal Lambek Calculus
Studia Logica, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Puite, Q., Moot, R.C.A.
openaire +3 more sources
Proof Nets for the Lambek–Grishin Calculus [PDF]
, 2013 Revised version to appear as a chapter in E. Grefenstette, C. Heunen, and M.
Moortgat, M.J., Moot, R.C.A.
openaire +4 more sources
Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus [PDF]
Logical Methods in Computer Science, 2017 We study an extension of Plotkin's call-by-value lambda-calculus via two commutation rules (sigma-reductions). These commutation rules are sufficient to remove harmful call-by-value normal forms from the calculus, so that it enjoys elegant ...
Giulio Guerrieri +2 more
doaj +1 more source
Lietuvos Matematikos Rinkinys, 2013 We consider three sequent calculi for propositional linear temporal logic (PLTL) which allow us to formalize the properties of operator “always”. The main new results presented in the paper are: (1) introduction of the calculus with looping axioms; (2 ...
Romas Alonderis +1 more
doaj +1 more source
A strong call-by-need calculus [PDF]
Logical Methods in Computer Science, 2023 We present a call-by-need $\lambda$-calculus that enables strong reduction (that is, reduction inside the body of abstractions) and guarantees that arguments are only evaluated if needed and at most once.
Thibaut Balabonski +2 more
doaj +1 more source
Categorical proof theory of classical propositional calculus
Theoretical Computer Science, 2006 ``The questions \textit{`What is a proof?'} and \textit{`When are two proofs the same?'} are fundamental for proof theory. But for the most prominent logic, Boolean (or classical) propositional logic, we still have no satisfactory answers.'' [\textit{L. Strassburger}, Theory Appl. Categ.
BELLIN, Gianluigi +3 more
openaire +3 more sources
Calculus proofs of some combinatorial inequalities [PDF]
Mathematical Inequalities & Applications, 2003 Using calculus we show how to prove some combinatorial inequalities of the type log-concavity or log-convexity. It is shown by this method that binomial coefficients and Stirling numbers of the first and second kinds are log-concave, and that Motzkin numbers and secondary structure numbers of rank 1 are log-convex. In fact, we prove via calculus a much
Došlić, Tomislav, Veljan, Darko
openaire +4 more sources
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