Gradual Queries Professors and Supervisors

Philip Wadlerمشاهده پروفایل

استاد

Max Planck Institute for Software SystemsGermany

Philip Wadler is Professor of Theoretical Computer Science at the University of Edinburgh and Senior Research Fellow at IOHK. He is an ACM Fellow, Fellow of the Royal Society, and Fellow of the Royal Society of Edinburgh. His work spans programming language design, type systems, and formal verification, with significant contributions to Haskell, Java, and XQuery. He has held leadership roles in ACM SIGPLAN and served on editorial boards for major journals. Research Interests: Wadler's research focuses on the foundations of programming languages , including Gradual and session typing Language-integrated query Functional and logic programming XML data models Parametricity and free theorems Verification of smart contracts Publication Trends: Recent articles emphasize type safety, formal verification, and blockchain applications. Key themes include gradual typing (blame calculus), session types for concurrency, and logical foundations of programming. His 2015–2025 papers show sustained focus on type theory and language design . Awards & Recognition: POPL Most Influential Paper (2003 for 1993 work) SIGPLAN Distinguished Service Award Best Paper SBMF 2018 Royal Society-Wolfson Fellowship (2004–2009) ACM Fellow (2007) Fellow of Royal Society of Edinburgh (2005) Advising & Grants: He has supervised numerous PhD students in programs like the Centre for Doctoral Training in Pervasive Parallelism. His EPSRC Programme Grant "From Data Types to Session Types" (2013–2020) funded major advances in concurrency theory. Current work with IOHK explores blockchain verification using Haskell-based Plutus.

پروفایل رسمی دانشگاه

Mario Alvianoمشاهده پروفایل

استاد

InriaFrance

Mario Alviano is a Full Professor in Computer Science (INF/01) at the University of Calabria, Department of Mathematics and Computer Science. He leads the LAIA lab (Laboratorio di Applicazioni dell'Intelligenza Artificiale) and serves as co-PI in the PRIN project PRODE ('Probabilistic Declarative Process Mining'). Current projects: FAIR ('Future AI Research'), Tech4You ('Technologies for climate change adaptation'), SERICS ('SEcurity and RIghts in the CyberSpace'), CAL.HUB.RIA , RADIOAMICA , and STROKE 5.0 His research focuses on Answer Set Programming (ASP), particularly in optimization, nonmonotonic reasoning, and applications to logistics, healthcare, and cybersecurity. He has authored over 120 publications in top venues like AIJ, AAAI, and IJCAI. Recent academic contributions includes work on: Temporal Many-valued Conditional Logics Weighted Knowledge Bases with Typicality Explainable AI via xASP and ASP Chef Defeasible Reasoning Scalability Notable awards: Artificial Intelligence Award 'Marco Somalvico' (2017) ICLP Best Paper Awards (2015, 2016) LPNMR Best Paper Award (2022) CILC Best Paper Award (2023)

پروفایل رسمی دانشگاه

Stefan Funkeمشاهده پروفایل

پژوهشگر

University of TrierGermany

Stefan Funke is a researcher at the University of Stuttgart, Germany, with a focus on algorithms and computational geometry. His work spans wireless communication, route planning, and trajectory analysis. Research Interests: Algorithms, Computational Geometry, Wireless Communication, Route Planning, Trajectory Segmentation His recent publications (2024-2025) explore topics like 3D epithelial cell dynamics, graph radius computation, and polyline simplification, emphasizing scalability and efficiency. Earlier works (2017-2019) investigate contraction hierarchies, energy-efficient routing, and trajectory storage systems. Stefan collaborates frequently with Sabine Storandt, Claudius Proissl, and Tobias Rupp. He applies geometric methods to problems in wireless networks, road systems, and data structures, with a recurring emphasis on optimization and robustness.

پروفایل رسمی دانشگاه

Allel Hadjaliمشاهده پروفایل

استاد

National Graduate School of Mechanics and AerotechnicsFrance

Allel Hadjali is a Full Professor in Computer Science specializing in Data Engineering at ISAE-ENSMA (École Nationale Supérieure de Mécanique et d'Aérotechnique) in Poitiers, France. He is affiliated with the Laboratory LIAS (Laboratoire d'Ingénierie des Applications de la Connaissance et des Systèmes) at ISAE-ENSMA. His academic career includes progression from Associate Professor to his current Full Professor position, with extensive teaching experience across multiple computer science domains. Professor Hadjali's research falls within the data science domain, with particular focus on Exploitation, Extraction, and Recommendation (E2R). His work applies Computational Intelligence and Soft Computing techniques to massive data exploitation and analysis, including flexible querying approaches (Skyline, Gradual, and Bipolar queries), modeling and querying uncertain/incomplete data, cooperative answering techniques, and data reduction through linguistic summaries. He also conducts research in recommendation systems (learning-based and group recommendation) and extraction techniques (mining gradual patterns), along with related interests in data quality, intelligent systems, and crowdsourced data management. His publication record demonstrates consistent contributions to top-tier journals and conferences, with recent work focusing on skyline query processing, uncertain data management, RDF knowledge bases, and explainable AI. His research shows a clear trajectory from foundational work in fuzzy logic and uncertain databases toward more applied research in semantic web technologies and machine learning explainability. Professor Hadjali serves on the editorial boards of several prestigious journals including the Journal of Smart Environments and Green Computing, Sensors Journal, and the Universal Journal of Aeronautics and Aerospace Research. He has also organized special issues on topics such as uncertainty in cloud computing and managing uncertain data. At ISAE-ENSMA, Professor Hadjali teaches courses including Formal aspects of software engineering, Language interpretations and compilation, Programming languages, and Data management and exploitation. Previously as an Associate Professor, he taught courses on object modeling, distributed algorithms, operating systems, and advanced databases focusing on preferences and uncertainty. He leads the Data Engineering team within the Laboratory LIAS, which focuses on developing computational intelligence approaches for modern data challenges. His current projects include work on data quality (QDoSSI project funded by CNRS Mastodons 2016-2018) and research actions in GDR MADICS 2018 related to scientific data quality.

پروفایل رسمی دانشگاه

Stefan Funkeمشاهده پروفایل

استاد

University of StuttgartGermany

Stefan Funke is a Professor at the University of Stuttgart's Institute for Formal Methods in Computer Science, part of the Faculty of Computer Science, Electrical Engineering and Information Technology. His work focuses on algorithm design and computational geometry with applications in road networks, trajectory analysis, and geographic information systems. He leads the Algorithmics Group, developing efficient algorithms for shortest path planning, network optimization, and privacy-preserving queries. Research interests include geometric algorithms, graph theory, and practical implementations of theoretical results in transportation and spatial data analysis. Notable contributions involve contraction hierarchies for fast shortest path queries, trajectory mining techniques, and methods for preserving privacy in network-based computations. Recent work emphasizes scalable solutions for large-scale road networks, including simplification methods that preserve topological features and energy-efficient routing strategies for electric vehicles. His research often bridges theoretical foundations with real-world applications in navigation systems and smart mobility solutions. Awards and grants are not explicitly listed in the provided data, but his extensive publication record indicates sustained recognition in algorithmic research. He advises on multiple interdisciplinary projects involving spatial data processing and algorithm engineering.

پروفایل رسمی دانشگاه

Sebastian Erdwegمشاهده پروفایل

استاد

National and Kapodistrian University of AthensGreece

Sebastian Erdweg is a Professor at the Institute of Programming and Software Engineering at Johannes Gutenberg University Mainz (JGU Mainz) in Germany. He actively contributes to the programming languages research community as evidenced by his extensive involvement in major conferences including PLDI, ECOOP, SPLASH, and ICFP. His leadership roles include serving as Workshops Co-Chair for ECOOP and ISSTA 2023, Steering Committee Chair for GPCE, and various program committee positions across multiple conferences. His research primarily focuses on programming language design and implementation, with particular expertise in incremental computation, Datalog-based systems, abstract interpretation, and language workbenches. Erdweg's work bridges theoretical foundations with practical applications in static analysis, compiler construction, and program transformation. His research demonstrates a consistent thread of improving developer productivity through better language design and tooling, with recent work emphasizing efficient incremental program analysis techniques. Erdweg's publication record shows a strong emphasis on Datalog as a foundation for program analysis, with increasing focus on incremental techniques and WebAssembly analysis in recent years. His work combines theoretical rigor with practical implementation, often resulting in open-source tools that advance the state of the art in language engineering. The consistent appearance of Datalog, incremental computation, and abstract interpretation across his publications indicates a cohesive research vision spanning over a decade. As an active member of the programming languages community, Erdweg has served in numerous organizational roles including Workshops Co-Chair for ECOOP and ISSTA 2023, Steering Committee Chair for GPCE, and various program committee positions. His contributions to conference organization demonstrate his standing within the academic community and commitment to advancing research in programming languages and software engineering.

پروفایل رسمی دانشگاه

Federico Olmedoمشاهده پروفایل

استادیار

Max Planck Institute for Software SystemsGermany

Federico Olmedo is an Assistant Professor at the Computer Science Department of the University of Chile, where he teaches courses like Program Analysis and Verification ( CC4101 ) and Discrete Mathematics for Computer Science ( CC3101 ). His research focuses on the semantics and verification of probabilistic programs , with applications in language-based security , differential privacy , and formal verification of cryptographic systems . Previously, he was a postdoctoral researcher at RWTH Aachen University and earned his PhD from the Technical University of Madrid in 2014. Research Interests : Program Verification Probabilistic Programming Language-Based Security Theorem Provers Quantum Computing Cryptographic Proofs Publications span formal methods for probabilistic programs, including weakest precondition calculi , runtime analysis of quantum programs , and machine-checked proofs for cryptographic protocols . Notable works include the Best Theory Paper Award at ECOOP 2016 and foundational research on conditioning in probabilistic programming . He co-developed the CertiCrypt and CertiPriv frameworks for verifying cryptographic proofs and differential privacy in Coq. Scientific Awards : ECOOP 2016 Best Theory Paper Award

پروفایل رسمی دانشگاه

Mario Alvianoمشاهده پروفایل

استاد

University of TrierGermany

Mario Alviano is a Professor at the University of Calabria's Department of Computer Engineering, Modeling, Electronics and Systems (DIMES) in Rende, Italy. With a prolific publication record spanning from 2008 to 2025, he has established himself as a leading researcher in Answer Set Programming (ASP), logic programming, and knowledge representation. His work bridges theoretical foundations with practical applications across diverse domains including cybersecurity, environmental monitoring, and explainable AI. Alviano's research focuses on advancing the theoretical understanding and practical applications of Answer Set Programming. His key contributions include developing ASP Chef, a visualization and development framework for ASP; advancing theoretical foundations of conditional reasoning and typicality in weighted knowledge bases; and creating bridges between neural networks and symbolic AI through preferential interpretations. His recent work explores temporal extensions to conditional logics, applications of ASP to digital twin visualization, and tools for improving explainability in AI systems. Alviano's publications consistently appear in top-tier venues including ICLP, LPNMR, JELIA, and Theory and Practice of Logic Programming. His research demonstrates strong trends toward practical applications of theoretical advances, with increasing focus on explainability, visualization, and real-world problem solving. The recent surge in publications (26 in 2024 alone) indicates significant ongoing research activity and leadership in the field. His work increasingly integrates ASP with other AI paradigms, particularly neural networks, to create more interpretable and robust AI systems. Alviano has made substantial contributions to the development of tools and frameworks that lower barriers to entry for ASP, most notably ASP Chef which provides visualization capabilities for complex logic programs. His work on Hashcash Tree demonstrates applications to security problems, while his research on marketplace logistics shows practical business applications of declarative programming. His collaborative network is extensive, with frequent co-authorship with researchers including Wolfgang Faber, Nicola Leone, Francesco Ricca, Carmine Dodaro, Laura Giordano, and Daniele Theseider Dupré, reflecting strong connections across European AI research institutions. Alviano has also organized workshops including multiple editions of Datalog 2.0, demonstrating leadership in the logic programming community.

پروفایل رسمی دانشگاه

Erhard Rahmمشاهده پروفایل

استاد

Leipzig UniversityGermany

Prof. Dr. Erhard Rahm is a leading computer science academic at the University of Leipzig , affiliated with the Institute of Computer Science under the Faculty of Mathematics and Computer Science. With over 35 years of research contributions, he specializes in scalable data integration, privacy-preserving record linkage (PPRL), and graph analytics for knowledge graphs and digital twins. Key research areas: Data Integration for Knowledge Graphs, Privacy-Preserving Data Analysis, Dynamic Graph Management Recent work focuses on hybrid digital twins, medical image analysis, and secure health data processing 2016-2021: Speaker of GI's Database Systems and Information Systems division Scientific Contributions: His 15 most recent publications (2023-2025) span: Privacy-preserving machine learning (federated learning, PPRL with LLMs) Graph-based data transformations (Temporal Knowledge Graphs, Property Graph Streams) Automated schema matching and entity resolution systems Biomedical data applications (cell confluence assessment, stress detection) Selected Honors: VLDB Ten-Year Best Paper Award (2011) ICDE Influential Paper Award (2013) MSR Outstanding Collaborator Award (2016) Leadership Roles: Currently Vice President of the Gesellschaft für Informatik (since 2022), former DFG reviewer (2016-2024), and active in NFDI infrastructure (2019-2022). He leads research at ScaDS.AI, focusing on big data integration and scalable graph analytics.

پروفایل رسمی دانشگاه

Matteo Ciminiمشاهده پروفایل

استادیار

University of Massachusetts LowellUnited States

Matteo Cimini is an Assistant Professor in the Miner School of Computer & Information Sciences at the Kennedy College of Sciences, University of Massachusetts Lowell. He teaches courses in programming languages, algorithms, and computer science foundations across multiple semesters from 2017 through 2025. Dr. Cimini earned his Ph.D. in Computer Science from Reykjavik University (2012), where his dissertation focused on Contributions to the Meta-Theory of Structural Operational Semantics. He also holds an M.S. in Computer Science from the University of Bologna (2008). His research centers on programming language theory, with particular expertise in formal methods, type systems, and language semantics. Dr. Cimini's work bridges theoretical foundations with practical language design, focusing on verification, gradual typing, and concurrency. His research has been published in top-tier programming languages conferences including POPL, ICFP, and PLDI. Dr. Cimini's recent publications demonstrate a strong focus on language-oriented programming, with his "Lang-n-X" series of systems exploring innovative approaches to language design, verification, and analysis. His work often combines theoretical rigor with practical implementation, creating tools that enable new ways of working with programming languages. Best Paper Award at TAP 2023 for "Testing Languages with a Languages-as-Databases Approach" Dr. Cimini actively mentors students, with recent advisees including Ph.D. student Joan and master's student Eswar, who successfully defended a thesis on Lang-n-Prove. He serves on program committees for numerous prestigious conferences including IFL 2025, SLE 2025, FORTE 2025, ICE 2025, and has been involved with conferences dating back to 2015. Dr. Cimini leads the development of the "Lang-n-X" series of systems, which includes tools like Lang-n-Prove (for language proofs), Lang-n-Send (for language communication), and Lang-n-Assert (for language logics). These systems form an integrated framework for language design, verification, and analysis, representing a cohesive research vision that has evolved through consistent publication output.

پروفایل رسمی دانشگاه

Philip Wadlerمشاهده پروفایل

استاد

University of EdinburghUnited Kingdom

Philip Wadler is a Professor of Theoretical Computer Science in the Laboratory for Foundations of Computer Science at the School of Informatics, University of Edinburgh, a position he has held since 2003. He is also a Senior Research Fellow and Area Leader in Programming Languages at IOHK. His career includes prior academic roles at the University of Glasgow and research positions at Bell Labs and Avaya Labs. He is a principal designer of the Haskell programming language and a leading figure in programming language theory. Education: B.S. Stanford University (1977), Ph.D. Carnegie-Mellon University (1982), Postdoc Oxford University (1983–1987) Wadler's research focuses on the intersection of logic, types, and programming languages. His work has profoundly influenced functional programming, type systems, concurrency, and formal methods. Key contributions include the design of Haskell, the development of the blame calculus for gradual typing, Featherweight Java as a formal model, and the Links language for web programming. He has also worked extensively on XML standards (XQuery, XSLT) and the Curry-Howard correspondence, most notably through his widely acclaimed article "Propositions as Types". His current research, supported by an EPSRC Programme Grant, explores session types and concurrency. His recent publications (2015–2025) reveal a consistent focus on type theory, particularly blame calculus, gradual typing, session types, and formal verification for blockchain and smart contracts. There is a strong emphasis on logical foundations, parametricity, and the application of theoretical concepts to practical systems, especially in the context of modern programming challenges like concurrency and distributed systems. SIGPLAN Distinguished Service Award, 2016 ACM Fellow, 2007 Fellow, Royal Society of Edinburgh, 2005 Wolfson-Royal Society Research Merit Award, 2004–2009 Most Influential POPL Paper Award 2003 (for 1993) Best Paper Award, SBMF 2018 Wadler has advised numerous PhD and Master's students and has been actively involved in the academic community through editorial roles (e.g., Journal of Functional Programming, Journal of Financial Technology), program committees for major conferences (POPL, ICFP, HOPL), and leadership in ACM SIGPLAN. He has led significant research projects such as the EPSRC Programme Grant 'From Data Types to Session Types' and has contributed to outreach and education through extensive lecturing, tutorials, and public talks. He is associated with key research groups including the Laboratory for Foundations of Computer Science at Edinburgh and the ABCD project, and collaborates with institutions and industry partners on topics ranging from programming language design to blockchain technology.

پروفایل رسمی دانشگاه

Matías Toro Ipinzaمشاهده پروفایل

استادیار

Max Planck Institute for Software SystemsGermany

Matías Toro is an Assistant Professor at the University of Chile , affiliated with the Computer Science Department (DCC) and PLEIAD Lab . His work focuses on programming languages, particularly type systems and gradual typing. Research Interests: Programming Languages Type-and-effect Systems Gradual Typing Security Typing Substructural Type Systems Abstracting Gradual Typing Differential Privacy Recent Work Trends: His publications cover gradual typing extensions for parametricity, differential privacy, SQL engines, and information flow security. Keywords: type systems, programming languages, privacy-preserving computation, abstract interpretation, language design, parametricity. Scientific Awards: Distinguished Paper Award - superseded by JACM article "Gradual System F" (2022) Grants: Recipient of FONDECYT DE INICIACIÓN (2025), PROYECTO DE COLABORACIÓN INTERNACIONAL DFG-ANID (2024), FONDECYT (2020), and CONICYT scholarships (2015, 2013) for academic studies. Labs & Collaborations: Active in the PLEIAD Lab, contributing to programming language theory and type system design.

پروفایل رسمی دانشگاه