2025
Authors
Campos, JC; Harrison, MD;
Publication
Handbook of Human Computer Interaction
Abstract
2025
Authors
Barricelli, BR; Campos, JC; Luyten, K; Mayer, S; Palanque, P; Panizzi, E; Spano, LD; Stumpf, S;
Publication
COMPANION OF THE 2025 ACM SIGCHI SYMPOSIUM ON ENGINEERING INTERACTIVE COMPUTING SYSTEMS, EICS 2025 COMPANION
Abstract
This workshop proposal is the third edition of a workshop which has been organised at EICS 2023 and EICS 2024. This edition aims to bring together researchers and practitioners interested in the engineering of interactive systems that embed AI technologies (as for instance, AI-based recommender systems) or that use AI during the engineering lifecycle. The overall objective is to identify (from experience reported by participants) methods, techniques, and tools to support the use and inclusion of AI technologies throughout the engineering lifecycle for interactive systems. A specific focus is on guaranteeing that user-relevant properties such as usability and user experience are accounted for. Contributions are also expected to address system-related properties, including resilience, dependability, reliability, or performance. Another focus is on the identification and definition of software architectures supporting this integration.
2025
Authors
Zaina, LAM; Campos, JC; Spano, LD; Luyten, K; Palanque, PA; der Veer, GCv; Ebert, A; Humayoun, SR; Memmesheimer, VM;
Publication
EICS (Workshops)
Abstract
2025
Authors
Madeira, A; Oliveira, JN; Proença, J; Neves, R;
Publication
JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING
Abstract
[No abstract available]
2025
Authors
Tarifa, SLT; Proenca, J; Oliveira, J;
Publication
FORMAL ASPECTS OF COMPUTING
Abstract
2025
Authors
Oliveira, JN;
Publication
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.
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.