default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNeil Ghani
Person information
- affiliation: University of Nottingham, Department of Computer Science & IT, UK
- affiliation: University of Leicester, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i5]Geoffrey S. H. Cruttwell, Bruno Gavranovic, Neil Ghani, Paul W. Wilson, Fabio Zanasi:
Deep Learning with Parametric Lenses. CoRR abs/2404.00408 (2024)- [i4]Matteo Capucci, Geoffrey S. H. Cruttwell, Neil Ghani, Fabio Zanasi:
A Fibrational Theory of First Order Differential Structures. CoRR abs/2409.05763 (2024) - 2022
- [c58]Geoffrey S. H. Cruttwell
, Bruno Gavranovic, Neil Ghani, Paul W. Wilson, Fabio Zanasi:
Categorical Foundations of Gradient-Based Learning. ESOP 2022: 1-28 - 2021
- [c57]Matteo Capucci, Neil Ghani, Jérémy Ledent, Fredrik Nordvall Forsberg:
Translating Extensive Form Games to Open Games with Agency. ACT 2021: 221-234 - [i3]Geoff S. H. Cruttwell, Bruno Gavranovic, Neil Ghani, Paul W. Wilson, Fabio Zanasi:
Categorical Foundations of Gradient-Based Learning. CoRR abs/2103.01931 (2021) - 2020
- [c56]Fredrik Nordvall Forsberg, Chuangjie Xu, Neil Ghani:
Three equivalent ordinal notation systems in cubical Agda. CPP 2020: 172-185 - [c55]Robert Atkey, Bruno Gavranovic, Neil Ghani, Clemens Kupke, Jérémy Ledent, Fredrik Nordvall Forsberg:
Compositional Game Theory, Compositionally. ACT 2020: 198-214
2010 – 2019
- 2019
- [j23]Neil Ghani, Fredrik Nordvall Forsberg, Federico Orsanigo:
Universal properties for universal types in bifibrational parametricity. Math. Struct. Comput. Sci. 29(6): 810-827 (2019) - [c54]Neil Ghani, Clemens Kupke, Alasdair Lambert, Fredrik Nordvall Forsberg:
Compositional Game Theory with Mixed Strategies: Probabilistic Open Games Using a Distributive Law. ACT 2019: 95-105 - 2018
- [j22]Neil Ghani, Clemens Kupke, Alasdair Lambert, Fredrik Nordvall Forsberg:
A compositional treatment of iterated open games. Theor. Comput. Sci. 741: 48-57 (2018) - [c53]Neil Ghani, Jules Hedges, Viktor Winschel, Philipp Zahn:
Compositional Game Theory. LICS 2018: 472-481 - 2017
- [c52]Jerry Swan, Krzysztof Krawiec, Neil Ghani:
Polytypic Genetic Programming. EvoApplications (2) 2017: 66-81 - [c51]Neil Ghani, Conor McBride, Fredrik Nordvall Forsberg, Stephan Spahn:
Variations on Inductive-Recursive Definitions. MFCS 2017: 63:1-63:13 - [i2]Neil Ghani, Clemens Kupke, Alasdair Lambert, Fredrik Nordvall Forsberg:
A Compositional Treatment of Iterated Open Games. CoRR abs/1711.07968 (2017) - 2016
- [j21]Neil Ghani, Peter G. Hancock:
Containers, monads and induction recursion. Math. Struct. Comput. Sci. 26(1): 89-113 (2016) - [c50]Neil Ghani, Fredrik Nordvall Forsberg, Federico Orsanigo:
Proof-Relevant Parametricity. A List of Successes That Can Change the World 2016: 109-131 - [c49]Neil Ghani, Fredrik Nordvall Forsberg, Alex Simpson:
Comprehensive Parametric Polymorphism: Categorical Models and Type Theory. FoSSaCS 2016: 3-19 - [c48]Danel Ahman, Neil Ghani, Gordon D. Plotkin:
Dependent Types and Fibred Computational Effects. FoSSaCS 2016: 36-54 - [i1]Neil Ghani, Jules Hedges:
A compositional approach to economic game theory. CoRR abs/1603.04641 (2016) - 2015
- [j20]Neil Ghani, Lorenzo Malatesta, Fredrik Nordvall Forsberg:
Positive Inductive-Recursive Definitions. Log. Methods Comput. Sci. 11(1) (2015) - [j19]Thorsten Altenkirch, Neil Ghani, Peter G. Hancock, Conor McBride, Peter Morris:
Indexed containers. J. Funct. Program. 25 (2015) - [c47]Robert Atkey, Neil Ghani, Fredrik Nordvall Forsberg, Timothy Revell, Sam Staton:
Models for Polymorphism over Physical Dimension. TLCA 2015: 45-59 - [c46]Neil Ghani, Fredrik Nordvall Forsberg, Federico Orsanigo:
Parametric Polymorphism - Universally. WoLLIC 2015: 81-92 - [c45]Neil Ghani, Patricia Johann, Fredrik Nordvall Forsberg, Federico Orsanigo, Tim Revell:
Bifibrational Functorial Semantics of Parametric Polymorphism. MFPS 2015: 165-181 - 2014
- [c44]Robert Atkey, Neil Ghani, Patricia Johann:
A relationally parametric model of dependent type theory. POPL 2014: 503-516 - 2013
- [j18]Neil Ghani, Patricia Johann, Clément Fumex:
Indexed Induction and Coinduction, Fibrationally. Log. Methods Comput. Sci. 9(3) (2013) - [c43]Neil Ghani, Lorenzo Malatesta, Fredrik Nordvall Forsberg:
Positive Inductive-Recursive Definitions. CALCO 2013: 19-33 - [c42]Neil Ghani, Lorenzo Malatesta, Fredrik Nordvall Forsberg, Anton Setzer:
Fibred Data Types. LICS 2013: 243-252 - [c41]Peter G. Hancock, Conor McBride, Neil Ghani, Lorenzo Malatesta, Thorsten Altenkirch:
Small Induction Recursion. TLCA 2013: 156-172 - 2012
- [j17]Robert Atkey, Patricia Johann, Neil Ghani:
Refining Inductive Types. Log. Methods Comput. Sci. 8(2) (2012) - [j16]Neil Ghani, Patricia Johann, Clément Fumex:
Generic Fibrational Induction. Log. Methods Comput. Sci. 8(2) (2012) - [c40]Robert Atkey, Neil Ghani, Bart Jacobs, Patricia Johann:
Fibrational Induction Meets Effects. FoSSaCS 2012: 42-57 - 2011
- [c39]Clément Fumex, Neil Ghani, Patricia Johann:
Indexed Induction and Coinduction, Fibrationally. CALCO 2011: 176-191 - [c38]Robert Atkey, Patricia Johann, Neil Ghani:
When Is a Type Refinement an Inductive Type? FoSSaCS 2011: 72-87 - 2010
- [c37]Neil Ghani, Patricia Johann, Clément Fumex:
Fibrational Induction Rules for Initial Algebras. CSL 2010: 336-350
2000 – 2009
- 2009
- [j15]Neil Ghani, Peter G. Hancock, Dirk Pattinson:
Representations of Stream Processors Using Nested Fixed Points. Log. Methods Comput. Sci. 5(3) (2009) - [j14]Peter Morris, Thorsten Altenkirch, Neil Ghani:
A Universe of Strictly Positive Families. Int. J. Found. Comput. Sci. 20(1): 83-107 (2009) - [j13]Patricia Johann, Neil Ghani:
A principled approach to programming with nested types in Haskell. High. Order Symb. Comput. 22(2): 155-189 (2009) - [c36]Neil Ghani, Peter G. Hancock, Dirk Pattinson:
Continuous Functions on Final Coalgebras. MFPS 2009: 3-18 - 2008
- [c35]Rawle C. S. Prince, Neil Ghani, Conor McBride:
Proving Properties about Lists Using Containers. FLOPS 2008: 97-112 - [c34]Patricia Johann, Neil Ghani:
Foundations for structured programming with GADTs. POPL 2008: 297-308 - [c33]Neil Ghani, Patricia Johann:
Short Cut Fusion for Effects. Trends in Functional Programming 2008: 113-128 - [c32]Mauro Jaskelioff, Neil Ghani, Graham Hutton:
Modularity and Implementation of Mathematical Operational Semantics. MSFP@ICALP 2008: 75-95 - 2007
- [j12]Neil Ghani, Patricia Johann:
Monadic augment and generalised short cut fusion. J. Funct. Program. 17(6): 731-776 (2007) - [c31]Neil Ghani, Alexander Kurz:
Higher Dimensional Trees, Algebraically. CALCO 2007: 226-241 - [c30]Peter Morris, Thorsten Altenkirch, Neil Ghani:
Constructing Strictly Positive Families. CATS 2007: 111-121 - [c29]Patricia Johann, Neil Ghani:
Initial Algebra Semantics Is Enough! TLCA 2007: 207-222 - 2006
- [j11]Ronald Brown, Neil Ghani, Anne Heyworth, Christopher D. Wensley:
String rewriting for double coset systems. J. Symb. Comput. 41(5): 573-590 (2006) - [j10]Neil Ghani, Tarmo Uustalu, Makoto Hamana:
Explicit substitutions and higher-order syntax. High. Order Symb. Comput. 19(2-3): 263-282 (2006) - [c28]Neil Ghani, John Power:
Preface. CMCS 2006: 1-2 - [c27]Neil Ghani, Peter G. Hancock, Dirk Pattinson:
Continuous Functions on Final Coalgebras. CMCS 2006: 141-155 - [e1]Neil Ghani, John Power:
Proceedings of the Eighth Workshop on Coalgebraic Methods in Computer Science, CMCS 2006, Vienna, Austria, March 25-27, 2006. Electronic Notes in Theoretical Computer Science 164(1), Elsevier 2006 [contents] - 2005
- [j9]Michael Gordon Abbott, Thorsten Altenkirch, Conor McBride, Neil Ghani:
for Data: Differentiating Data Structures. Fundam. Informaticae 65(1-2): 1-28 (2005) - [j8]Neil Ghani, Christoph Lüth, Federico De Marchi:
Monads of coalgebras: rational terms and term graphs. Math. Struct. Comput. Sci. 15(3): 433-451 (2005) - [j7]Michael Gordon Abbott, Thorsten Altenkirch, Neil Ghani:
Containers: Constructing strictly positive types. Theor. Comput. Sci. 342(1): 3-27 (2005) - [c26]Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo Vene:
Monadic augment and generalised short cut fusion. ICFP 2005: 294-305 - [c25]Michael Gordon Abbott, Neil Ghani, Christoph Lüth:
Abstract Modularity. RTA 2005: 46-60 - 2004
- [j6]Neil Ghani, Tarmo Uustalu:
Coproducts of Ideal Monads. RAIRO Theor. Informatics Appl. 38(4): 321-342 (2004) - [c24]Neil Ghani, Tarmo Uustalu, Varmo Vene:
Build, Augment and Destroy, Universally. APLAS 2004: 327-347 - [c23]Michael Gordon Abbott, Thorsten Altenkirch, Neil Ghani:
Representing Nested Inductive Types Using W-Types. ICALP 2004: 59-71 - [c22]Michael Gordon Abbott, Thorsten Altenkirch, Neil Ghani, Conor McBride:
Constructing Polymorphic Programs with Quotient Types. MPC 2004: 2-15 - [c21]Neil Ghani, Tarmo Uustalu, Varmo Vene:
Generalizing the AUGMENT combinator. Trends in Functional Programming 2004: 65-78 - [c20]Johan Glimming, Neil Ghani:
Difunctorial Semantics of Object Calculus. WOOD 2004: 79-94 - [c19]Neil Ghani, Kidane Yemane, Björn Victor:
Relationally Staged Computations in Calculi of Mobile Processes. CMCS 2004: 105-120 - 2003
- [j5]Federico De Marchi, Neil Ghani, Christoph Lüth:
Solving Algebraic Equations Using Coalgebra. RAIRO Theor. Informatics Appl. 37(4): 301-314 (2003) - [j4]Neil Ghani, Christoph Lüth, Federico De Marchi, John Power:
Dualising Initial Algebras. Math. Struct. Comput. Sci. 13(2): 349-370 (2003) - [j3]Neil Ghani, Christoph Lüth:
Rewriting Via Coinserters. Nord. J. Comput. 10(4): 290-312 (2003) - [c18]Neil Ghani, Tarmo Uustalu:
Coproducts of Ideal Monads (Extended Abstract). FICS 2003: 32-36 - [c17]Michael Gordon Abbott, Thorsten Altenkirch, Neil Ghani:
Categories of Containers. FoSSaCS 2003: 23-38 - [c16]Neil Ghani, Tarmo Uustalu:
Explicit substitutions and higher-order syntax. MERLIN 2003 - [c15]Neil Ghani, Anne Heyworth:
A Rewriting Alternative to Reidemeister-Schreier. RTA 2003: 452-466 - [c14]Michael Gordon Abbott, Thorsten Altenkirch, Neil Ghani, Conor McBride:
Derivatives of Containers. TLCA 2003: 16-30 - 2002
- [c13]Neil Ghani, Christoph Lüth, Federico De Marchi:
Coalgebraic approaches to algebraic terms. FICS 2002: 6-8 - [c12]Christoph Lüth, Neil Ghani:
Monads and Modularity. FroCoS 2002: 18-32 - [c11]Christoph Lüth, Neil Ghani:
Composing monads using coproducts. ICFP 2002: 133-144 - [c10]Neil Ghani, Anne Heyworth:
Computing over K-modules. CATS 2002: 34-50 - [c9]Neil Ghani, Christoph Lüth, Federico De Marchi:
Coalgebraic Monads. CMCS 2002: 71-91 - 2001
- [c8]Neil Ghani, Christoph Lüth, Federico De Marchi, John Power:
Algebras, Coalgebras, Monads and Comonads. CMCS 2001: 128-145 - 2000
- [j2]Neil Ghani, Valeria de Paiva, Eike Ritter:
Linear Explicit Substitutions. Log. J. IGPL 8(1): 7-31 (2000)
1990 – 1999
- 1999
- [c7]Neil Ghani, Valeria de Paiva, Eike Ritter:
Categorical Models of Explicit Substitutions. FoSSaCS 1999: 197-211 - 1998
- [c6]Neil Ghani, Valeria de Paiva, Eike Ritter:
Explicit Substitutions for Constructive Necessity. ICALP 1998: 743-754 - 1997
- [c5]Christoph Lüth, Neil Ghani:
Monads and Modular Term Rewriting. Category Theory and Computer Science 1997: 69-86 - [c4]Roberto Di Cosmo, Neil Ghani:
On Modular Properties of Higher Order Extensional Lambda Calculi. ICALP 1997: 237-247 - [c3]Neil Ghani:
Eta-Expansions in Dependent Type Theory - The Calculus of Constructions. TLCA 1997: 164-180 - 1996
- [c2]Neil Ghani:
Eta-Expansions in Fomega. CSL 1996: 182-197 - 1995
- [j1]C. Barry Jay, Neil Ghani:
The Virtues of Eta-Expansion. J. Funct. Program. 5(2): 135-154 (1995) - [c1]Neil Ghani:
ßn-Equality for Coproducts. TLCA 1995: 171-185
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-22 21:13 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:
