Zobrazeno 1 - 10
of 68
pro vyhledávání: '"Neil Ghani"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 11, Issue 1 (2015)
A new theory of data types which allows for the definition of types as initial algebras of certain functors Fam(C) -> Fam(C) is presented. This theory, which we call positive inductive-recursive definitions, is a generalisation of Dybjer and Setzer's
Externí odkaz:
https://doaj.org/article/09d9b152c3fe4d58b8617f4459d37078
Publikováno v:
Logical Methods in Computer Science, Vol Volume 9, Issue 3 (2013)
This paper extends the fibrational approach to induction and coinduction pioneered by Hermida and Jacobs, and developed by the current authors, in two key directions. First, we present a dual to the sound induction rule for inductive types that we de
Externí odkaz:
https://doaj.org/article/b3a59939ab3d4697b7bee629d6e10ad6
Publikováno v:
Logical Methods in Computer Science, Vol Volume 8, Issue 2 (2012)
Dependently typed programming languages allow sophisticated properties of data to be expressed within the type system. Of particular use in dependently typed programming are indexed types that refine data by computationally useful information. For ex
Externí odkaz:
https://doaj.org/article/452d5ce491a84cc5b028dd84c88f29ff
Publikováno v:
Logical Methods in Computer Science, Vol Volume 8, Issue 2 (2012)
This paper provides an induction rule that can be used to prove properties of data structures whose types are inductive, i.e., are carriers of initial algebras of functors. Our results are semantic in nature and are inspired by Hermida and Jacobs' el
Externí odkaz:
https://doaj.org/article/e035c79a46584f9ba7efa79fe60d3a6d
Publikováno v:
Logical Methods in Computer Science, Vol Volume 5, Issue 3 (2009)
We define representations of continuous functions on infinite streams of discrete values, both in the case of discrete-valued functions, and in the case of stream-valued functions. We define also an operation on the representations of two continuous
Externí odkaz:
https://doaj.org/article/5c4bbd8dee804a02b83b103b51c8af6c
Publikováno v:
Applied Category Theory 2021
University of Strathclyde
University of Strathclyde
We show open games cover extensive form games with both perfect and imperfect information. Doing so forces us to address two current weaknesses in open games: the lack of a notion of player and their agency within open games, and the lack of choice o
Publikováno v:
Programming Languages and Systems ISBN: 9783030993351
We propose a categorical semantics of gradient-based machine learning algorithms in terms of lenses, parametric maps, and reverse derivative categories. This foundation provides a powerful explanatory and unifying framework: it encompasses a variety
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::909969c6b3d46c3171edd45d75833604
https://hdl.handle.net/11585/903819
https://hdl.handle.net/11585/903819
Publikováno v:
Mathematical Structures in Computer Science. 29:810-827
In the 1980s, John Reynolds postulated that a parametrically polymorphic function is an ad-hoc polymorphic function satisfying a uniformity principle. This allowed him to prove that his set-theoretic semantics has a relational lifting which satisfies
Publikováno v:
Applied category theory conference 2019
We extend the open games framework for compositional game theory to encompass also mixed strategies, making essential use of the discrete probability distribution monad. We show that the resulting games form a symmetric monoidal category, which can b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9fcd2f377d2dad892b3e1944dd3d9fb4
https://strathprints.strath.ac.uk/68896/1/Ghani_etal_ACT2019_Compositional_game_theory_with_mixed_strategies.pdf
https://strathprints.strath.ac.uk/68896/1/Ghani_etal_ACT2019_Compositional_game_theory_with_mixed_strategies.pdf
Publikováno v:
Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs
CPP
CPP
We present three ordinal notation systems representing ordinals below $\varepsilon_0$ in type theory, using recent type-theoretical innovations such as mutual inductive-inductive definitions and higher inductive types. We show how ordinal arithmetic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a878298042b8ea118c77cfbb45eb3ed8
http://arxiv.org/abs/1904.10759
http://arxiv.org/abs/1904.10759