|
|
|
|
|
|
Date Reviewed |
|
|
1 - 10 of 59
reviews
|
|
|
|
|
|
|
|
Testing and tuning market trading systems: algorithms in C++ Masters T., Apress, New York, NY, 2018. 332 pp. Type: Book (978-1-484241-72-1)
Financial markets have become increasingly dominated by automated systems. A computer program can be used to decide when to buy and sell things such as shares or currencies, with the aim of making a profit. The automated use of this me...
|
Sep 5 2019 |
|
|
|
|
|
|
A progression semantics for first-order logic programs Zhou Y., Zhang Y. Artificial Intelligence 250 58-79, 2017. Type: Article
This paper looks at the relationship between classical logic and practical systems, which employ logic-based techniques to process data. The emphasis is on answer set programming (ASP) and Datalog rather than Prolog. While Prolog can b...
|
Mar 9 2018 |
|
|
|
|
|
|
Transforming Boolean equalities into constraints Antoy S., Hanus M. Formal Aspects of Computing 29(3): 475-494, 2017. Type: Article
In declarative programming languages, a variable is a symbol representing a value determined by computational rules rather than a space in memory. The two main forms of declarative languages are functional and logic. In functional lang...
|
Sep 13 2017 |
|
|
|
|
|
|
Reasoning in non-probabilistic uncertainty: logic programming and neural-symbolic computing as examples Besold T., Garcez A., Stenning K., van der Torre L., van Lambalgen M. Minds and Machines 27(1): 37-77, 2017. Type: Article
Modeling human reasoning means dealing with uncertainty. The approach of conventional logic in which rules are absolute cannot be applied. Instead there is uncertainty: we need to use rules but accept that there may be cases where ther...
|
Jun 28 2017 |
|
|
|
|
|
|
Reactive messaging patterns with the actor model: applications and integration in Scala and Akka Vernon V., Addison-Wesley Professional, New York, NY, 2015. 480 pp. Type: Book (978-0-133846-83-6)
In the 1980s, when my academic career started as a researcher into functional and actor programming languages, we were confident that by the turn of the millennium these would be the languages in standard use in industry. It was disapp...
|
Nov 21 2016 |
|
|
|
|
|
|
Foundations of session types and behavioural contracts Hüttel H., Lanese I., Vasconcelos V., Caires L., Carbone M., Deniélou P., Mostrous D., Padovani L., Ravara A., Tuosto E., Vieira H., Zavattaro G. ACM Computing Surveys 49(1): 1-36, 2016. Type: Article
We are familiar with the notion of types as classifying what a program component does and permissible use of the component. A type system will tell us that a method call must have arguments of particular types and guarantee that it wil...
|
Jun 15 2016 |
|
|
|
|
|
|
Topics in parallel and distributed computing: introducing concurrency in undergraduate courses Prasad S., Gupta A., Rosenberg A., Sussman A., Weems C., Morgan Kaufmann Publishers Inc., San Francisco, CA, 2015. 360 pp. Type: Book (978-0-128038-99-4)
Providing practical assistance for adding parallel programming at an early stage to undergraduate students in computer science is the aim of this book. Although presented as a book, it is really a collection of separate articles by dif...
|
Jan 27 2016 |
|
|
|
|
|
|
Monotonic qualitative logic programs: computation and applications Ben-Eliyahu-Zohary R., Grinshpoun T., Churkin E., Gudes E. AI Communications 27(3): 213-228, 2014. Type: Article
If we are reasoning with rules that are guidelines rather than absolute statements of truth, we need a mechanism for selecting the most plausible conclusion. There may be a choice of rules that can be applied in some situations, and us...
|
May 5 2015 |
|
|
|
|
|
|
A resource semantics and abstract machine for Safe: a functional language with regions and explicit deallocation Montenegro M., Peña R., Segura C. Information and Computation 2353-35, 2014. Type: Article
A programming language called Safe is the topic of this paper. It has the syntax and operational semantics of a standard functional language, but is limited to first-order functions....
|
Jan 19 2015 |
|
|
|
|
|
|
Fast offline partial evaluation of logic programs Leuschel M., Vidal G. Information and Computation 23570-97, 2014. Type: Article
Suppose we execute a program with only some of the data it needs. If we reach a choice point requiring data we do not have, we could return a program consisting of the choice test and the code used in its branches. We could go further ...
|
Sep 3 2014 |
|
|
|
|
|
|
|
|
|
|
|