Linear Structures for Concurrency in Probabilistic Programming Languages
نویسندگان
چکیده
منابع مشابه
Concurrency in Modern Programming Languages
I n the last 10 years, CPU clock speeds haven’t increased significantly, but the computing power of CPUs has continued to grow according to Moore’s law. Researchers achieved this by increasing the number of computing cores per chip. This process has made parallel computing relevant to a much broader community. Writing computer programs that take advantage of multicores is a challenge because of...
متن کاملConcurrency in Object-Oriented Programming Languages
An essential motivation behind concurrent object-oriented programming is to exploit the software reuse potential of object-oriented features in the development of concurrent systems. Early attempts to introduce concurrency to object-oriented languages uncovered interferences between object-oriented and concurrency features that limited the extent to which the benefits of object-oriented program...
متن کاملEfficient Probabilistic Programming Languages
In recent years, declarative programming languages specialized for probabilistic modeling has emerged as distinct class of languages. These languages are predominantly written by researchers in the machine learning field and concentrate on generalized MCMC inference algorithm. Unfortunately, all these languages are too slow for practical adoption. In my talk, I will outline several places where...
متن کاملControl Structures for Programming Languages
. The research reported here is the result of an investigation of several aspects of the control structure of programming languages. By control structures we mean _ • programming environments or operations which specify the sequencing and interpretation rules for programs or parts of programs. This dissertation attempts to demonstrate the thesis: complexity diminishes and clarity increases to a...
متن کاملEecient Support for Multiple Concurrency Paradigms in Modern Programming Languages
We describe an approach to implementing a wide-range of concurrency paradigms in modern programming languages. The focus of our discussion is sting, a dialect of Scheme, that supports lightweight threads of control and virtual processors as rst-class objects. Given the signiicant degree to which the behavior of these objects may be customized, we can easily express a variety of concurrency para...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2001
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80039-8