Conor McBride

Available identifiers

zbMath Open mcbride.conor-thomasWikidataQ5162250 ScholiaQ5162250MaRDI QIDQ2392479

List of research outcomes

Publication	Date of Publication	Type
A type- and scope-safe universe of syntaxes with binding: their semantics and proofs	2021-12-27	Paper
https://portal.mardi4nfdi.de/entity/Q3384910	2021-12-17	Paper
Variations on inductive-recursive definitions	2020-05-26	Paper
Doo bee doo bee doo	2020-05-26	Paper
Indexed containers	2017-10-23	Paper
Do be do be do	2017-10-20	Paper
A Categorical Treatment of Ornaments	2017-07-03	Paper
How to keep your neighbours in order	2016-09-29	Paper
I Got Plenty o’ Nuttin’	2016-08-17	Paper
Turing-Completeness Totally Free	2015-08-27	Paper
Productive coprogramming with guarded recursion	2015-03-30	Paper
The gentle art of levitation	2015-03-05	Paper
Clowns to the left of me, jokers to the right (pearl)	2014-09-12	Paper
Transporting functions across ornaments	2014-08-14	Paper
Transporting functions across ornaments	2014-07-21	Paper
Strongly typed term representations in Coq	2013-08-01	Paper
Small Induction Recursion	2013-06-28	Paper
Let’s See How Things Unfold: Reconciling the Infinite with the Intensional (Extended Abstract)	2012-06-01	Paper
A Tutorial Implementation of a Dependently Typed Lambda Calculus	2011-05-20	Paper
Proving Properties about Lists Using Containers	2008-04-11	Paper
Applicative programming with effects	2008-01-18	Paper
Eliminating Dependent Pattern Matching	2007-09-07	Paper
Types for Proofs and Programs	2006-11-13	Paper
Types for Proofs and Programs	2006-11-13	Paper
Advanced Functional Programming	2006-10-25	Paper
Types for Proofs and Programs	2005-12-23	Paper
First-order unification by structural recursion	2005-02-08	Paper
The view from the left	2004-09-27	Paper
https://portal.mardi4nfdi.de/entity/Q4816996	2004-09-14	Paper
https://portal.mardi4nfdi.de/entity/Q4736399	2004-08-09	Paper
Faking it Simulating dependent types in Haskell	2002-01-01	Paper

Research outcomes over time

This page was built for person: Conor McBride