Sciweavers

3552 search results - page 170 / 711
» Proof theory in the abstract
Sort
View
LICS
1994
IEEE
15 years 10 months ago
Subtyping and Parametricity
In this paper we study the interaction of subtyping and parametricity. We describe a logic for a programming language with parametric polymorphism and subtyping. The logic support...
Gordon D. Plotkin, Martín Abadi, Luca Carde...
GD
2004
Springer
15 years 12 months ago
Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth
Abstract. This paper surveys the theory of bidimensional graph problems. We summarize the known combinatorial and algorithmic results of this theory, the foundational Graph Minor r...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
REPLICATION
2010
15 years 4 months ago
Stumbling over Consensus Research: Misunderstandings and Issues
Abstract The consensus problem has recently emerged as a major interest in systems conferences, yet the systems community tends to ignore most of the large body of theory on this s...
Marcos Kawazoe Aguilera
FROCOS
2007
Springer
16 years 18 days ago
Combining Algorithms for Deciding Knowledge in Security Protocols
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
Mathilde Arnaud, Véronique Cortier, St&eacu...
CIE
2007
Springer
16 years 19 days ago
A Useful Undecidable Theory
Abstract. We show that many so called discrete weak semilattices considered earlier in a series of author’s publications have hereditary undecidable first-order theories. Since ...
Victor L. Selivanov