Nicolas Tabareau is a researcher at Inria, France, and leads the Gallinette team ( http://gallinette.inria.fr/ ). His work focuses on enhancing tools for formal proof verification in computer science and mathematics. Research Interests : Proof Assistants, Homotopy Type Theory, Semantics of Programming Languages, Category Theory Tabareau's publications span type theory, gradual typing, and formal verification using Coq. His recent work (2025) explores gradual typing extensions and proof-irrelevant type systems. Earlier contributions (2024–2015) address OCaml extraction correctness, inductive types, and computational assumptions in proof assistants. He actively participates in conference program committees (CPP, ICFP, POPL) and has presented at workshops (CoqPL, PriSC) and symposia (LAFI, PADL). No scientific awards or part-time affiliations are mentioned in the provided data.
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
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 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.
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.
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.
Martin Erwig is a Professor of Computer Science at Oregon State University's School of Electrical Engineering and Computer Science since 2000. He holds a Habilitation (1999) and Ph.D. (1994) from the University of Hagen, Germany, and a Diploma (M.S.) from the University of Dortmund (1989). His research focuses on domain-specific languages (DSL), functional programming, and visual languages, with notable contributions to oceanographic simulation tools and educational methodologies. Erwig's awards include the 2023 John McCarthy Best Overall Paper Award, 2021 College of Engineering Mentoring Award, and a 2017 American Book Fest Best Book Award for his book Once Upon an Algorithm . He has published over 160 peer-reviewed articles and developed teaching strategies using games to explain computational concepts. His academic journey includes a 15-month military stint as a tank driver and early work designing databases. He emphasizes computational literacy for non-specialists, advocating for accessible explanations through storytelling and analogies.
Necati ARAS is a Professor in the Department of Industrial Engineering at Bogazici University. He holds a PhD from Bogazici University (1999). His research focuses on inventory control, reverse logistics, supply chain optimization, and the application of artificial neural networks in complex systems. He has published extensively on topics including facility location, wireless sensor networks, disaster preparedness, and competitive market strategies. Education: PhD, Bogazici University, 1999 ARAS's work bridges theoretical optimization with real-world applications, particularly in logistics, network security, and smart cities. His contributions include models for minimizing contagion spread in networks, optimizing multi-tier cloud computing, and improving vehicle routing efficiency. Recent research emphasizes strategic resource allocation and mitigating misinformation in social networks. Despite no listed awards, his prolific publication record (over 70 articles) reflects sustained academic impact. His research often addresses humanitarian challenges like disaster response and infrastructure protection. ARAS has advised numerous projects but no specific student names are provided in the text. His research teams likely focus on interdisciplinary collaboration between operations research, computer science, and civil engineering.
Assaf Libman is a Reader in the School of Natural and Computing Sciences at the University of Aberdeen. His research lies at the intersection of algebraic topology, homotopy theory, and group theory, with a focus on fusion systems, p-local compact groups, and their connections to representation theory. He also contributes to mathematical finance and argumentation theory, demonstrating interdisciplinary breadth. Research Interests: Homotopy Theory and its relations with Homological Algebra and Representation Theory The homotopy theory of fusion systems Applications to modular representation theory Mathematical finance and discrete market models Argumentation theory and logical semantics Recent publications reveal a sustained research output in both pure mathematics and applied domains. His work on fusion systems, boundedness of groups, and homotopy limits reflects deep theoretical engagement, while his papers on super-hedging, option pricing, and argumentation semantics show applied versatility. Trends indicate ongoing collaborations, particularly with Jarek Kędra and Nir Oren. Scientific Funding: Nuffield Foundation (2004) EPSRC (2006) – Project: "Combinatorial and Homotopy Theory of Classifying Spaces of Fusion Systems" Libman teaches undergraduate courses including Probability Theory (MA2505), Engineering Analysis and Methods (EG3006), and Understanding Data (ST1506). He has no listed advisees in the provided text. He maintains an active research profile with publications up to 2025.
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.
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.
Sam Tobin-Hochstadt is an Assistant Professor at the School of Informatics & Computing, Indiana University, with a focus on programming languages and systems. He is affiliated with the Department of Computer Science and actively contributes to the Racket and JavaScript language ecosystems. Research: Design and implementation of programming systems, particularly languages enabling software evolution (e.g., Racket, Typed Racket, JavaScript). Teaching: Courses like C211, P632, and honors sections of CS 2510. Collaborations: Mozilla Research, Sun Labs Programming Language Research Group. His research spans gradual typing , DSL implementation , compiler design , and parallel programming , with recent work on build systems and probabilistic programming. While specific scientific awards aren't listed, his contributions to PLDI, POPL, and other program committees highlight his field prominence. He mentors Ph.D. students at Indiana University and has organized academic events like IFL 2014. Personal interests include Ultimate and outdoor activities, alongside his wife Katie Edmonds' post-doc work in chemistry.
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.
Lin Chen is an Associate Professor in the Department of Computer Science and Technology at Nanjing University, China, specializing in software engineering and programming languages with applications to AI-integrated systems. His work bridges theoretical foundations and practical tools for software analysis, testing, and ecosystem studies. Education: Ph.D. in Computer Software and Theory, Southeast University (2009) B.S. in Computer Science and Technology, Southeast University (2001) Visiting Scholar at Purdue University (2015-2016) His research spans software testing, programming language design (particularly gradual typing), and AI-enhanced software engineering. Key contributions include empirical studies of Python's dynamic features, mutation testing frameworks for AI systems, and defect prediction models. He investigates how programming language semantics impact software quality and maintenance in open-source ecosystems. Recent publications (2023-2024) reveal strong trends in applying software engineering techniques to AI systems, analyzing Python's typing evolution, and developing practical testing tools. There is significant emphasis on empirical validation, with 60% of recent work focusing on Python ecosystem analysis and 30% on AI/software integration. Scientific Awards: FSE 2016 Distinguished Artifact Award First Prize of Hubei Science and Technology Award (2015) First Prize of Jiangsu Science and Technology Award (2012) First Prize of Jiangsu Science and Technology Award (2007) Professor Chen has advised 14+ graduate students including PhD candidates Hao Ren and Wanwangying Ma, and master's students like Fan Yang and Yuanlei Han. He actively recruits self-motivated PhD and undergraduate researchers for projects in software analysis, testing, and intelligent engineering. His group collaborates with industry partners on tool development for defect prediction and type system analysis. His research team at Nanjing University focuses on four pillars: (1) Software Analysis and Testing for dynamic languages, (2) Technical Debt and Refactoring in evolving systems, (3) AI-driven defect prediction, and (4) Gradual typing semantics for multilingual ecosystems. Current projects include large-model-based test generation and knowledge graph applications for QA system validation.
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.
