Results 1 to 10 of about 9,301 (306)
Proving Soundness of Extensional Normal-Form Bisimilarities [PDF]
Logical Methods in Computer Science, 2019 Normal-form bisimilarity is a simple, easy-to-use behavioral equivalence that relates terms in $\lambda$-calculi by decomposing their normal forms into bisimilar subterms.
Dariusz Biernacki +2 more
doaj +1 more source
Strongly-Normalizing Higher-Order Relational Queries [PDF]
Logical Methods in Computer Science, 2022 Language-integrated query is a powerful programming construct allowing database queries and ordinary program code to interoperate seamlessly and safely.
Wilmer Ricciotti, James Cheney
doaj +1 more source
Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic [PDF]
Logical Methods in Computer Science, 2023 This paper introduces the exponential substitution calculus (ESC), a new presentation of cut elimination for IMELL, based on proof terms and building on the idea that exponentials can be seen as explicit substitutions.
Beniamino Accattoli
doaj +1 more source
Modelling MAC-Layer Communications in Wireless Systems [PDF]
Logical Methods in Computer Science, 2015 We present a timed process calculus for modelling wireless networks in which individual stations broadcast and receive messages; moreover the broadcasts are subject to collisions.
Andrea Cerone +2 more
doaj +1 more source
Interaction and Depth against Nondeterminism in Proof Search [PDF]
Logical Methods in Computer Science, 2014 Deep inference is a proof theoretic methodology that generalizes the standard notion of inference of the sequent calculus, whereby inference rules become applicable at any depth inside logical expressions.
Ozan Kahramanogullari
doaj +1 more source
PROOF-THEORETIC ANALYSIS OF THE QUANTIFIED ARGUMENT CALCULUS [PDF]
The Review of Symbolic Logic, 2019 AbstractThis article investigates the proof theory of the Quantified Argument Calculus (Quarc) as developed and systematically studied by Hanoch Ben-Yami [3, 4]. Ben-Yami makes use of natural deduction (Suppes-Lemmon style), we, however, have chosen a sequent calculus presentation, which allows for the proofs of a multitude of significant meta ...
Pavlović , Edi, Norbert Gratzl
openaire +3 more sources
Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-calculus [PDF]
Logical Methods in Computer Science, 2008 Tse and Zdancewic have formalized the notion of noninterference for Abadi et al.'s DCC in terms of logical relations and given a proof of noninterference by reduction to parametricity of System F. Unfortunately, their proof contains errors in a key lemma
Naokata Shikuma, Atsushi Igarashi
doaj +1 more source
Extending the Extensional Lambda Calculus with Surjective Pairing is Conservative [PDF]
Logical Methods in Computer Science, 2006 We answer Klop and de Vrijer's question whether adding surjective-pairing axioms to the extensional lambda calculus yields a conservative extension. The answer is positive. As a byproduct we obtain a "syntactic" proof that the extensional lambda calculus
Kristian Stoevring
doaj +1 more source
A calculus proof of the Cramér–Wold theorem [PDF]
Proceedings of the American Mathematical Society, 2017 We present a short, elementary proof not involving Fourier transforms of the theorem of Cramér and Wold that a Borel probability measure is determined by its values on half-spaces.
Lyons, Russell, Zumbrun, Kevin
openaire +2 more sources
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems [PDF]
Logical Methods in Computer Science, 2011 Basic proof-search tactics in logic and type theory can be seen as the root-first applications of rules in an appropriate sequent calculus, preferably without the redundancies generated by permutation of rules. This paper addresses the issues of defining
Stéphane Jean Eric Lengrand +2 more
doaj +1 more source