1912 search results - page 150 / 383 » On the evaluation of argumentation formalisms |
172
click to vote
ESCIENCE
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper we present a general domain for the analysis of workflows and workflow components based on the notion of a collection of Turing machines sharing a set of tapes. We s...
165
click to vote
ENTCS
2006
15 years 6 months ago
2006
We formalize two proofs of weak head normalization for the simply typed lambdacalculus in first-order minimal logic: one for normal-order reduction, and one for applicative-order ...
193
click to vote
TLDI
2010
ACM
16 years 3 months ago
2010
ACM
We present the design of a formal low-level multi-threaded language with advanced region-based memory management and synchronization primitives, where well-typed programs are memo...
214
click to vote
CEFP
2007
Springer
16 years 20 days ago
2007
Springer
This tutorial paper aims to provide the necessary expertise for working with the proof assistant Sparkle, which is dedicated to the lazy functional programming language Clean. The ...
170
click to vote
IFM
1999
Springer
15 years 10 months ago
1999
Springer
The feature interaction problem is prominent in telephone service development. Through a number of case studies, we have discovered that no single semantic framework is suitable f...