Results 11 to 20 of about 228,061 (236)
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 +5 more sources
Acyclic Solos and Differential Interaction Nets [PDF]
Logical Methods in Computer Science, 2010 We present a restriction of the solos calculus which is stable under reduction and expressive enough to contain an encoding of the pi-calculus. As a consequence, it is shown that equalizing names that are already equal is not required by the encoding of ...
Thomas Ehrhard, Olivier Laurent
doaj +4 more sources
Classical BI: Its Semantics and Proof Theory [PDF]
Logical Methods in Computer Science, 2010 We present Classical BI (CBI), a new addition to the family of bunched logics which originates in O'Hearn and Pym's logic of bunched implications BI.
James Brotherston, Cristiano Calcagno
doaj +7 more sources
Proof nets and the call-by-value lambda-calculus [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 This paper gives a detailed account of the relationship between (a variant of) the call-by-value lambda calculus and linear logic proof nets. The presentation is carefully tuned in order to realize a strong bisimulation between the two systems: every ...
Beniamino Accattoli
doaj +1 more source
Labelled Lambda-calculi with Explicit Copy and Erase [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We present two rewriting systems that define labelled explicit substitution lambda-calculi. Our work is motivated by the close correspondence between Levy's labelled lambda-calculus and paths in proof-nets, which played an important role in the ...
Maribel Fernández, Nikolaos Siafakas
doaj +1 more source
The Sequent Calculus Trainer with Automated Reasoning - Helping Students to Find Proofs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 The sequent calculus is a formalism for proving validity of statements formulated in First-Order Logic. It is routinely used in computer science modules on mathematical logic.
Arno Ehle +2 more
doaj +1 more source
EKSTRAKTO A tool to reconstruct Dedukti proofs from TSTP files (extended abstract) [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 Proof assistants often call automated theorem provers to prove subgoals. However, each prover has its own proof calculus and the proof traces that it produces often lack many details to build a complete proof.
Mohamed Yacine El Haddad +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
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
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