The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) implemented in the interactive theorem prover Matita. The refinement algorithm ...
Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdot...
In this paper we present a game semantics for a quantum programming language based on a new definition of quantum strategies. The language studied is MCdata, a typed version of th...
We use the ρ-calculus as an intermediate language to compile functional languages with pattern-matching features, and give an interaction net encoding of the ρ-terms arising fro...
The theory of chi processes with the mismatch operator is studied. Two open congruence relations are investigated. These are weak early open congruence and weak late open congruenc...
The DPLL procedure is the basis of some of the most successful propositional satisfiability solvers to date. Although originally devised as a proofprocedure for first-order logic, ...