Browse All Reviews
Theory Of Computation (F)
> General (F.0)
All Media Types
1-10 of 126 Reviews about "
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
Devanur N., Jain K., Sivan B., Wilkens C. Journal of the ACM 66(1): 1-41, 2019. Type: Article
The resource allocation problem is an age-old problem with a rich history. This paper revisits the resource allocation problem, albeit in a different setting, finding “a middle ground between worst-case and stochastic [analyses]”: the ...
Sep 21 2021
On the foundations of computing
Primiero G., Oxford University Press, Oxford, UK, 2020. 320 pp. Type: Book (978-0-198835-65-3)
This enterprising, enthusiastic, and energetic book undertakes to provide a foundational perspective on three phases of modern computing: theory, architecture, and scientific exploration. The author considers these to be exhaustive, and courageous...
Aug 12 2021
Cubical Agda: a dependently typed programming language with univalence and higher inductive types
Vezzosi A., Mörtberg A., Abel A. Proceedings of the ACM on Programming Languages 3(ICFP): 1-29, 2019. Type: Article
Russell proposed type theory in the first decades of the 20th century in response to the foundational crisis faced by set theory. Over the last century, there have been a number of developments in type theory, in particular the mechanization of ty...
Jul 23 2021
Constructing quotient inductive-inductive types
Kaposi A., Kovács A., Altenkirch T. Proceedings of the ACM on Programming Languages 3(POPL): 1-24, 2019. Type: Article
At the core of Martin-Löf type theory (also known as “intuitionistic type theory”) are dependent types, that is, types whose definitions depend on values; these may be used to encode logical quantification. In general, a type may ...
Jul 9 2021
Uncertainty management with fuzzy and rough sets: recent advances and applications
Bello R., Falcon R., Verdegay J., Springer International Publishing, New York, NY, 2019. 413 pp. Type: Book (978-3-030104-62-7)
This volume contains papers presented at the Second International Symposium on Fuzzy and Rough Sets (ISFUROS 2017). The symposium drew 55 submissions; 30 were accepted for presentation. Extended versions of 20 accepted papers are included in this ...
Jun 3 2021
Incomplete SMT techniques for solving non-linear formulas over the integers
Borralleras C., Larraz D., Rodríguez-Carbonell E., Oliveras A., Rubio A. ACM Transactions on Computational Logic 20(4): 1-36, 2019. Type: Article
It is well known that nonlinear integer arithmetic is undecidable due to a negative answer to Hilbert’s tenth problem. Still, constraint solving over nonlinear integer polynomials has attracted considerable attention because of the wide rang...
May 27 2021
Implementing a modal dependent type theory
Gratzer D., Sterling J., Birkedal L. Proceedings of the ACM on Programming Languages 3(ICFP): 1-29, 2019. Type: Article
Modalities are widely used in mathematics and computer science as an abstraction tool, but it turns out to be difficult to incorporate them in rich type theories. The authors address this problem, proposing a new dependent type theory MLTT
Apr 27 2021
Stochastic geometry: modern research frontiers
Coupier D., Springer International Publishing, New York, NY, 2019. 248 pp. Type: Book (978-3-030135-46-1)
In the era BC (“before computers”), the standard way to reason about geometric objects, dating back to Euclid, was a logical proof system based on axioms. This approach is symbolic, dealing with entities such as points and lines. It le...
Apr 13 2021
Implicit parameters for logic programming
Madsen M., Lhoták O. PPDP 2018 (Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, Frankfurt am Main, Germany, Sep 3-5, 2018) 1-14, 2018. Type: Proceedings
The art of programming is all about building programs that are concise, elegant, efficient, and, most importantly, readable and understandable by others. Software engineers use a number of tools to make code readable, for example, well-designed ty...
Mar 10 2021
Environmental bisimulations for probabilistic higher-order languages
Sangiorgi D., Vignudelli V. ACM Transactions on Programming Languages and Systems 41(4): 1-64, 2019. Type: Article
Bisimulation is a technique for proving the behavioral equivalence of labeled transition systems. It is used in the study of λ calculi, for example, especially in the context of concurrency. The basic idea is to find a relation between progra...
Feb 2 2021
Reproduction in whole or in part without permission is prohibited. Copyright © 2000-2021 ThinkLoud, Inc.