Let R be a class of generators of node-labelled infinite trees, and L be a logical language for describing correctness properties of these trees. Given R R and L, we say that R ...
Christopher H. Broadbent, Arnaud Carayol, C.-H. Lu...
Abstract— This paper proposes a technique for creating a combinational logic network with an output that signals when all other outputs have stabilized. The method is based on du...
Jordi Cortadella, Alex Kondratyev, Luciano Lavagno...
We study games in which the choices available to players are not fixed, and may change during the course of play. Specifically, we consider a model in which players may switch st...
—This paper presents a study of possible extensions of Pathway Logic to represent and reason about semiquantitative and probabilistic aspects of biological processes. The underly...
We propose a method to extract purely functional contents from logical inductive types in the context of the Calculus of Inductive Constructions. This method is based on a mode con...