2025
Autores
Campos, JC; Harrison, MD;
Publicação
Handbook of Human Computer Interaction
Abstract
2025
Autores
Madeira, A; Oliveira, JN; Proença, J; Neves, R;
Publicação
JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING
Abstract
[No abstract available]
2025
Autores
Tarifa, SLT; Proenca, J; Oliveira, J;
Publicação
FORMAL ASPECTS OF COMPUTING
Abstract
2025
Autores
Oliveira, JN;
Publicação
JOURNAL OF FUNCTIONAL PROGRAMMING
Abstract
Experience in teaching functional programming (FP) on a relational basis has led the author to focus on a graphical style of expression and reasoning in which a geometric construct shines: the (semi) commutative square. In the classroom this is termed the magic square (MS), since virtually everything that we do in logic, FP, database modeling, formal semantics and so on fits in some MS geometry. The sides of each magic square are binary relations and the square itself is a comparison of two paths, each involving two sides. MSs compose and have a number of useful properties. Among several examples given in the paper ranging over different application domains, free-theorem MSs are shown to be particularly elegant and productive. Helped by a little bit of Galois connections, a generic, induction-free theory for ${\mathsf{foldr}}$ and $\mathsf{foldl}$ is given, showing in particular that ${\mathsf{foldl} \, {{s}}{}\mathrel{=}\mathsf{foldr}{({flip} \unicode{x005F}{s})}{}}$ holds under conditions milder than usually advocated.
2025
Autores
Faria, N; Pereira, J;
Publicação
Proc. ACM Manag. Data
Abstract
2025
Autores
Braga, R; Pereira, J; Coelho, F;
Publicação
40TH ANNUAL ACM SYMPOSIUM ON APPLIED COMPUTING
Abstract
Developers of data-intensive georeplicated applications face a difficult decision when selecting a database system. As captured by the CAP theorem, CP systems such as Spanner provide strong consistency that greatly simplifies application development. AP systems such as AntidoteDB providing Transactional Causal Consistency (TCC), ensure availability in face of network partitions and isolate performance from wide-area round-trip times, but avoid lost-update anomalies only when values can be merged. Ideally, an application should be able to adapt to current data and network conditions by selecting which transactional consistency to use for each transaction. In this paper, we test the hypothesis that a georeplicated database system can be built at its core providing only TCC, hence, being AP, but allow an application to execute some transactions under Snapshot Isolation (SI), hence CP. Our main result is showing that this can be achieved even when all the interaction happens through the TCC database system, without additional communication channels between the participants. A preliminary experimental evaluation with a proof-of-concept implementation using AntidoteDB shows that this approach is feasible.
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.