Bassel Mannaa
Research Subjects
Bassel Mannaa has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
Thierry Coquand
Göteborgs Universitet, Sweden
2 shared publications- Andrew M. Pitts
University of Cambridge, UK
1 shared publication - Bas Spitters
Aarhus University, Aarhus, Denmark
1 shared publication Fabian Ruch
Göteborgs Universitet, Sweden
1 shared publicationLars Birkedal
Department of Computer Science, Aarhus University, Denmark
1 shared publicationRanald Clouston
Research School of Computer Science, Australian National University, Australia
1 shared publication
Latest Publications
- 12 December 2019
- Published by Cambridge University Press (CUP) in Mathematical Structures in Computer Science
- Vol. 30 (2) , 118-138
Modal dependent type theory and dependent right adjoints
In recent years, we have seen several new models of dependent type theory extended with some form of modal necessity operator, including nominal type theory, guarded and clocked type theory and spatial and cohesive type theory. In this paper, we study modal dependent type theory: dependent type theory with an operator satisfying (a dependent version of) the K axiom of modal logic. We investigate both semantics and syntax. For the semantics, we introduce categories with families with a dependent right adjoint (CwDRA) and show that the examples above can be presented as such. Indeed, we show that any category with finite limits and an adjunction of endofunctors give rise to a CwDRA via the local universe construction. For the syntax, we introduce a dependently typed extension of Fitch-style modal λ-calculus, show that it can be interpreted in any CwDRA, and build a term model. We extend the syntax and semantics with universes.
- 12 December 2019
- Published by Cambridge University Press (CUP) in Mathematical Structures in Computer Science
- Vol. 30 (2) , 118-138
Modal dependent type theory and dependent right adjoints
In recent years, we have seen several new models of dependent type theory extended with some form of modal necessity operator, including nominal type theory, guarded and clocked type theory and spatial and cohesive type theory. In this paper, we study modal dependent type theory: dependent type theory with an operator satisfying (a dependent version of) the K axiom of modal logic. We investigate both semantics and syntax. For the semantics, we introduce categories with families with a dependent right adjoint (CwDRA) and show that the examples above can be presented as such. Indeed, we show that any category with finite limits and an adjunction of endofunctors give rise to a CwDRA via the local universe construction. For the syntax, we introduce a dependently typed extension of Fitch-style modal λ-calculus, show that it can be interpreted in any CwDRA, and build a term model. We extend the syntax and semantics with universes.
- 1 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-11
Stack semantics of type theory
We give a model of dependent type theory with one univalent universe and propositional truncation interpreting a type as a stack, generalizing the groupoid model of type theory. As an application, we show that countable choice cannot be proved in dependent type theory with one univalent universe and propositional truncation.
- 1 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-11
Stack semantics of type theory
We give a model of dependent type theory with one univalent universe and propositional truncation interpreting a type as a stack, generalizing the groupoid model of type theory. As an application, we show that countable choice cannot be proved in dependent type theory with one univalent universe and propositional truncation.
- Open Access
- 9 September 2014
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 164, 18-32
A Sheaf Model of the Algebraic Closure
In constructive algebra one cannot in general decide the irreducibility of a polynomial over a field K. This poses some problems to showing the existence of the algebraic closure of K. We give a possible constructive interpretation of the existence of the algebraic closure of a field in characteristic 0 by building, in a constructive metatheory, a suitable site model where there is such an algebraic closure. One can then extract computational content from this model. We give examples of computation based on this model.Comment: In Proceedings CL&C 2014, arXiv:1409.259
- 9 September 2014
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 164, 18-32
Open AccessA Sheaf Model of the Algebraic Closure
In constructive algebra one cannot in general decide the irreducibility of a polynomial over a field K. This poses some problems to showing the existence of the algebraic closure of K. We give a possible constructive interpretation of the existence of the algebraic closure of a field in characteristic 0 by building, in a constructive metatheory, a suitable site model where there is such an algebraic closure. One can then extract computational content from this model. We give examples of computation based on this model.Comment: In Proceedings CL&C 2014, arXiv:1409.259
- 5 August 2010
- Published by Elsevier in Information Processing Letters
- Vol. 110 (21) , 961-965
Cluster editing problem for points on the real line: A polynomial time algorithm
- 5 August 2010
- Published by Elsevier in Information Processing Letters
- Vol. 110 (21) , 961-965
Cluster editing problem for points on the real line: A polynomial time algorithm