Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Martín Escardó"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 13, Issue 1 (2017)
As the groupoid model of Hofmann and Streicher proves, identity proofs in intensional Martin-L\"of type theory cannot generally be shown to be unique. Inspired by a theorem by Hedberg, we give some simple characterizations of types that do have uniqu
Externí odkaz:
https://doaj.org/article/2ab86f20a0484d0e8ba1fce1ce0ad8ad
Autor:
Martín Escardó
Publikováno v:
Applied General Topology, Vol 4, Iss 1, Pp 193-200 (2003)
We show that the locales which are injective over perfect sublocale embeddings coincide with the underlying objects of the algebras of the upper powerlocale monad, and we characterize them as those whose frames of opens enjoy a property analogous to
Externí odkaz:
https://doaj.org/article/53d621476c7e46a8b4642cacf0bfba18
Publikováno v:
Electronic Notes in Theoretical Computer Science. 155:1-3
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ef2bb2385ae06f4df42d3a0c07337bac
Publikováno v:
Journal of Logical and Algebraic Methods in Programming. 84:107
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fd4e02c4b47fa9d4c473d5caead66a3d
https://doi.org/10.1016/j.jlamp.2014.11.003
https://doi.org/10.1016/j.jlamp.2014.11.003
Publikováno v:
Mathematical Structures in Computer Science. 17:839-839
This is the second part of a special issue in honour of Klaus Keimel – the first part appeared in Mathematical Structures in Computer Science16 (2). This second part consists of a single paper by John Longley, which could not be included in the ear
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1df98aeed2f415107fbe2affded8c9f1
https://doi.org/10.1017/s096012950700624x
https://doi.org/10.1017/s096012950700624x
Autor:
Martín Escardó
Publikováno v:
Proceedings of the Royal Society A: Mathematical, Physical & Engineering Sciences; Jun2011, Vol. 467 Issue 2130, p1519-1545, 27p
Publikováno v:
Mathematical Structures in Computer Science; Dec2004, Vol. 14 Issue 6, p803-814, 12p
Autor:
Martin Escardo
Publikováno v:
Logical Methods in Computer Science, Vol Volume 4, Issue 3 (2008)
We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which the predica
Externí odkaz:
https://doaj.org/article/ed57ddc2f1214e0f9acccc8e6f76db83
Publikováno v:
Mathematical Structures in Computer Science; Apr2006, Vol. 16 Issue 2, p139-140, 2p
Autor:
Catuscia Palamidessi
Publikováno v:
21st Conference on the Mathematical Foundations of Programming Semantics (MFPS XXI)
21st Conference on the Mathematical Foundations of Programming Semantics (MFPS XXI), May 2006, Birmingham, United Kingdom. pp.33-42, ⟨10.1016/j.entcs.2005.11.050⟩
MFPS
21st Conference on the Mathematical Foundations of Programming Semantics (MFPS XXI), May 2006, Birmingham, United Kingdom. pp.33-42, ⟨10.1016/j.entcs.2005.11.050⟩
MFPS
International audience; Anonymity means that the identity of the user performing a certain action is main- tained secret. The protocols for ensuring anonymity often use random mechanisms which can be described probabilistically. The user, on the othe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::df3dff3402040acda865b121ed3019bd