Conor McBride

From MaRDI portal
Person:2392479

Available identifiers

zbMath Open mcbride.conor-thomasWikidataQ5162250 ScholiaQ5162250MaRDI QIDQ2392479

List of research outcomes





PublicationDate of PublicationType
A type- and scope-safe universe of syntaxes with binding: their semantics and proofs2021-12-27Paper
https://portal.mardi4nfdi.de/entity/Q33849102021-12-17Paper
Variations on inductive-recursive definitions2020-05-26Paper
Doo bee doo bee doo2020-05-26Paper
Indexed containers2017-10-23Paper
Do be do be do2017-10-20Paper
A Categorical Treatment of Ornaments2017-07-03Paper
How to keep your neighbours in order2016-09-29Paper
I Got Plenty o’ Nuttin’2016-08-17Paper
Turing-Completeness Totally Free2015-08-27Paper
Productive coprogramming with guarded recursion2015-03-30Paper
The gentle art of levitation2015-03-05Paper
Clowns to the left of me, jokers to the right (pearl)2014-09-12Paper
Transporting functions across ornaments2014-08-14Paper
Transporting functions across ornaments2014-07-21Paper
Strongly typed term representations in Coq2013-08-01Paper
Small Induction Recursion2013-06-28Paper
Let’s See How Things Unfold: Reconciling the Infinite with the Intensional (Extended Abstract)2012-06-01Paper
A Tutorial Implementation of a Dependently Typed Lambda Calculus2011-05-20Paper
Proving Properties about Lists Using Containers2008-04-11Paper
Applicative programming with effects2008-01-18Paper
Eliminating Dependent Pattern Matching2007-09-07Paper
Types for Proofs and Programs2006-11-13Paper
Types for Proofs and Programs2006-11-13Paper
Advanced Functional Programming2006-10-25Paper
Types for Proofs and Programs2005-12-23Paper
First-order unification by structural recursion2005-02-08Paper
The view from the left2004-09-27Paper
https://portal.mardi4nfdi.de/entity/Q48169962004-09-14Paper
https://portal.mardi4nfdi.de/entity/Q47363992004-08-09Paper
Faking it Simulating dependent types in Haskell2002-01-01Paper

Research outcomes over time

This page was built for person: Conor McBride