Results 1  10
of
2,169
The Warshall Algorithm and Dickson’s Lemma: Two Examples of Realistic Program Extraction
, 2006
"... By means of two wellknown examples it is demonstrated that the method of extracting programs from proofs is manageable in practice and may yield efficient programs. The Warshall algorithm computing the transitive closure of a relation is extracted from a constructive proof that repetitions in a pa ..."
Abstract

Cited by 27 (8 self)
 Add to MetaCart
By means of two wellknown examples it is demonstrated that the method of extracting programs from proofs is manageable in practice and may yield efficient programs. The Warshall algorithm computing the transitive closure of a relation is extracted from a constructive proof that repetitions in a
The Warshall Algorithm and Dickson's Lemma: Two Examples of realistic program extraction
 Journal of Automated Reasoning
, 1999
"... . By means of two wellknown examples it is demonstrated that the method of extracting programs from proofs is manageable in practise and may yield efficient and sometimes unexpected programs. The Warshall algorithm computing the transitive closure of a relation is extracted from a constructive proo ..."
Abstract
 Add to MetaCart
. By means of two wellknown examples it is demonstrated that the method of extracting programs from proofs is manageable in practise and may yield efficient and sometimes unexpected programs. The Warshall algorithm computing the transitive closure of a relation is extracted from a constructive
Field Experiments
 Journal of Economic Literature Vol XLII
, 2004
"... Experimental economists are leaving the reservation. They are recruiting subjects in the field rather than in the classroom, using field goods rather than induced valuations, and using field context rather than abstract terminology in instructions. We argue that there is something methodologically f ..."
Abstract

Cited by 398 (70 self)
 Add to MetaCart
Experimental economists are leaving the reservation. They are recruiting subjects in the field rather than in the classroom, using field goods rather than induced valuations, and using field context rather than abstract terminology in instructions. We argue that there is something methodologically fundamental behind this trend. Field experiments differ from laboratory experiments in many ways. Although it is tempting to view field experiments as simply less controlled variants of laboratory experiments, we argue that to do so would be to seriously mischaracterize them. What passes for “control ” in laboratory experiments might in fact be precisely the opposite if it is artificial to the subject or context of the task. We propose six factors that can be used to determine the field context of an experiment: the nature of the subject pool, the nature of the information that the subjects bring to the task, the nature of the commodity, the nature of the task or trading rules applied, the nature
Ackermannian and PrimitiveRecursive Bounds with Dickson’s Lemma
"... Abstract—Dickson’s Lemma is a simple yet powerful tool widely used in decidability proofs, especially when dealing with counters or related data structures in algorithmics, verification and modelchecking, constraint solving, logic, etc. While Dickson’s Lemma is wellknown, most computer scientists ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Abstract—Dickson’s Lemma is a simple yet powerful tool widely used in decidability proofs, especially when dealing with counters or related data structures in algorithmics, verification and modelchecking, constraint solving, logic, etc. While Dickson’s Lemma is wellknown, most computer scientists
Ackermannian and PrimitiveRecursive Bounds with Dickson’s Lemma ∗
, 2011
"... Dickson’s Lemma is a simple yet powerful tool widely used in decidability proofs, especially when dealing with counters or related data structures in algorithmics, verification and modelchecking, constraint solving, logic, etc. While Dickson’s Lemma is wellknown, most computer scientists are not a ..."
Abstract
 Add to MetaCart
Dickson’s Lemma is a simple yet powerful tool widely used in decidability proofs, especially when dealing with counters or related data structures in algorithmics, verification and modelchecking, constraint solving, logic, etc. While Dickson’s Lemma is wellknown, most computer scientists
WellStructured Transition Systems Everywhere!
 THEORETICAL COMPUTER SCIENCE
, 1998
"... Wellstructured transition systems (WSTS's) are a general class of infinite state systems for which decidability results rely on the existence of a wellquasiordering between states that is compatible with the transitions. In this article, we provide an extensive treatment of the WSTS idea and ..."
Abstract

Cited by 258 (9 self)
 Add to MetaCart
and show several new results. Our improved definitions allow many examples of classical systems to be seen as instances of WSTS's.
An introduction to substructural logics
, 2000
"... Abstract: This is a history of relevant and substructural logics, written for the Handbook of the History and Philosophy of Logic, edited by Dov Gabbay and John Woods. 1 1 ..."
Abstract

Cited by 182 (17 self)
 Add to MetaCart
Abstract: This is a history of relevant and substructural logics, written for the Handbook of the History and Philosophy of Logic, edited by Dov Gabbay and John Woods. 1 1
Results 1  10
of
2,169