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

• Programming Languages
• Logic and Type Theory
• Logical Frameworks
• +۵ مورد دیگر

Frank Pfenning is a Professor in the Department of Computer Science at Carnegie Mellon University's School of Computer Science. With decades of active research and service in programming languages and logic communities, he maintains a significant presence across major conferences including POPL, ICFP, and ESOP. His research spans foundational work in Programming Languages , Logic and Type Theory , Logical Frameworks , Automated Deduction , and Trustworthy Computing . Recent publications reveal a strong focus on session types, substructural logics, and their applications to concurrency and distributed systems. His work bridges theoretical foundations with practical implementations for reliable communication protocols. Analysis of his publication trends shows a consistent evolution from foundational type theory toward practical applications in concurrent and distributed systems. The integration of logical frameworks with session types represents a signature research trajectory, increasingly addressing real-world challenges in protocol verification and deadlock freedom. As an active community member, Pfenning has served on numerous program committees including POPL (2016-2025), ICFP (2015-2022), and ESOP. His mentoring activities include PLMW@POPL presentations, demonstrating commitment to training next-generation researchers. His technical contributions are primarily disseminated through premier venues in programming languages research. The absence of explicit grant information in available sources suggests focus on theoretical contributions rather than large-scale funded projects, though his sustained conference participation indicates stable institutional support.

• Formal Logic
• Philosophy of Logic
• Metaphysics
• +۲ مورد دیگر

Prof Greg Restall is the Shelby Cullom Davis Professor of Philosophy at the University of St Andrews, affiliated with the School of Philosophy, Anthropology and Film Studies and the Department of Philosophy. Previously, he held positions at the Australian National University, Macquarie University, and the University of Melbourne, where he was Professor of Philosophy since 2013. His research focuses on formal logic, philosophy of logic, metaphysics, philosophy of language, and philosophy of religion. He has authored five books, including Logical Pluralism (with Jc Beall) and Proofs and Models in Philosophical Logic , and over 100 journal articles. His work has been funded by the Australian Research Council, and he is a Fellow of the Australian Academy of the Humanities. Restall’s research emphasizes logical pluralism and foundational questions in logic, semantics, and metaphysics. His recent publications explore topics like dialetheism in theology, proof theory, and the dialogical roots of deductive reasoning. He has supervised six PhD students, including Nathan Bray and Sophie Nagler. Beyond academia, his personal website consequently.org hosts extensive resources on his work.

Enrico Marchioniمشاهده پروفایل

مدرس

• Mathematical Logic
• Game Theory
• Reasoning under Uncertainty
• +۳ مورد دیگر

Dr. Enrico Marchioni is a Lecturer in the Agents, Interaction and Complexity research group at the University of Southampton. He holds a PhD in Mathematical Logic from the University of Salamanca (2006) and has held postdoctoral positions at institutions including the Spanish National Research Council (IIIA-CSIC) and Paul Sabatier University (France). His research focuses on formal models of strategic decision-making in multi-agent systems under uncertainty, integrating game theory, mathematical logic, and AI principles. He has taught courses such as Programming I, Theory of Computing, and Intelligent Agents. Current research interests include reasoning under uncertainty, game-theoretic models, and multi-agent systems. He supervises PhD students in Computer Science and has contributed to EPSRC-funded projects. His work spans theoretical frameworks for strategic interactions and formal methods in AI. Key research areas include mathematical logic, game theory, and reasoning under uncertainty, with applications in multi-agent systems and decision-making under incomplete information.

Karl Craryمشاهده پروفایل

دانشیار

• Programming Languages
• Security and Privacy
• Type Theory
• +۴ مورد دیگر

Karl Crary is an Associate Professor at the Computer Science Department of Carnegie Mellon University , where he also serves as Director of Doctoral Programs . His research focuses on Programming Languages , Security and Privacy , and Mechanized Metatheory , with emphasis on applying Type Theory to software verification and compiler design. Research Type Safety Proofs Certified Code Compiler Implementation His recent publications explore Substructural Parametricity , Hashgraph Consensus Verification , and Focused Logic applications. He has advised students including Derek Dreyer , Chris Martens , and Tom Murphy , with software projects like Istari proof assistant and CM-Lex/CM-Yacc for hygienic code generation. Current teaching includes Constructive Logic (15-317/657) and HOT Compilation (15-417).

• Type Theory
• Programming Language Semantics
• Formalization of Mathematics
• +۷ مورد دیگر

Niccolò Veltri is an Assistant Professor in the Department of Software Science at Tallinn University of Technology, Estonia. He is a member of the Logic and Semantics research group and co-organizes the Theory Seminar (TSEM). His primary research interests lie in Type Theory , Programming Language Semantics , Formalization of Mathematics , and Categorical Proof Theory . His work emphasizes rigorous formalization using proof assistants, particularly Agda, to develop and verify complex logical and computational systems. The recent publications highlight a consistent focus on foundational aspects of logic and computation. Key themes include the formalization and metatheory of substructural and non-commutative logics (e.g., Lambek calculus, skew monoidal categories), the use of focusing for proof normalization, the semantics of process calculi (CCS, π-calculus) in guarded and cubical type theories, and the constructive treatment of coinductive data and final semantics. The consistent use of Agda for formalization is a hallmark of his research output. No scientific awards were mentioned in the provided text. Niccolò Veltri advises several PhD students, including Michel Smykalla, Ioannis Andreou, Andrea Laretto, Michele De Pascalis, Philipp Joram, and Cheng-Syuan Wan, often in collaboration with Tarmo Uustalu and Fosco Loregian. There is no mention of specific grants in the provided text. He is a core member of the Logic and Semantics research group at the Institute of Computer Science, Tallinn University of Technology, which drives his collaborative research and the organization of the Theory Seminar (TSEM).

Jonathan Aldrichمشاهده پروفایل

استاد

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

Jonathan Aldrich is a Professor of Computer Science at Carnegie Mellon University in the School of Computer Science , jointly appointed in the Software and Societal Systems Department and the Computer Science Department . He is an internationally recognized expert in programming languages, software engineering, and verification, with a strong emphasis on human factors and usability in language design. Education: Ph.D. in Computer Science and Engineering, University of Washington (2003) B.S. in Computer Science, Caltech Research Interests: Prof. Aldrich's research lies at the intersection of programming languages and software engineering , focusing on how language design affects software quality and developer productivity. His work spans: Gradual verification and type systems Ownership and typestate checking Security and information flow control Usability of advanced type systems Domain-specific languages for blockchain and IoT Recent Work Trends: His recent publications emphasize gradual verification techniques, which allow developers to incrementally verify software correctness. He has also explored liquid types , information flow control , and usability barriers in advanced type systems. His work often combines formal methods with empirical studies to ensure practical impact. Awards & Recognition: NSF CAREER Award (2006) Dahl-Nygaard Junior Prize (2007) ICSE Most Influential Paper Award (2012) DARPA Computer Science Study Group Leadership & Service: Prof. Aldrich has held numerous leadership roles in the academic community, including: Director, CMU Software Engineering Ph.D. Program (2013–2019) General Chair, SPLASH 2015 Program Chair, OOPSLA 2017 Steering Committee Chair, SPLASH (2017–2019) Member, ACM Publications Board Industry Engagement: He is the Chief Technology Officer of Noteful , a startup he co-founded during his 2022 sabbatical, focused on music education through interactive apps.

Shay Loganمشاهده پروفایل

استاد

• Relevance Logic
• Logic and Philosophy of Logic
• Substructural Logic
• +۵ مورد دیگر

Shay Logan is a Professor in the Department of Philosophy at Kansas State University, specializing in logic and philosophy of mathematics. He received his PhD in Philosophy from the University of Minnesota in 2015, along with an MS in Mathematics from the same institution. His academic profile demonstrates significant contributions to the field of nonclassical logics, particularly relevance logic and its variants. Logan's educational background includes: PhD in Philosophy, University of Minnesota (2015) MS in Mathematics, University of Minnesota (2013) MA in Philosophy, University of Minnesota (2013) BS in Mathematics, Gonzaga University (2008) BA in Philosophy, Gonzaga University (2008) His research interests center on relevance logic, substructural logic, paraconsistent logic, nonclassical logics, and category theory. Logan approaches these areas with both technical rigor and philosophical depth, exploring foundational questions about logical systems and their applications. His work often bridges mathematical logic with philosophical inquiry, examining how different logical frameworks handle concepts like implication, negation, and subject-matter. Logan's recent publications show a clear trajectory toward increasingly sophisticated analyses of relevance logics, with particular attention to variable sharing properties, topic transparency, and computational semantics. His research demonstrates a commitment to clarifying misunderstood aspects of relevance logics while developing novel formal frameworks for understanding their structure and applications. The 2024 publication of his book Relevance Logic represents a significant contribution to making this complex field more accessible. As an educator, Logan teaches broadly across the analytic philosophy spectrum, including ethics, applied ethics, epistemology, metaphysics, and logic. He describes this diversity as intentional, reflecting his genuine interest in multiple philosophical domains, though he acknowledges being consistently drawn back to logical questions for his research. Logan maintains active scholarly engagement through conference presentations, including recent appearances at the Abstractionism 2 conference at the University of Connecticut (2023) and the Workshop On Philosophical Logic of the Buenos Aires Logic Group (2020). His professional activities reflect a commitment to advancing both the technical and philosophical dimensions of logical inquiry.

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

استاد

• Logic
• Theoretical Computer Science
• Formal Methods
• +۴ مورد دیگر

Thomas Studer is a Professor of Computer Science at the University of Bern, leading the Logic and Theory Group. He holds a PhD in Computer Science from the University of Bern (2001) and has worked as a senior software engineer before returning to academia. His research focuses on mathematical logic, formal methods, blockchain technology, and data privacy. He serves on the board of the Swiss Society for Logic and Philosophy of Science and chairs the computer science committee for the Matura exam in Canton Bern. Research interests include justification logic, modal logics, proof theory, and applications in blockchain and secure systems. Recent work explores synergistic knowledge in distributed systems, conversational explanation frameworks, and probabilistic justification logics. He co-authored books on relational databases and logics of proofs. Leadership roles include the Executive Committee of SCNAT’s Platform MAP (2016–2024). He advises on technical and ethical challenges in AI and cryptography, contributing to international conferences and editorial boards.

• Formal Verification
• Programming Language Theory
• Category Theory
• +۴ مورد دیگر

Pedro Azevedo de Amorim is a Researcher (Research Associate) in the Department of Computer Science at the University of Oxford. He holds a PhD from Cornell University (Computer Science Department), where he worked under Dexter Kozen. His research focuses on formal verification, programming language theory, and their intersections with category theory, type theory, proof assistants, and logic. He explores applications to probabilistic programming semantics and substructural logics. Key research areas include semantics of probabilistic programming languages, categorical probability, and denotational semantics. His work spans foundational aspects of programming languages, including logical relations, effect systems, and modular hardware design. Notable collaborations include projects like BLAST (Employing Categorical Probability Towards Safe AI). Pedro has published influential papers at top venues such as LICS, PLDI, and OOPSLA. His recent work addresses expected cost analysis, timeline types for hardware design, and dependent type systems for parser verification. He has taught as a Teaching Assistant in courses ranging from compilers to category theory at Cornell University. Current affiliations include the Wolfson Building (Room 309) at Oxford, with active involvement in projects linking category theory to practical programming language challenges. His research emphasizes bridging theoretical foundations with applied systems for safer AI and verified software.

Karl Magnus Heuerمشاهده پروفایل

دانشیار

• Graph Theory
• Directed Graph Theory
• Infinite Graph Theory
• +۱۴ مورد دیگر

Karl Magnus Heuer is an Associate Professor in Discrete Mathematics at the Department of Applied Mathematics and Computer Science (DTU Compute), Technical University of Denmark (DTU), where he is a member of the AlgoLoG (Algorithms, Logic and Graphs) section. He obtained his Habilitation in Mathematics from the University of Hamburg in 2023 and his Dr. rer. nat. (PhD) in Mathematics under Prof. Dr. Reinhard Diestel at the same university in 2018. His research lies primarily in Graph Theory, with a strong focus on Directed and Infinite Graphs. Key interests include structural properties of directed graphs, connectivity, unavoidable substructures, directed cycles and cuts, feedback arc sets, dijoins (in relation to Woodall’s Conjecture), packing and covering problems, and the analysis of width parameters and duality theorems. He also investigates topological aspects of infinite graphs, such as the existence of Hamilton cycles, tangles, and the structure of infinite cycle and cut spaces. His work extends into Matroid Theory, particularly the Even Dicircuit Problem in Oriented Matroids, and he is interested in applications to Logic and Data Science. Karl Heuer has held postdoctoral positions at the University of Hamburg, the Technical University of Berlin (on the ERC project DISTRUCT under Prof. Dr. Kreutzer), and a DAAD-funded research fellowship at DTU. He served as an assistant professor (tenure track) at DTU from May 2022 to February 2025 before being promoted to associate professor. He is also interested in Mathematical Education. No scientific awards or publications were listed in the provided text. He has advised no students listed in the text and no information on grants or research teams is available. His research is theoretical and deeply mathematical, contributing to foundational aspects of discrete mathematics.

Guillermo Badiaمشاهده پروفایل

مدرس ارشد

• Mathematical Logic
• Many-Valued Logics
• Substructural Logics
• +۱۱ مورد دیگر

Dr. Guillermo Badia is a Senior Lecturer in Logic at the School of Historical and Philosophical Inquiry , University of Queensland, Australia. His research spans mathematical and philosophical logic, with a focus on many-valued, substructural, and computational logics. From 2022–2025, he held the Discovery Early Career Researcher Award (DE220100544, 383,975 AUD) from the Australian Research Council. Editorial Board: Archive for Mathematical Logic and Journal of Multiple-Valued Logic and Soft Computing Academic Genealogy: Descendant of G. H. Hardy via R. Rado, K. Gravett, John N. Crossley, John L. Bell, G. Priest, Z. Weber Research Areas include: Many-valued predicate logics and residuated lattices Hybrid, modal, and weighted logic Bi-intuitionistic and relevant logic Graded model theory and non-classical metatheory Applications in computer science and database theory Scientific Contributions highlight trends in: Real-valued first-order logics and hybrid-dynamic games Frame definability and asymptotic truth-value laws Weighted complexity class characterizations Substructural consequence relations Awards : Discovery Early Career Researcher Award (DE220100544) from Australian Research Council

Ryan Doengesمشاهده پروفایل

پژوهشگر ارشد

• verification
• networking
• distributed systems
• +۵ مورد دیگر

Ryan Doenges is a Distinguished Postdoctoral Fellow at Northeastern University working with Amal Ahmed. Previously, he completed his PhD at Cornell University under Nate Foster and was an undergraduate student with Zach Tatlock. His research focuses on making risky programming domains safer through types and formal verification techniques. Dr. Doenges' research interests include: Verification of programming languages and systems Networking and distributed systems Type systems and program logics for resource management P4 network programming language Memory safety and interoperation between memory managers Categorical semantics for program logics His publication record shows a clear trajectory from foundational work on P4 network programming (POPL 2021) through advanced verification frameworks (PLDI 2022, CPP 2023) to his current focus on categorical semantics for weakest preconditions (HOPE 2025). A consistent thread throughout his work is the application of rigorous formal methods to practical networking and systems problems, with increasing sophistication in the logical frameworks employed. Scientific recognition: Distinguished Postdoctoral Fellowship at Northeastern University Dr. Doenges has mentored multiple students including Tia Vu (supervised her Cornell MS thesis, now at MIT PhD), Rudy Peterson (Cornell BA to ETH Zürich PhD), and Amanda Xu (Cornell BS to UW Madison PhD). He has taught as a TA-Instructor for CS 3110 at Northeastern and leads undergraduate reading groups on PL and verification topics. His service includes program committee work for ESOP, LICS, and CPP conferences, plus community building through co-organizing LGBTea (2021-2023) and the Grad Seminar (2018-2019).

Ellie Ripleyمشاهده پروفایل

مدرس ارشد

• Logic
• Paradox
• Truth
• +۲ مورد دیگر

Dr. Ellie Ripley is a Senior Lecturer in the Department of Philosophy at Monash University. Her research focuses on formal logic, paradoxes, and semantic theory. She is the primary investigator of the ARC-funded project 'Substructural logics for limited resources' (2020–2024), exploring logics applicable to resource-bounded systems. Her work contributes to UN Sustainable Development Goals through foundational research in logical systems. She has published extensively in journals like the Bulletin of the Section of Logic and Journal of Philosophical Logic , with a focus on non-classical logics and semantic paradoxes. Recent research includes studies on counterpossibles, type theory, and truth-theoretic frameworks. Her email is ellie.ripley@monash.edu .

• Program Verification
• Programming Language Design
• Logic
• +۶ مورد دیگر

Neelakantan R. Krishnaswami is a Professor of Computer Science at the University of Cambridge, affiliated with the Computer Laboratory and a Fellow of Trinity College . His research focuses on program verification, programming language design, and the intersection of logic, semantics, and type theory. PhD in Computer Science from Carnegie Mellon University (2011) His work addresses foundational challenges in programming languages, including refinement type systems with explicit proofs, deterministic parsing with fused lexing, and verification of systems code using separation logic. He has also contributed to bidirectional typechecking, higher-order reactive programming, and logical models for concurrency. Recent publications highlight trends in refinement types with explicit proof terms, parser combinator optimization, and formal verification of C and WebAssembly code. These works span type theory, denotational semantics, and practical compiler design. Distinguished Paper Award, POPL 2020 Distinguished Paper Award, PLDI 2019 He has collaborated extensively on projects involving functional reactive programming, logical relations, and substructural type systems. His contributions include the design of the flap parser library and the Datafun language, which extends Datalog with higher-order features.

Colin Caretمشاهده پروفایل

استادیار

• Logic
• Epistemology
• Philosophy of Science
• +۵ مورد دیگر

Dr. Colin Caret is an Assistant Professor in the Department of Philosophy and Religious Studies at Utrecht University, specializing in Theoretical Philosophy. His research focuses on logical pluralism, epistemic closure, and the intersection of philosophical logic with cognitive science. He contributes to the Human-Centered AI program and teaches courses such as Logical Methods for AI . Previously, he held positions at Yonsei University (South Korea) and the Arché Research Centre at the University of St Andrews (Scotland). Dr. Caret actively organizes interdisciplinary events like the TULIPS logic seminar and collaborates with the Utrecht Neurosymbolic AI special interest group. His expertise spans Logic, Epistemology, and Philosophy of Science, with additional interests in pre-Qin Daoism and early Buddhist philosophy. He supervises courses in Artificial Intelligence (BSc/MSc), Philosophy (BA/RMA), and the History and Philosophy of Science (MSc). Research highlights include work on non-classical logics, paradox solutions, and bounded rational belief. His publications address foundational questions in logical consequence and semantic frameworks.