341 search results - page 38 / 69 » Use concurrent programming models to motivate teaching of pr... |
114
click to vote
OOPSLA
2009
Springer
15 years 7 months ago
2009
Springer
Software has spent the bounty of Moore’s law by solving harder problems and exploiting abstractions, such as highlevel languages, virtual machine technology, binary rewritdynami...
118
click to vote
FOSSACS
2008
Springer
15 years 2 months ago
2008
Springer
We introduce Erasure Pure Type Systems, an extension to Pure Type Systems with an erasure semantics centered around a type constructor indicating parametric polymorphism. The eras...
102
Voted
POPL
2010
ACM
15 years 10 months ago
2010
ACM
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
101
click to vote
PPSN
1994
Springer
15 years 4 months ago
1994
Springer
The Reproductive Plan Language 2 (RPL2) is an extensible interpreted language for writing and using evolutionary computing programs. It supports arbitrary genetic representations,...
ATAL
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. This paper presents an implementation of (a simplified version of) the cognitive agent programming language 3APL in the Maude term rewriting language. Maude is based on t...