Sciweavers

4940 search results - page 398 / 988
» On the Complexity of Universal Programs
Sort
View
ICLP
1990
Springer
15 years 11 months ago
Extending Definite Clause Grammars with Scoping Constructs
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...
Remo Pareschi, Dale Miller
SIGMOD
1989
ACM
120views Database» more  SIGMOD 1989»
15 years 11 months ago
User Interfaces
Todays computer interfaces are one-size-fits-all. Users with little programming experience have very limited opportunities to customize an interface to their task and work habits...
L. Anderson
FATES
2006
Springer
15 years 10 months ago
Model-Based Testing of Thin-Client Web Applications
Abstract. More and more software systems use a browser as the universal graphical user interface. As a consequence these applications inherit browser navigation as part of their in...
Pieter W. M. Koopman, Rinus Plasmeijer, Peter Acht...
ICFP
2000
ACM
15 years 10 months ago
Fully reflexive intensional type analysis
Compilers for polymorphic languages can use runtime type inspection to support advanced implementation techniques such as tagless garbage collection, polymorphic marshalling, and ...
Valery Trifonov, Bratin Saha, Zhong Shao
IFIP
2000
Springer
15 years 10 months ago
Gender Differences in Vancouver Secondary Students
This paper presents results from a survey of Vancouver secondary school students on their interests and perceived abilities in a range of subjects, the factors they felt would inf...
Vania Chan, Katie Stafford, Maria M. Klawe, Grace ...