Sciweavers

1581 search results - page 49 / 317
» Domain semantics of possibility computations
Sort
View
VL
2003
IEEE
102views Visual Languages» more  VL 2003»
15 years 10 months ago
Programming for communication: overcoming motivational barriers to computation for all
Computer science as a discipline is failing to reach a diverse audience. As a result, computational illiteracy threatens many groups of underserved students—women, minorities an...
Andrea Forte
ERSA
2007
88views Hardware» more  ERSA 2007»
15 years 6 months ago
Autonomous Computing Systems: A Proposed Roadmap
An autonomous computing system is a system that functions with a large degree of independence, and assumes a large amount of responsibility for its own resources and operation. As...
Neil Steiner, Peter Athanas
TLCA
2007
Springer
15 years 11 months ago
Weakly Distributive Domains
In our previous work [17] we have shown that for any ω-algebraic meet-cpo D, if all higher-order stable function spaces built from D are ω-algebraic, then D is finitary. This ac...
Ying Jiang, Guo-Qiang Zhang
ECBS
1999
IEEE
112views Hardware» more  ECBS 1999»
15 years 9 months ago
Metaprogrammable Toolkit for Model-Integrated Computing
Model-Integrated Computing, specifically Model-Integrated Program Synthesis (MIPS) environments that include visual model building, constraint management, and automatic program sy...
Ákos Lédeczi, Miklos Maroti, Gabor K...
158
Voted
LICS
2002
IEEE
15 years 10 months ago
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
Alex K. Simpson