Inverting Inductively Defined Relations in LEGO. - Conor McBride (TYPES, 1996)

Elimination with a Motive. - Conor McBride (TYPES, 2000)

Dependently typed functional programs and their proofs. - Conor McBride (2000)

Generic Programming within Dependently Typed Programming. - Thorsten Altenkirch; Conor McBride (Generic Programming, 2002)

Faking it: Simulating dependent types in Haskell. - Conor McBride (J. Funct. Program., 2002)

Derivatives of Containers. - Michael Gordon Abbott; Thorsten Altenkirch; Neil Ghani; Conor McBride (TLCA, 2003)

Inductive Families Need Not Store Their Indices. - Edwin C. Brady; Conor McBride; James McKinna (TYPES, 2003)

First-order unification by structural recursion. - Conor McBride (J. Funct. Program., 2003)

Epigram: Practical Programming with Dependent Types. - Conor McBride (Advanced Functional Programming, 2004)

Functional pearl: i am not a number-i am a free variable. - Conor McBride; James McKinna (Haskell, 2004)

Constructing Polymorphic Programs with Quotient Types. - Michael Gordon Abbott; Thorsten Altenkirch; Neil Ghani; Conor McBride (MPC, 2004)

A Few Constructions on Constructors. - Conor McBride; Healfdene Goguen; James McKinna (TYPES, 2004)

Exploring the Regular Tree Types. - Peter Morris; Thorsten Altenkirch; Conor McBride (TYPES, 2004)

The view from the left. - Conor McBride; James McKinna (J. Funct. Program., 2004)

Epigram reloaded: a standalone typechecker for ETT. - James Chapman 001; Thorsten Altenkirch; Conor McBride (Trends in Functional Programming, 2005)

for Data: Differentiating Data Structures. - Michael Gordon Abbott; Thorsten Altenkirch; Conor McBride; Neil Ghani (Fundam. Informaticae, 2005)

Eliminating Dependent Pattern Matching. - Healfdene Goguen; Conor McBride; James McKinna (Essays Dedicated to Joseph A. Goguen, 2006)

Generic Programming with Dependent Types. - Thorsten Altenkirch; Conor McBride; Peter Morris (SSDGP, 2006)

Lego. - Conor McBride (The Seventeen Provers of the World, 2006)

Observational equality, now! - Thorsten Altenkirch; Conor McBride; Wouter Swierstra (PLPV, 2007)

What's the deal with dependent types? - Conor McBride (TLDI, 2007)

Proving Properties about Lists Using Containers. - Rawle C. S. Prince; Neil Ghani; Conor McBride (FLOPS, 2008)

Clowns to the left of me, jokers to the right (pearl): dissecting data structures. - Conor McBride (POPL, 2008)

Preface. - Venanzio Capretta; Conor McBride (MSFP@ICALP, 2008)

Applicative programming with effects. - Conor McBride; Ross Paterson (J. Funct. Program., 2008)

Let's See How Things Unfold: Reconciling the Infinite with the Intensional (Extended Abstract). - Conor McBride (CALCO, 2009)

Preface. - Conor McBride; Tarmo Uustalu (J. Funct. Program., 2009)

The gentle art of levitation. - James Chapman 001; Pierre-Évariste Dagand; Conor McBride; Peter Morris (ICFP, 2010)

Type Inference in Context. - Adam Gundry; Conor McBride; James McKinna (MSFP@ICFP, 2010)

Outrageous but meaningful coincidences: dependent type-safe syntax and evaluation. - Conor McBride (ICFP-WGP, 2010)

Djinn, Monotonic. - Conor McBride (PAR@ITP, 2010)

A Tutorial Implementation of a Dependently Typed Lambda Calculus. - Andres Löh; Conor McBride; Wouter Swierstra (Fundam. Informaticae, 2010)

Dependently Typed Programming (NII Shonan Meeting 2011-3). - Shin-Cheng Mu; Conor McBride; Stephanie Weirich (NII Shonan Meet. Rep., 2011)

Agda-curious?: an exploration of programming with dependent types. - Conor Thomas McBride (ICFP, 2012)

Elaborating Inductive Definitions - Pierre-Évariste Dagand; Conor McBride (CoRR, 2012)

Strongly Typed Term Representations in Coq. - Nick Benton; Chung-Kil Hur; Andrew Kennedy; Conor McBride (J. Autom. Reason., 2012)

Hasochism: the pleasure and pain of dependently typed haskell programming. - Sam Lindley; Conor McBride (Haskell, 2013)

New equations for neutral terms: a sound and complete decision procedure, formalized. - Guillaume Allais; Conor McBride; Pierre Boutillier (DTP@ICFP, 2013)

Productive coprogramming with guarded recursion. - Robert Atkey; Conor McBride (ICFP, 2013)

A Categorical Treatment of Ornaments. - Pierre-Évariste Dagand; Conor McBride (LICS, 2013)

Small Induction Recursion. - Peter G. Hancock; Conor McBride; Neil Ghani; Lorenzo Malatesta; Thorsten Altenkirch (TLCA, 2013)

How to keep your neighbours in order. - Conor Thomas McBride (ICFP, 2014)

Transporting functions across ornaments. - Pierre-Évariste Dagand; Conor McBride (J. Funct. Program., 2014)

Turing-Completeness Totally Free. - Conor McBride (MPC, 2015)

Indexed containers. - Thorsten Altenkirch; Neil Ghani; Peter G. Hancock; Conor McBride; Peter Morris (J. Funct. Program., 2015)

I Got Plenty o' Nuttin'. - Conor McBride (A List of Successes That Can Change the World, 2016)

Selected papers from Dependently Typed Programming 2010 - Overview. - Thorsten Altenkirch; Conor McBride (Math. Struct. Comput. Sci., 2016)

Type-and-scope safe programs and their proofs. - Guillaume Allais; James Chapman 001; Conor McBride; James McKinna (CPP, 2017)

Variations on Inductive-Recursive Definitions. - Neil Ghani; Conor McBride; Fredrik Nordvall Forsberg; Stephan Spahn (MFCS, 2017)

Do be do be do. - Sam Lindley; Conor McBride; Craig McLaughlin (POPL, 2017)

Everybody's Got To Be Somewhere. - Conor McBride (MSFP@FSCD, 2018)

A type and scope safe universe of syntaxes with binding: their semantics and proofs. - Guillaume Allais; Robert Atkey; James Chapman 001; Conor McBride; James McKinna (Proc. ACM Program. Lang., 2018)

Doo bee doo bee doo. - Lukas Convent; Sam Lindley; Conor McBride; Craig McLaughlin (J. Funct. Program., 2020)