جست‌وجوی استاد و پژوهشگر

• Set Theory
• Mathematical Logic
• Ontologies
• +۶ مورد دیگر

Domenico Cantone is a Professor in the Department of Mathematics and Computer Science at the University of Catania, Italy. With an extensive publication record spanning from 1987 to 2025, he has established himself as a leading researcher in mathematical logic, set theory, and their applications to computer science problems. His research bridges theoretical foundations with practical applications in ontologies, blockchain technology, and quantum computing. Professor Cantone's research interests primarily focus on set theory and mathematical logic, with significant contributions to computational aspects of these fields. His work has evolved from foundational set theory to practical applications in semantic web technologies, blockchain systems, and quantum algorithms. He has made substantial contributions to decidability problems in set theory fragments, developing decision procedures that have applications in automated reasoning systems. His recent work demonstrates a strategic expansion into interdisciplinary areas, particularly the application of formal methods to blockchain technology and the exploration of quantum computing for string algorithms. The trajectory of Cantone's publication record shows a consistent focus on theoretical foundations while gradually incorporating more applied research directions. His early work concentrated on pure set theory and logic, then expanded to include applications in automated reasoning and ontology representation, and more recently has embraced emerging technologies like blockchain and quantum computing. This evolution reflects both his theoretical depth and ability to identify promising intersections between formal methods and cutting-edge technologies. Professor Cantone has maintained exceptionally productive collaborations throughout his career, most notably with Marianna Nicolosi Asmundo (58 joint publications), Simone Faro (54 publications), Daniele Francesco Santamaria (35 publications), and Eugenio G. Omodeo (35 publications). These long-standing collaborations demonstrate his ability to build and sustain research teams focused on complex theoretical problems. His work has appeared in prestigious venues including Theoretical Computer Science, Journal of Automated Reasoning, and Fundamenta Informaticae, among others.

Ben Greenmanمشاهده پروفایل

پژوهشگر

• Gradual Typing
• Formal Methods
• Programming Languages
• +۳ مورد دیگر

Ben Greenman is a Researcher at Brown University , specializing in Gradual Typing , Formal Methods , and Programming Language Design . He has developed tools like Forge for teaching formal methods FlowFPX for floating-point exception debugging CnD for specification visualization His work bridges theoretical advancements and practical software engineering challenges. Research Trends: Recent publications focus on Temporal logic misconceptions (2024-2025) Gradual typing performance (2023-2025) Tool-driven formal methods education (2023) Language design for macro systems (2023) Numerical computation reliability (2023) Key Contributions: Unified deep/shallow type systems Blame assignment strategies Collapsible contracts Corpus studies for type analysis Visual debugging frameworks

Max S. Newمشاهده پروفایل

استادیار

• Programming Languages
• Secure Compilation
• Gradual Typing
• +۶ مورد دیگر

Max S. New is an Assistant Professor in Computer Science & Engineering at the University of Michigan, specializing in Programming Languages , Gradual Typing , Secure Compilation , and Category Theory . He is affiliated with the MPLSE research community . Education: PhD in Computer Science (Northeastern University, 2020) Postdoctoral: Wesleyan University (with Dan Licata) His research bridges programming language theory with category theory and formal verification. Key contributions include intrinsic verification of parsers using dependent Lambek calculus, gradual type theory with parametricity, and denotational semantics for gradual typing using synthetic guarded domain theory. His work explores language interoperability , compiler intermediate languages , and stack-based effects through relative monads. Recent publications focus on verified parsing frameworks, automata formalism in linear logic, and category-theoretic models of graduality. He actively contributes to POPL , PLDI , and OOPSLA program committees and serves as a mentor in academic workshops. Max advises PhD students including Eric Giovannini (2021-) Steven Schaefer (2023-) Eric Bond (2023-) Yuchen Jiang (2023-) Jesse Slater (2024-, co-advised with Xinyu Wang) and teaches courses in Category Theory and Compiler Construction .

Kenji Maillardمشاهده پروفایل

پژوهشگر

• Programming Languages
• Proof Assistants
• Formal Methods
• +۹ مورد دیگر

Kenji Maillard is a junior researcher (Inria Starting Faculty Position) at Inria Rennes, affiliated with the Gallinette team and LS2N at Université de Nantes, France. He has been in this role since December 2022, following a postdoctoral fellowship in the same group under Nicolas Tabareau and Éric Tanter. PhD: ENS Ulm and Inria Paris (2019) Supervisor: Cătălin Hrițcu Thesis: Principles of Program Verification For Arbitrary Monadic Effects Kenji's research lies at the intersection of computer science and mathematics, focusing on programming languages, proof assistants, and formal methods. His work spans the metatheory of dependent type systems—leveraging category theory, homotopy theory, and model theory—as well as their verified implementation in proof assistants like Coq. He is particularly interested in gradual typing for dependent types, logical modularity, and the formalization of mathematical reasoning. His recent publications reflect a consistent focus on advancing type theory and verification frameworks. Key themes include gradualization of the Calculus of Inductive Constructions, indexed inductive types, sort polymorphism, and the integration of logical and computational principles in proof assistants. These works contribute to making formal verification more scalable and accessible. Kenji is an active contributor to the programming languages community, serving on program committees for POPL, ICFP, CPP, and other top-tier venues. He advocates for open access in academic publishing and maintains a strong public presence through his website, GitHub, and presentations. Member, POPL Program Committee (2026) PC Member, ICFP, OOPSLA, CPP, CoqPL Artifact Evaluation Committee, PLDI, POPL He has collaborated extensively with researchers such as Meven Lennon-Bertrand, Nicolas Tabareau, Éric Tanter, and others. His work is primarily conducted within the Gallinette team at Inria, which focuses on the foundations and applications of proof assistants and type theory.

Francesco Zappa Nardelliمشاهده پروفایل

دانشیار

• Formal Verification
• Programming Languages
• Type Systems
• +۳ مورد دیگر

Francesco Zappa Nardelli is a part-time Associate Professor at École Polytechnique and a Research Scientist at Meta. He is currently on leave from Inria Paris, focusing on formal verification and programming language design. Member of the POPL'23 Program Committee Presented key research on formal verification of microkernel IPC and Julia subtyping algorithms Research Focus: His work bridges formal methods, programming language theory, and systems software. Recent efforts include compiler optimization, type system innovation, and safety-critical systems verification. Scientific Recognition: Recognized as an invited speaker at DeepSpec and ENTROPY workshops, with publications in top venues like CPP, OOPSLA, and ECOOP.

Christos Dimoulasمشاهده پروفایل

استادیار

• Programming Languages
• Type Systems
• Formal Methods
• +۴ مورد دیگر

Affiliations Christos Dimoulas is an Assistant Professor of Computer Science at Northwestern University , within the McCormick School of Engineering and Applied Sciences and the Computer Science Department . His office is located at Mudd 3513. Education Ph.D. in Computer Science, Northeastern University, Boston, MA Research Interests Dr. Dimoulas focuses on Programming Languages , including type systems, gradual typing, formal methods, software contracts, and security. His work often explores the intersection of theory and practice, addressing challenges like blame assignment in type mismatches, efficient runtime checks, and language-based security mechanisms. Publications His recent work includes advancements in gradually typed languages, effectful software contracts, and transient semantics for Racket. Key themes include improving type safety, optimizing performance through profiling, and enhancing error localization via blame analysis. Students & Advising Current advisees include Nathaniel Hejduk and Chenhao Zhang . Alumni such as Dr. Lukas Lazarek (now at Brown University) have contributed to projects like blame evaluation in gradual types. Teaching Recent courses include CS 324/424: Dynamics of Programming Languages (Spring 2025) and CS 321: Programming Languages (Fall 2024). He often incorporates practical language design and implementation topics into his curricula. Labs & Collaborations His research frequently collaborates with institutions like Northeastern University and Brown University, focusing on projects such as the Rational Programmer framework for evaluating language pragmatics.

• Programming Languages
• Type Theory
• Formal Semantics
• +۳ مورد دیگر

Max New is an Assistant Professor in the Department of Computer Science and Engineering at the University of Michigan's College of Engineering. He specializes in programming languages, type theory, and formal semantics, with particular focus on gradual typing, functional programming, and category theory. His research emphasizes foundational aspects of programming languages and their semantic properties. He advises graduate students through weekly one-on-one meetings and hosts weekly group meetings at an on-campus café to foster collaboration. Students are expected to conduct research, publish papers, and maintain on-campus presence. Teaching responsibilities include serving as a Graduate Student Instructor (GSI) for 1-2 semesters. His recent work explores topics like stack-manipulating computation, denotational semantics of gradual typing, and formal category theory. Conference attendance is supported through research funds and college grants. Students typically take time off during major holidays and summer months.

Amin Timanyمشاهده پروفایل

دانشیار

• Programming Languages
• Formal Methods
• Type Theory
• +۳ مورد دیگر

Amin Timany serves as an Associate Professor in the Department of Computer Science at Aarhus University, Denmark. His research focuses on foundational aspects of programming languages and formal verification systems, with particular expertise in logical frameworks for program correctness. His primary research interests span: Programming Languages Theory Formal Methods and Verification Type Systems and Type Soundness Separation Logic for Concurrency Logical Relations and Denotational Semantics Mechanized Proof Systems Analysis of Timany's recent publications (2022-2025) reveals a strong emphasis on separation logic extensions for distributed systems, guarded recursion techniques, and type soundness proofs. His work frequently bridges theoretical foundations with practical verification challenges, particularly in capability-based security and CRDT verification. The publications demonstrate consistent contributions to top venues including POPL, PLDI, and CPP. Timany actively participates in academic service, having served as conference chair for CPP 2025. His research involves significant collaboration with international teams, particularly with researchers at Aarhus University and other European institutions. The publication record shows steady output with 40+ research items, including 2 PhD supervisions noted in his profile.

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

استاد

• Programming Languages
• Software Engineering
• Incremental Computation
• +۷ مورد دیگر

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.

Tijs van der Stormمشاهده پروفایل

استاد

• Domain-Specific Languages (DSLs)
• Software Engineering
• Programming Languages
• +۴ مورد دیگر

Tijs van der Storm is a Senior Researcher and Groupleader at the Centrum Wiskunde & Informatica (CWI) in Amsterdam, Netherlands, with a part-time professor appointment at the University of Groningen . His work spans Domain-Specific Language (DSL) design , software engineering , and programming language theory , focusing on tools like the Rascal meta-programming language for DSL construction and evolution. Email: storm@cwi.nl , T.van.der.Storm@cwi.nl Academic Rank: Professor (University of Groningen), Scientific Staff Member (CWI) Research Interests center on building and evolving DSLs , integrating live programming environments , and advancing language workbenches . His work addresses challenges in software analysis , model-driven development , and interactive programming tools . Trends in his scientific publications (2015–2024) emphasize DSL engineering , concrete syntax , gradual typing , and block-based language design . He has contributed to software testing and distributed systems through projects like AlleAlle and Recaf . Awards and Recognitions : Most Influential Paper Award (SLE 2023) Distinguished Artifact Award (SLE 2021) Distinguished Vision Paper Award (SLE 2018) Best Software Engineering Technology Paper (ICT OPEN 2019) Professional Activities include leadership roles in academic communities: chair of IFIP TC2 Working Group 2.16, treasurer of the European Association for Programming Languages and Systems (EAPLS), and organizer of conferences like SLE 2016 . He has served on program committees for IFIP TC2 WG 2.16 , EAPLS , and SPLASH symposia.

Max S. Newمشاهده پروفایل

استادیار

• Programming Languages
• Formal Methods
• Type Theory
• +۳ مورد دیگر

Max S. New is an Assistant Professor in Computer Science & Engineering at the University of Michigan, part of the MPLSE research community. His research focuses on the mathematical foundations of programming languages, particularly interoperability between languages via Gradual Typing and compiler intermediate languages. He holds a PhD from Northeastern University (2020) and completed a postdoc at Wesleyan University. Research interests include formal methods, type theory, compiler design, and categorical logic. Recent work emphasizes verified parsing using Dependent Lambek Calculus, demonstrated in a PLDI 2025 paper accepted with students Steven Schaefer and collaborators. Advises PhD students in areas like language interoperability and formal verification. Active in open-source projects like the Agda implementation of Dependent Lambek Calculus.

• Causal Discovery
• Computational Argumentation
• Explainable AI
• +۴ مورد دیگر

Dr. Fabrizio Russo is a Research Associate in the Computational Logic and Argumentation group within the Department of Computing at Imperial College London's Faculty of Engineering. He obtained his PhD in Safe and Trusted AI from Imperial College in 2025, funded by the UKRI Centre for Doctoral Training (STAI). Previously, he spent six years in industry as Head of Data Science at 4most Europe, specializing in credit risk modeling. His research focuses on augmenting human decision-making through Causal Discovery , Computational Argumentation , and Explainable AI . He develops transparent techniques that integrate causality with machine learning to create contestable AI systems for high-stakes domains. Key interests include human-AI debate frameworks, knowledge injection in neural networks, and Shapley-based causal structure learning. Publications demonstrate sustained contributions to knowledge-driven AI , with recent works exploring argumentative causal discovery (2024), contestable neural networks (2023), and classifier explanation methods (2023). Research consistently combines formal reasoning with practical applications in trustworthy AI. Awards & Recognition: AISTATS 2023 Top-Reviewer Award Teaching & Service: Served as Graduate Teaching Assistant for Introduction to Machine Learning (2021-2022). Co-organizes the Explainable AI Seminars @ Imperial and contributes as reviewer for top conferences (ICLR, NeurIPS, ICML). Assistant Chair for XAI-FIN workshops at ICAIF (2022-2024).

Amal Ahmedمشاهده پروفایل

استاد

• correct and secure compilation
• linking types for multi-language software
• typed compilation of dependent types
• +۵ مورد دیگر

Amal Ahmed is a Professor in the Department of Computer Science at Northeastern University's College of Computer and Information Science. She is an active researcher and academic leader in programming languages, with significant contributions to type systems, compiler verification, and language interoperability. Her work bridges theoretical foundations with practical systems applications, particularly in the areas of gradual typing and secure compilation. Dr. Ahmed's research focuses on correct and secure compilation , linking types for multi-language software , typed compilation of dependent types , semantics and logical relations , gradual typing , and safe language interoperability . Her work explores how to formally verify compilers and ensure type safety across language boundaries, with applications to modern systems like WebAssembly. She has developed novel semantic approaches to application binary interfaces and language interoperability that provide strong security guarantees. Her recent publications show a consistent focus on formal methods for language design, with increasing attention to probabilistic programming and separation logic. She has made significant contributions to understanding how gradual typing systems can maintain parametricity and how borrowing concepts from Rust can be formally modeled. Her work on RichWasm demonstrates practical applications of her theoretical research to web technologies. Dr. Ahmed actively serves the programming languages community through leadership roles in major conferences. She has chaired program committees, organized workshops, and mentored students through the Programming Languages Mentoring Workshop (PLMW). Her involvement spans POPL, ICFP, PLDI, SPLASH, and related conferences, where she regularly presents research and participates in steering committees. As an educator and mentor, she has presented numerous talks on managing research, working with advisors, and navigating academic careers, particularly through the PLMW series. She has chaired doctoral symposia and served on review committees, demonstrating her commitment to developing the next generation of programming languages researchers.

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

استادیار

• Program Verification
• Probabilistic Programming
• Language-Based Security
• +۵ مورد دیگر

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

Bruno C. d. S. Oliveiraمشاهده پروفایل

دانشیار

• Programming Languages
• Modularity
• Type Systems
• +۶ مورد دیگر

Bruno C. d. S. Oliveira is an Associate Professor at the University of Hong Kong , Department of Computer Science. His research focuses on Programming Languages , Modularity , and Type Systems , particularly exploring intersections of Functional and Object-Oriented Programming . He leads the HKU PL Group and actively supervises PhD/MPhil students. Research Interests: Type systems for modularity, subtyping, intersection/union types, gradual typing, polymorphism, and language design. Key Contributions: Unified functional and object-oriented paradigms via object algebras, advanced iso-recursive subtyping theory, and developed practical solutions for the expression problem. Scientific Awards: Distinguished Artifact Award (OOPSLA 2024) Editors' Choice Award (The Art, Science and Engineering of Programming, 2019) Best Paper Awards at ECOOP 2012, Modularity 2016, and TFP 2007 Advising: Supervised 14 PhD/MPhil students between 2007–2024. Students research topics like type inference, visitor frameworks, and disjoint polymorphism.