Conor McBride

Orcid: 0000-0003-1487-0886

Affiliations:
  • University of Strathclyde, Glasgow, UK


According to our database1, Conor McBride authored at least 53 papers between 1996 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Doo bee doo bee doo.
J. Funct. Program., 2020

2018
A type and scope safe universe of syntaxes with binding: their semantics and proofs.
Proc. ACM Program. Lang., 2018

Everybody's Got To Be Somewhere.
Proceedings of the 7th Workshop on Mathematically Structured Functional Programming, 2018

2017
Do be do be do.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

Variations on Inductive-Recursive Definitions.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Type-and-scope safe programs and their proofs.
Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, 2017

2016
Selected papers from Dependently Typed Programming 2010 - Overview.
Math. Struct. Comput. Sci., 2016

I Got Plenty o' Nuttin'.
Proceedings of the A List of Successes That Can Change the World, 2016

2015
Indexed containers.
J. Funct. Program., 2015

Turing-Completeness Totally Free.
Proceedings of the Mathematics of Program Construction - 12th International Conference, 2015

2014
Transporting functions across ornaments.
J. Funct. Program., 2014

How to keep your neighbours in order.
Proceedings of the 19th ACM SIGPLAN international conference on Functional programming, 2014

2013
Small Induction Recursion.
Proceedings of the Typed Lambda Calculi and Applications, 11th International Conference, 2013

A Categorical Treatment of Ornaments.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Productive coprogramming with guarded recursion.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2013

New equations for neutral terms: a sound and complete decision procedure, formalized.
Proceedings of the 2013 ACM SIGPLAN workshop on Dependently-typed programming, 2013

Hasochism: the pleasure and pain of dependently typed haskell programming.
Proceedings of the 2013 ACM SIGPLAN Symposium on Haskell, 2013

2012
Strongly Typed Term Representations in Coq.
J. Autom. Reason., 2012

Elaborating Inductive Definitions
CoRR, 2012

Agda-curious?: an exploration of programming with dependent types.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2012

2011
Dependently Typed Programming (NII Shonan Meeting 2011-3).
NII Shonan Meet. Rep., 2011

2010
A Tutorial Implementation of a Dependently Typed Lambda Calculus.
Fundam. Informaticae, 2010

Djinn, Monotonic.
Proceedings of the Partiality and Recursion in Interactive Theorem Provers, 2010

Outrageous but meaningful coincidences: dependent type-safe syntax and evaluation.
Proceedings of the ACM SIGPLAN Workshop on Generic Programming, 2010

Type Inference in Context.
Proceedings of the 3rd ACM SIGPLAN Workshop on Mathematically Structured Functional Programming, 2010

The gentle art of levitation.
Proceedings of the Proceeding of the 15th ACM SIGPLAN international conference on Functional programming, 2010

2009
Preface.
J. Funct. Program., 2009

Let's See How Things Unfold: Reconciling the Infinite with the Intensional (Extended Abstract).
Proceedings of the Algebra and Coalgebra in Computer Science, 2009

2008
Applicative programming with effects.
J. Funct. Program., 2008

Preface.
Proceedings of the Second Workshop on Mathematically Structured Functional Programming, 2008

Clowns to the left of me, jokers to the right (pearl): dissecting data structures.
Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2008

Proving Properties about Lists Using Containers.
Proceedings of the Functional and Logic Programming, 9th International Symposium, 2008

2007
What's the deal with dependent types?
Proceedings of TLDI'07: 2007 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation, 2007

Observational equality, now!
Proceedings of the ACM Workshop Programming Languages meets Program Verification, 2007

2006
Proceedings of the Seventeen Provers of the World, Foreword by Dana S. Scott, 2006

Generic Programming with Dependent Types.
Proceedings of the Datatype-Generic Programming - International Spring School, 2006

Eliminating Dependent Pattern Matching.
Proceedings of the Algebra, Meaning, and Computation, 2006

2005
for Data: Differentiating Data Structures.
Fundam. Informaticae, 2005

Epigram reloaded: a standalone typechecker for ETT.
Proceedings of the Revised Selected Papers from the Sixth Symposium on Trends in Functional Programming, 2005

2004
The view from the left.
J. Funct. Program., 2004

Exploring the Regular Tree Types.
Proceedings of the Types for Proofs and Programs, International Workshop, 2004

A Few Constructions on Constructors.
Proceedings of the Types for Proofs and Programs, International Workshop, 2004

Constructing Polymorphic Programs with Quotient Types.
Proceedings of the Mathematics of Program Construction, 7th International Conference, 2004

Functional pearl: i am not a number-i am a free variable.
Proceedings of the ACM SIGPLAN Workshop on Haskell, 2004

Epigram: Practical Programming with Dependent Types.
Proceedings of the Advanced Functional Programming, 2004

2003
First-order unification by structural recursion.
J. Funct. Program., 2003

Inductive Families Need Not Store Their Indices.
Proceedings of the Types for Proofs and Programs, International Workshop, 2003

Derivatives of Containers.
Proceedings of the Typed Lambda Calculi and Applications, 6th International Conference, 2003

2002
Faking it: Simulating dependent types in Haskell.
J. Funct. Program., 2002

Generic Programming within Dependently Typed Programming.
Proceedings of the Generic Programming, 2002

2000
Dependently typed functional programs and their proofs.
PhD thesis, 2000

Elimination with a Motive.
Proceedings of the Types for Proofs and Programs, International Workshop, 2000

1996
Inverting Inductively Defined Relations in LEGO.
Proceedings of the Types for Proofs and Programs, 1996


  Loading...