163 search results - page 22 / 33 » What is an Argument |
FMSD
1998
13 years 7 months ago
1998
The bitstate hashing, or supertrace, technique was introduced in 1987 as a method to increase the quality of verification by reachability analyses for applications that defeat anal...
EJIS
2011
13 years 3 months ago
2011
In response to O¨ sterle et al.’s ‘Memorandum on Design Oriented Information Systems Research’, this commentary disputes, and expands the context of, several premises used ...
JSYML
1998
13 years 7 months ago
1998
Abstract. After small forcing, any <κ-closed forcing will destroy the supercompactness and even the strong compactness of κ. In a delightful argument, Laver [L78] proved that ...
NDJFL
2010
13 years 2 months ago
2010
The question of the origin of polyadic expressivity is explored and the results are brought to bear on Bertrand Russell's 1903 theory of denoting concepts, which is the main o...
JFP
2007
13 years 7 months ago
2007
Haskell’s popularity has driven the need for ever more expressive type system features, most of which threaten the decidability and practicality of Damas-Milner type inference. ...