default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDConor McBride
Person information
- affiliation: University of Strathclyde, Glasgow, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j14]Guillaume Allais
, Robert Atkey, James Chapman, Conor McBride, James McKinna:
A type- and scope-safe universe of syntaxes with binding: their semantics and proofs. J. Funct. Program. 31: e22 (2021)- 2020
- [j13]Lukas Convent, Sam Lindley, Conor McBride, Craig McLaughlin:
Doo bee doo bee doo. J. Funct. Program. 30: e9 (2020) - [i7]Guillaume Allais, Robert Atkey, James Chapman, Conor McBride, James McKinna:
A Type and Scope Safe Universe of Syntaxes with Binding: Their Semantics and Proofs. CoRR abs/2001.11001 (2020)
2010 – 2019
- 2018
- [j12]Guillaume Allais, Robert Atkey, James Chapman, Conor McBride, James McKinna:
A type and scope safe universe of syntaxes with binding: their semantics and proofs. Proc. ACM Program. Lang. 2(ICFP): 90:1-90:30 (2018) - [c37]Conor McBride:
Everybody's Got To Be Somewhere. MSFP@FSCD 2018: 53-69 - 2017
- [c36]Guillaume Allais, James Chapman, Conor McBride, James McKinna:
Type-and-scope safe programs and their proofs. CPP 2017: 195-207 - [c35]Neil Ghani, Conor McBride, Fredrik Nordvall Forsberg, Stephan Spahn:
Variations on Inductive-Recursive Definitions. MFCS 2017: 63:1-63:13 - [c34]Sam Lindley, Conor McBride, Craig McLaughlin:
Do be do be do. POPL 2017: 500-514 - 2016
- [j11]Thorsten Altenkirch, Conor McBride:
Selected papers from Dependently Typed Programming 2010 - Overview. Math. Struct. Comput. Sci. 26(1): 1-2 (2016) - [c33]Conor McBride:
I Got Plenty o' Nuttin'. A List of Successes That Can Change the World 2016: 207-233 - [e4]Sam Lindley, Conor McBride, Philip W. Trinder, Donald Sannella:
A List of Successes That Can Change the World - Essays Dedicated to Philip Wadler on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 9600, Springer 2016, ISBN 978-3-319-30935-4 [contents] - [i6]Sam Lindley, Conor McBride, Craig McLaughlin:
Do be do be do. CoRR abs/1611.09259 (2016) - 2015
- [j10]Thorsten Altenkirch, Neil Ghani, Peter G. Hancock, Conor McBride, Peter Morris:
Indexed containers. J. Funct. Program. 25 (2015) - [c32]Conor McBride:
Turing-Completeness Totally Free. MPC 2015: 257-275 - 2014
- [j9]Pierre-Évariste Dagand, Conor McBride:
Transporting functions across ornaments. J. Funct. Program. 24(2-3): 316-383 (2014) - [c31]Conor Thomas McBride:
How to keep your neighbours in order. ICFP 2014: 297-309 - 2013
- [c30]Sam Lindley, Conor McBride:
Hasochism: the pleasure and pain of dependently typed haskell programming. Haskell 2013: 81-92 - [c29]Guillaume Allais, Conor McBride, Pierre Boutillier:
New equations for neutral terms: a sound and complete decision procedure, formalized. DTP@ICFP 2013: 13-24 - [c28]Robert Atkey, Conor McBride:
Productive coprogramming with guarded recursion. ICFP 2013: 197-208 - [c27]Pierre-Évariste Dagand, Conor McBride:
A Categorical Treatment of Ornaments. LICS 2013: 530-539 - [c26]Peter G. Hancock, Conor McBride, Neil Ghani, Lorenzo Malatesta, Thorsten Altenkirch:
Small Induction Recursion. TLCA 2013: 156-172 - [i5]Guillaume Allais, Pierre Boutillier, Conor McBride:
New Equations for Neutral Terms: A Sound and Complete Decision Procedure, Formalized. CoRR abs/1304.0809 (2013) - 2012
- [j8]Nick Benton, Chung-Kil Hur, Andrew Kennedy, Conor McBride:
Strongly Typed Term Representations in Coq. J. Autom. Reason. 49(2): 141-159 (2012) - [c25]Conor Thomas McBride:
Agda-curious?: an exploration of programming with dependent types. ICFP 2012: 1-2 - [c24]Pierre-Évariste Dagand, Conor McBride:
Transporting functions across ornaments. ICFP 2012: 103-114 - [i4]Pierre-Évariste Dagand, Conor McBride:
Transporting Functions across Ornaments. CoRR abs/1201.4801 (2012) - [i3]Pierre-Évariste Dagand, Conor McBride:
Elaborating Inductive Definitions. CoRR abs/1210.6390 (2012) - [i2]Pierre-Évariste Dagand, Conor McBride:
A Categorical Treatment of Ornaments. CoRR abs/1212.3806 (2012) - 2011
- [e3]Venanzio Capretta, Conor McBride:
Proceedings of the Second Workshop on Mathematically Structured Functional Programming, MSFP@ICALP 2008, Reykjavik, Iceland, July 6, 2008. Electronic Notes in Theoretical Computer Science 229(5), Elsevier 2011 [contents] - [i1]Shin-Cheng Mu, Conor McBride, Stephanie Weirich:
Dependently Typed Programming (NII Shonan Meeting 2011-3). NII Shonan Meet. Rep. 2011 (2011) - 2010
- [j7]Andres Löh, Conor McBride, Wouter Swierstra:
A Tutorial Implementation of a Dependently Typed Lambda Calculus. Fundam. Informaticae 102(2): 177-207 (2010) - [c23]Conor McBride:
Outrageous but meaningful coincidences: dependent type-safe syntax and evaluation. ICFP-WGP 2010: 1-12 - [c22]James Chapman, Pierre-Évariste Dagand, Conor McBride, Peter Morris:
The gentle art of levitation. ICFP 2010: 3-14 - [c21]Adam Gundry, Conor McBride, James McKinna:
Type Inference in Context. MSFP@ICFP 2010: 43-54 - [c20]Conor McBride:
Djinn, Monotonic. PAR@ITP 2010: 14-17
2000 – 2009
- 2009
- [j6]Conor McBride, Tarmo Uustalu:
Preface. J. Funct. Program. 19(3-4): 263-264 (2009) - [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 C. S. 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 - [c16]Venanzio Capretta, Conor McBride:
Preface. MSFP@ICALP 2008: 1-2 - 2007
- [c15]Thorsten Altenkirch, Conor McBride, Wouter Swierstra:
Observational equality, now! PLPV 2007: 57-68 - [c14]Conor McBride:
What's the deal with dependent types? TLDI 2007: 1-2 - [e2]Thorsten Altenkirch, Conor McBride:
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 [contents] - 2006
- [c13]Healfdene Goguen, Conor McBride, James McKinna:
Eliminating Dependent Pattern Matching. Essays Dedicated to Joseph A. Goguen 2006: 521-540 - [c12]Thorsten Altenkirch, Conor McBride, Peter Morris:
Generic Programming with Dependent Types. SSDGP 2006: 209-257 - [p1]Conor McBride:
Lego. The Seventeen Provers of the World 2006: 108-115 - [e1]Conor McBride, Tarmo Uustalu:
Workshop on Mathematically Structured Functional Programming, MSFP@MPC 2006, Kuressaare, Estonia, July 2, 2006. Workshops in Computing, BCS 2006 [contents] - 2005
- [j4]Michael Gordon Abbott, Thorsten Altenkirch, Conor McBride, Neil Ghani:
for Data: Differentiating Data Structures. Fundam. Informaticae 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]Conor McBride, James McKinna:
The view from the left. J. Funct. Program. 14(1): 69-111 (2004) - [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 Gordon 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 Gordon Abbott, Thorsten Altenkirch, Neil Ghani, Conor McBride:
Derivatives of Containers. TLCA 2003: 16-30 - [c4]Edwin C. 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
- [b1]Conor McBride:
Dependently typed functional programs and their proofs. University of Edinburgh, UK, 2000 - [c2]Conor McBride:
Elimination with a Motive. TYPES 2000: 197-216
1990 – 1999
- 1996
- [c1]Conor McBride:
Inverting Inductively Defined Relations in LEGO. TYPES 1996: 236-253
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
