Parametric Polymorphism Professors and Supervisors

Thomas Helmuthمشاهده پروفایل

دانشیار

Hamilton CollegeUnited States

Thomas Helmuth is an Associate Professor of Computer Science at Hamilton College. His research focuses on genetic programming, a subfield of AI that evolves computer programs using biological evolution principles. He has contributed to program representation, parent selection methods, and benchmark development for program synthesis. Helmuth holds a B.A. from Hamilton College and advanced degrees from the University of Massachusetts Amherst. Before joining Hamilton, he taught at Washington and Lee University. Education: B.A. in Computer Science & Mathematics, Hamilton College M.S. and Ph.D. in Computer Science, University of Massachusetts Amherst Research interests emphasize genetic programming's application in automatic program synthesis, with specific attention to lexicase selection, down-sampling techniques, and evolutionary algorithm optimization. His work bridges theoretical advancements with practical benchmarking frameworks like PSB2. Publications span topics such as lexicase selection dynamics, computational efficiency improvements, and code generation innovations. His recent work explores informed down-sampling strategies and human-driven genetic programming systems. Teaching includes courses on programming languages and artificial intelligence. His research has been presented at venues like GECCO and PPSN conferences, focusing on evolutionary computation advancements.

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

Ross Patersonمشاهده پروفایل

مدرس

City, University of LondonUnited Kingdom

Dr. Ross Paterson is a Lecturer at City St George's, University of London, where he has been employed since 1998. He is a member of the Research Centre for Machine Learning and specializes in programming languages and functional programming. His research interests focus on functional programming techniques, embedded domain-specific languages, program transformations, and persistent data structures. His work bridges theoretical computer science with practical applications in programming language design and implementation. Dr. Paterson's publication record spans over three decades, with significant contributions to functional programming, type theory, and data structures. His most influential work includes the development of arrows as a general interface to computation, applicative functors, and finger trees as a general-purpose data structure. His research shows consistent focus on theoretical foundations with practical implementations in functional programming languages. Throughout his career, Dr. Paterson has maintained strong academic connections, having previously worked at the University of North London (1996-1998), Imperial College London (1990-1995), and the University of Queensland (1988-1989).

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

James McKinnaمشاهده پروفایل

دانشیار

Heriot-Watt UniversityUnited Kingdom

James McKinna is an Associate Professor in the School of Mathematical & Computer Sciences at Heriot-Watt University. His research focuses on foundational aspects of programming languages, type theory, and formal methods. He has contributed extensively to areas such as syntax with bindings, type systems, and formal verification. His work often explores the interplay between theoretical computer science and practical programming language implementations. Key research interests include: Type Theory & Dependent Types Syntax & Binding Mechanisms Formal Semantics of Programming Languages Automated Reasoning & Proof Systems Functional Programming & Compiler Design Recent research trends show a focus on advancing foundational techniques for syntax manipulation, type-safe programming constructs, and bidirectional transformations. His publications span topics like blame tracking in hybrid types, structural subtyping, and coalgebraic approaches to bidirectional systems. While not explicitly listed, his work demonstrates engagement with grant-funded research through collaborative projects and international publications. No specific grants or awards are mentioned in the provided texts.

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

Ronald Garciaمشاهده پروفایل

دانشیار

University of British ColumbiaCanada

Ronald Garcia is an Associate Professor in the Department of Computer Science at the University of British Columbia, affiliated with the Faculty of Science and the Software Practices Lab. His research focuses on programming language theory, emphasizing gradual typing, type systems, and end-user programming. He teaches courses such as Programming Language Principles (CPSC 509) and Compiler Construction (CPSC 411). Education details are not explicitly stated in the provided texts, but his extensive academic contributions span over two decades. Research interests include formal semantics of programming languages, typestate systems, dependent types, and improving software practices for end-users. He has advised numerous Ph.D. and Master's students, contributing to over 30 academic publications. Recent work explores hybrid programming environments for end-users, runtime type slicing for debugging, and foundational frameworks for gradual dependent types. Garcia actively participates in academic conferences as a PC member and keynote speaker, notably in PLDI, POPL, and ICFP. His lab and collaborations focus on advancing theoretical foundations while addressing practical challenges in software development and education.

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

Thomas Hoferمشاهده پروفایل

دانشیار

University of InnsbruckAustria

Thomas Hofer is an Associate Professor in the Department of General, Inorganic and Theoretical Chemistry at the University of Innsbruck, affiliated with the Faculty of Chemistry and Pharmacy. He leads the Hofer Lab, focusing on theoretical and computational chemistry, materials science, and molecular dynamics simulations. His academic journey includes a Habilitation in Theoretical and Computational Chemistry (2011), a Doctorate (2006), and earlier roles as an Assistant Professor (2008-2011) and Erwin Schrödinger Fellow (2008-2010). Research Interests: Hofer specializes in quantum mechanical methods, molecular dynamics, and computational modeling of materials, with applications in energy storage, catalysis, and environmental chemistry. His work bridges theoretical approaches with experimental validation, addressing challenges in nanostructured materials and reactive systems. Awards: He has received prestigious honors such as the Young Scientist Excellence Award (2006), Georg und Christine Sosnovsky Award (2007), and IUPAC Award (2012). His teaching spans advanced courses in simulation methods, computer-based materials science, and data-driven discovery for PhD students. Labs/Teams: The Hofer Lab collaborates with other groups (e.g., Liedl Lab) and contributes to facilities like the Center for Chemistry and Biomedicine. His research impacts areas like battery materials, environmental pollutant interactions, and renewable energy systems.

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

William J. Bowmanمشاهده پروفایل

استادیار

IMDEA Software InstituteSpain

William J. Bowman is an Assistant Professor in the Department of Computer Science at the University of British Columbia. He focuses on secure and verified compilation, dependently typed programming, and meta-programming systems. His work bridges high-level language design with low-level code generation to maintain correctness and security invariants throughout compilation. Education: PhD in Computer Science from Northeastern University Research spans type-preserving compilation, including: Typed closure conversion for dependently typed languages Allocation-aware type universes Hybrid embedding techniques Secure interoperability via multi-language semantics Recent publications examine: Heap allocation modeling through type universes Flat closure representations WebAssembly extensions with indexed types Control-effect semantics

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

Guilhem Jaberمشاهده پروفایل

دانشیار

IMDEA Software InstituteSpain

Guilhem Jaber is an Associate Professor at University of Nantes , affiliated with the Gallinette team in the LS2N research laboratory . His work focuses on operational game semantics, contextual equivalence, and formal verification of higher-order programs with computational effects. Research Grants RECIPROG (2021-2025): ANR PRC Project, local coordinator CAVOC (2021-2025): Inria-Nomadic Labs agreement, project investigator CANofGAS (2022-2025): Inria Exploratory Action, co-investigator Scientific Awards Distinguished Paper Award at ICFP'21 Supervision Axel Kerinec: Postdoc on CANofGAS project Hamza Jaafar: PhD on CAVOC project Peio Borthelle: PhD co-advised with Beniamino Accattoli His research bridges game semantics with operational techniques, particularly for algebraic effects, parametric polymorphism, and separation logic. He actively participates in program committees for POPL, GALOP, and HOPE workshops.

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

Jeremy G. Siekمشاهده پروفایل

استاد

IMDEA Software InstituteSpain

Jeremy G. Siek is a Professor at Indiana University Bloomington in the School of Informatics and Computing. His research spans programming language design, type systems, gradual typing, mechanized theorem proving, and optimizing compilers. Gradual typing integration in functional languages Co-inventor of the Boost Graph Library Former NSF CAREER award recipient Active in programming language foundations research Jeremy's research focuses on reconciling static and dynamic type checking through gradual typing, with current work on parametricity in polymorphic blame calculus, combining gradual typing with dependent types, and formal criteria for gradual type systems. He investigates high-performance implementations of gradual typing and its application to security enforcement. His recent publications examine verified nanopass compilers, gradual security guarantees, and parameterized cast calculi. He has received multiple distinguished visiting fellowships and maintains the Deduce proof assistant for educational use. NSF CAREER Award (2009) Distinguished Visiting Fellowships (2010, 2015) Jeremy leads the Center for Programming Systems at IU and advises Ph.D. students Tianyu Chen (gradual security) and Darshal Shetty (gradual dependent types). He teaches courses in compilers, data structures, and programming language foundations.

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