Robin Adams
Universitetslektor vid
Datavetenskap
Visar 15 publikationer
2019
Guaranteeing Privacy Policies using Lightweight Type Systems
Robin Adams, Wolfgang Schulz, Sibylle Schupp et al
Computer Law and Security Review. Vol. 35 (6)
Artikel i vetenskaplig tidskrift
2018
Constructing Independently Verifiable Privacy-Compliant Type Systems for Message Passing between Black-Box Components
Robin Adams, Sibylle Schupp
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 11294, p. 196-214
Paper i proceeding
2018
Privacy-Preserving Architectures with Probabilistic Guaranties
Kai Buvendiek, Sibylle Schupp, Robin Adams
Annual Conference on Privacy Security and Trust-PST, p. 38-47
Paper i proceeding
2018
A Type Theory for Probabilistic and Bayesian Reasoning
Bart Jacobs, Robin Adams
Leibniz International Proceedings in Informatics (LIPIcs). Vol. 69 (1), p. 1-34
Paper i proceeding
2018
A Normalizing Computation Rule for Propositional Extensionality in Higher-Order Minimal Logic
Robin Adams, Marc Bezem, Thierry Coquand
Paper i proceeding
2014
QPEL: Quantum Program and Effect Language
Robin Adams
Electronic Proceedings in Theoretical Computer Science. Vol. 172, p. 133-153
Paper i proceeding
2011
A pluralist approach to the formalisation of mathematics
Zhaohui Luo, Robin Adams
Mathematical Structures in Computer Science. Vol. 21 (4), p. 913-942
Artikel i vetenskaplig tidskrift
2010
Classical Predicative Logic-Enriched Type Theories
Robin Adams, Zhaohui Luo
Annals of Pure and Applied Logic. Vol. 161 (11), p. 1315-1345
Artikel i vetenskaplig tidskrift
2010
Weyl's predicative classical mathematics as a logic-enriched type theory
Robin Adams, Zhaohui Luo
ACM Transactions on Computational Logic. Vol. 11 (2), p. 1-29
Artikel i vetenskaplig tidskrift
2008
Structural subtyping for inductive types with functorial equality rules
Zhaohui Luo, Robin Adams
Mathematical Structures in Computer Science. Vol. 18 (5), p. 931-972
Artikel i vetenskaplig tidskrift
2006
Pure type systems with judgemental equality
Robin Adams
Journal of Functional Programming. Vol. 16 (2), p. 219-246
Artikel i vetenskaplig tidskrift
2006
Weyl's predicative classical mathematics as a logic-enriched type theory
Robin Adams
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4502, p. 1-17
Paper i proceeding
2006
Formalized metatheory with terms represented by an indexed family of types
Robin Adams
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3839, p. 1-16
Paper i proceeding
2004
A Modular Hierarchy of Logical Frameworks
Robin Adams
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3085, p. 1-16
Paper i proceeding
Det finns inga projekt att visa.
Det kan finnas fler projekt där Robin Adams medverkar, men du måste vara inloggad som anställd på Chalmers för att kunna se dem.