1675 search results - page 136 / 335 » Some thoughts on teaching programming and programming langua... |
117
click to vote
ICFP
2010
ACM
15 years 5 months ago
2010
ACM
We present a closed dependent type theory whose inductive types are given not by a scheme for generative declarations, but by encoding in a universe. Each inductive datatype arise...
132
click to vote
PPL
2008
15 years 4 months ago
2008
A functional data-parallel language called BSML has been designed for programming Bulk-Synchronous Parallel algorithms. Many sequential algorithms do not have parallel counterpart...
133
click to vote
CP
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...
208
click to vote
BANFF
1995
15 years 8 months ago
1995
The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying paradigm for program specification, verification, and synthesis. Both programs ...
164
click to vote
ICFP
2005
ACM
16 years 4 months ago
2005
ACM
Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly l...