Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Conor McBride
2010 – today
- 2013
[i4]Guillaume Allais, Pierre Boutillier, Conor McBride: New Equations for Neutral Terms: A Sound and Complete Decision Procedure, Formalized. CoRR abs/1304.0809 (2013)- 2012
- [j9]Nick Benton, Chung-Kil Hur, Andrew Kennedy, Conor McBride: Strongly Typed Term Representations in Coq. J. Autom. Reasoning 49(2): 141-159 (2012)
- [c22]
- [i3]Pierre-Évariste Dagand, Conor McBride: Transporting Functions across Ornaments. CoRR abs/1201.4801 (2012)
- [i2]
- [i1]Pierre-Évariste Dagand, Conor McBride: A Categorical Treatment of Ornaments. CoRR abs/1212.3806 (2012)
- 2011
- [j8]
- 2010
- [j7]Andres Löh, Conor McBride, Wouter Swierstra: A Tutorial Implementation of a Dependently Typed Lambda Calculus. Fundam. Inform. 102(2): 177-207 (2010)
- [c21]Conor McBride: Outrageous but meaningful coincidences: dependent type-safe syntax and evaluation. ICFP-WGP 2010: 1-12
- [c20]James Chapman, Pierre-Évariste Dagand, Conor McBride, Peter Morris: The gentle art of levitation. ICFP 2010: 3-14
2000 – 2009
- 2009
- [j6]
- [c19]Conor McBride: Let's See How Things Unfold: Reconciling the Infinite with the Intensional (Extended Abstract). CALCO 2009: 113-126
- 2008
- [j5]Conor McBride, Ross Paterson: Applicative programming with effects. J. Funct. Program. 18(1): 1-13 (2008)
- [c18]Rawle Prince, Neil Ghani, Conor McBride: Proving Properties about Lists Using Containers. FLOPS 2008: 97-112
- [c17]Conor McBride: Clowns to the left of me, jokers to the right (pearl): dissecting data structures. POPL 2008: 287-295
- 2007
- [c16]
- [c15]
- [e1]Thorsten Altenkirch, Conor McBride (Eds.): Types for Proofs and Programs, International Workshop, TYPES 2006, Nottingham, UK, April 18-21, 2006, Revised Selected Papers. Lecture Notes in Computer Science 4502, Springer 2007, ISBN 978-3-540-74463-4
- 2006
- [c14]Healfdene Goguen, Conor McBride, James McKinna: Eliminating Dependent Pattern Matching. Essays Dedicated to Joseph A. Goguen 2006: 521-540
- [c13]Thorsten Altenkirch, Conor McBride, Peter Morris: Generic Programming with Dependent Types. SSDGP 2006: 209-257
- [c12]
- 2005
- [j4]Michael Abbott, Thorsten Altenkirch, Conor McBride, Neil Ghani: for Data: Differentiating Data Structures. Fundam. Inform. 65(1-2): 1-28 (2005)
- [c11]James Chapman, Thorsten Altenkirch, Conor McBride: Epigram reloaded: a standalone typechecker for ETT. Trends in Functional Programming 2005: 79-94
- 2004
- [j3]
- [c10]Conor McBride: Epigram: Practical Programming with Dependent Types. Advanced Functional Programming 2004: 130-170
- [c9]Conor McBride, James McKinna: Functional pearl: i am not a number-i am a free variable. Haskell 2004: 1-9
- [c8]Michael Abbott, Thorsten Altenkirch, Neil Ghani, Conor McBride: Constructing Polymorphic Programs with Quotient Types. MPC 2004: 2-15
- [c7]Conor McBride, Healfdene Goguen, James McKinna: A Few Constructions on Constructors. TYPES 2004: 186-200
- [c6]Peter Morris, Thorsten Altenkirch, Conor McBride: Exploring the Regular Tree Types. TYPES 2004: 252-267
- 2003
- [j2]Conor McBride: First-order unification by structural recursion. J. Funct. Program. 13(6): 1061-1075 (2003)
- [c5]Michael Abbott, Thorsten Altenkirch, Neil Ghani, Conor McBride: Derivatives of Containers. TLCA 2003: 16-30
- [c4]Edwin Brady, Conor McBride, James McKinna: Inductive Families Need Not Store Their Indices. TYPES 2003: 115-129
- 2002
- [j1]Conor McBride: Faking it: Simulating dependent types in Haskell. J. Funct. Program. 12(4&5): 375-392 (2002)
- [c3]Thorsten Altenkirch, Conor McBride: Generic Programming within Dependently Typed Programming. Generic Programming 2002: 1-20
- 2000
- [c2]
1990 – 1999
- 1996
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-03 21:38 CEST by the dblp team