Results 21 to 30 of about 9,301 (306)
Qutrit Dichromatic Calculus and Its Universality [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We introduce a dichromatic calculus (RG) for qutrit systems. We show that the decomposition of the qutrit Hadamard gate is non-unique and not derivable from the dichromatic calculus.
Quanlong Wang, Xiaoning Bian
doaj +1 more source
The Consistency and Complexity of Multiplicative Additive System Virtual [PDF]
Scientific Annals of Computer Science, 2015 This paper investigates the proof theory of multiplicative additive system virtual (MAV). MAV combines two established proof calculi: multiplicative additive linear logic (MALL) and basic system virtual (BV).
R. Horne
doaj +1 more source
A new coinductive confluence proof for infinitary lambda calculus [PDF]
Logical Methods in Computer Science, 2020 We present a new and formal coinductive proof of confluence and normalisation of B\"ohm reduction in infinitary lambda calculus. The proof is simpler than previous proofs of this result.
Łukasz Czajka
doaj +1 more source
Contextual equivalence for higher-order pi-calculus revisited [PDF]
Logical Methods in Computer Science, 2005 The higher-order pi-calculus is an extension of the pi-calculus to allow communication of abstractions of processes rather than names alone. It has been studied intensively by Sangiorgi in his thesis where a characterisation of a contextual equivalence ...
Alan Jeffrey, Julian Rathke
doaj +1 more source
Fast Cut-Elimination using Proof Terms: An Empirical Study [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 Urban and Bierman introduced a calculus of proof terms for the sequent calculus LK with a strongly normalizing reduction relation. We extend this calculus to simply-typed higher-order logic with inferences for induction and equality, albeit without ...
Gabriel Ebner
doaj +1 more source
Strong normalization of lambda-Sym-Prop- and lambda-bar-mu-mu-tilde-star- calculi [PDF]
Logical Methods in Computer Science, 2017 In this paper we give an arithmetical proof of the strong normalization of lambda-Sym-Prop of Berardi and Barbanera [1], which can be considered as a formulae-as-types translation of classical propositional logic in natural deduction style.
Peter Battyanyi, Karim Nour
doaj +1 more source
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