Neil Ghani

According to our database1, Neil Ghani authored at least 76 papers between 1995 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Universal properties for universal types in bifibrational parametricity.
Mathematical Structures in Computer Science, 2019

2018
A compositional treatment of iterated open games.
Theor. Comput. Sci., 2018

Compositional Game Theory.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017
A Compositional Treatment of Iterated Open Games.
CoRR, 2017

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

Polytypic Genetic Programming.
Proceedings of the Applications of Evolutionary Computation - 20th European Conference, 2017

2016
Containers, monads and induction recursion.
Mathematical Structures in Computer Science, 2016

A compositional approach to economic game theory.
CoRR, 2016

Comprehensive Parametric Polymorphism: Categorical Models and Type Theory.
Proceedings of the Foundations of Software Science and Computation Structures, 2016

Dependent Types and Fibred Computational Effects.
Proceedings of the Foundations of Software Science and Computation Structures, 2016

Proof-Relevant Parametricity.
Proceedings of the A List of Successes That Can Change the World, 2016

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

Bifibrational Functorial Semantics of Parametric Polymorphism.
Electr. Notes Theor. Comput. Sci., 2015

Positive Inductive-Recursive Definitions.
Logical Methods in Computer Science, 2015

Parametric Polymorphism - Universally.
Proceedings of the Logic, Language, Information, and Computation, 2015

Models for Polymorphism over Physical Dimension.
Proceedings of the 13th International Conference on Typed Lambda Calculi and Applications, 2015

2014
A relationally parametric model of dependent type theory.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

2013
Indexed Induction and Coinduction, Fibrationally.
Logical Methods in Computer Science, 2013

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

Fibred Data Types.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Positive Inductive-Recursive Definitions.
Proceedings of the Algebra and Coalgebra in Computer Science, 2013

2012
Generic Fibrational Induction
Logical Methods in Computer Science, 2012

Refining Inductive Types
Logical Methods in Computer Science, 2012

Fibrational Induction Meets Effects.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

2011
Modularity and Implementation of Mathematical Operational Semantics.
Electr. Notes Theor. Comput. Sci., 2011

When Is a Type Refinement an Inductive Type?
Proceedings of the Foundations of Software Science and Computational Structures, 2011

Indexed Induction and Coinduction, Fibrationally.
Proceedings of the Algebra and Coalgebra in Computer Science, 2011

2010
Fibrational Induction Rules for Initial Algebras.
Proceedings of the Computer Science Logic, 24th International Workshop, 2010

2009
A principled approach to programming with nested types in Haskell.
Higher-Order and Symbolic Computation, 2009

A Universe of Strictly Positive Families.
Int. J. Found. Comput. Sci., 2009

Continuous Functions on Final Coalgebras.
Electr. Notes Theor. Comput. Sci., 2009

Representations of Stream Processors Using Nested Fixed Points
Logical Methods in Computer Science, 2009

2008
Short Cut Fusion for Effects.
Proceedings of the Nineth Symposium on Trends in Functional Programming, 2008

Foundations for structured programming with GADTs.
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
Monadic augment and generalised short cut fusion.
J. Funct. Program., 2007

Initial Algebra Semantics Is Enough!
Proceedings of the Typed Lambda Calculi and Applications, 8th International Conference, 2007

Constructing Strictly Positive Families.
Proceedings of the Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30, 2007

Higher Dimensional Trees, Algebraically.
Proceedings of the Algebra and Coalgebra in Computer Science, 2007

2006
Explicit substitutions and higher-order syntax.
Higher-Order and Symbolic Computation, 2006

String rewriting for double coset systems.
J. Symb. Comput., 2006

Preface.
Electr. Notes Theor. Comput. Sci., 2006

2005
Containers: Constructing strictly positive types.
Theor. Comput. Sci., 2005

Monads of coalgebras: rational terms and term graphs.
Mathematical Structures in Computer Science, 2005

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

Difunctorial Semantics of Object Calculus.
Electr. Notes Theor. Comput. Sci., 2005

Abstract Modularity.
Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

Monadic augment and generalised short cut fusion.
Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming, 2005

2004
Coproducts of Ideal Monads.
ITA, 2004

Relationally Staged Computations in Calculi of Mobile Processes.
Electr. Notes Theor. Comput. Sci., 2004

Generalizing the AUGMENT combinator.
Proceedings of the Revised Selected Papers from the Fifth Symposium on Trends in Functional Programming, 2004

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

Representing Nested Inductive Types Using W-Types.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Build, Augment and Destroy, Universally.
Proceedings of the Programming Languages and Systems: Second Asian Symposium, 2004

2003
Rewriting Via Coinserters.
Nord. J. Comput., 2003

Dualising Initial Algebras.
Mathematical Structures in Computer Science, 2003

Solving Algebraic Equations Using Coalgebra.
ITA, 2003

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

A Rewriting Alternative to Reidemeister-Schreier.
Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003

Explicit substitutions and higher-order syntax.
Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, 2003

Categories of Containers.
Proceedings of the Foundations of Software Science and Computational Structures, 2003

2002
Coalgebraic Monads.
Electr. Notes Theor. Comput. Sci., 2002

Computing over K-modules.
Electr. Notes Theor. Comput. Sci., 2002

Composing monads using coproducts.
Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming (ICFP '02), 2002

Monads and Modularity.
Proceedings of the Frontiers of Combining Systems, 4th International Workshop, 2002

Coalgebraic approaches to algebraic terms.
Proceedings of the Fixed Points in Computer Science, 2002

2001
Algebras, Coalgebras, Monads and Comonads.
Electr. Notes Theor. Comput. Sci., 2001

2000
Linear Explicit Substitutions.
Logic Journal of the IGPL, 2000

1999
Categorical Models of Explicit Substitutions.
Proceedings of the Foundations of Software Science and Computation Structure, 1999

1998
Explicit Substitutions for Constructive Necessity.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997
Eta-Expansions in Dependent Type Theory - The Calculus of Constructions.
Proceedings of the Typed Lambda Calculi and Applications, 1997

On Modular Properties of Higher Order Extensional Lambda Calculi.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Monads and Modular Term Rewriting.
Proceedings of the Category Theory and Computer Science, 7th International Conference, 1997

1996
Eta-Expansions in Fomega.
Proceedings of the Computer Science Logic, 10th International Workshop, 1996

1995
The Virtues of Eta-Expansion.
J. Funct. Program., 1995

ßn-Equality for Coproducts.
Proceedings of the Typed Lambda Calculi and Applications, 1995


  Loading...