Sciweavers

3552 search results - page 9 / 711
» Proof theory in the abstract
Sort
View
TPHOL
2007
IEEE
15 years 8 months ago
Proof Pearl: De Bruijn Terms Really Do Work
Placing our result in a web of related mechanised results, we give a direct proof that the de Bruijn λ-calculus (`a la Huet, Nipkow and Shankar) is isomorphic to an α-quotiented ...
Michael Norrish, René Vestergaard
CSL
2010
Springer
15 years 2 months ago
Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
Damien Pous
CPP
2011
99views more  CPP 2011»
14 years 1 months ago
Proof-Carrying Code in a Session-Typed Process Calculus
Abstract. Dependent session types allow us to describe not only properties of the I/O behavior of processes but also of the exchanged data. In this paper we show how to exploit dep...
Frank Pfenning, Luís Caires, Bernardo Tonin...
114
Voted
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
16 years 2 months ago
Toward a general theory of quantum games
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
Gus Gutoski, John Watrous
140
Voted
AGP
2010
IEEE
15 years 7 months ago
Proof-Theoretic and Higher-Order Extensions of Logic Programming
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstr...
Alberto Momigliano, Mario Ornaghi