Takip et
Ranald Clouston
Ranald Clouston
Lecturer, Australian National University
anu.edu.au üzerinde doğrulanmış e-posta adresine sahip - Ana Sayfa
Başlık
Alıntı yapanlar
Alıntı yapanlar
Yıl
Guarded dependent type theory with coinductive types
A Bizjak, HB Grathwohl, R Clouston, RE Møgelberg, L Birkedal
International Conference on Foundations of Software Science and Computation …, 2016
892016
Fitch-style modal lambda calculi
R Clouston
Foundations of Software Science and Computation Structures: 21st …, 2018
762018
Guarded cubical type theory: Path equality for guarded recursion
L Birkedal, A Bizjak, R Clouston, HB Grathwohl, B Spitters, A Vezzosi
arXiv preprint arXiv:1606.05223, 2016
76*2016
Nominal equational logic
RA Clouston, AM Pitts
Electronic Notes in Theoretical Computer Science 172, 223-257, 2007
712007
Modal dependent type theory and dependent right adjoints
L Birkedal, R Clouston, B Mannaa, RE Møgelberg, AM Pitts, B Spitters
Mathematical Structures in Computer Science 30 (2), 118-138, 2020
682020
Programming and reasoning with guarded recursion for coinductive types
R Clouston, A Bizjak, HB Grathwohl, L Birkedal
Foundations of Software Science and Computation Structures: 18th …, 2015
472015
The guarded lambda-calculus: Programming and reasoning with guarded recursion for coinductive types
R Clouston, A Bizjak, HB Grathwohl, L Birkedal
Logical Methods in Computer Science 12, 2017
372017
Syntactic interpolation for tense logics and bi-intuitionistic logic via nested sequents
T Lyon, A Tiu, R Goré, R Clouston
arXiv preprint arXiv:1910.05215, 2019
292019
Proof search for propositional abstract separation logics via labelled sequents
Z Hóu, R Clouston, R Goré, A Tiu
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of …, 2014
212014
Annotation-Free Sequent Calculi for Full Intuitionistic Linear Logic
R Clouston, J Dawson, R Goré, A Tiu
Computer Science Logic (CSL 2013) 23, 197-214, 2013
212013
Sequent calculus in the topos of trees
R Clouston, R Goré
Foundations of Software Science and Computation Structures: 18th …, 2015
192015
Equational logic for names and binders
RA Clouston
University of Cambridge, 2010
122010
Annotation-Free Sequent Calculi for Full Intuitionistic Linear Logic--Extended Version
R Clouston, J Dawson, R Goré, A Tiu
arXiv preprint arXiv:1307.0289, 2013
112013
Nominal lawvere theories
R Clouston
Logic, Language, Information and Computation: 18th International Workshop …, 2011
112011
Equational logic for names and binding
R Clouston
PhD thesis, University of Cambridge, UK, 2009
112009
Modular labelled sequent calculi for abstract separation logics
Z Hóu, R Clouston, R Goré, A Tiu
ACM Transactions on Computational Logic (TOCL) 19 (2), 1-35, 2018
82018
From Display Calculi to Deep Nested Sequent Calculi: Formalised for Full Intuitionistic Linear Logic
JE Dawson, R Clouston, R Goré, A Tiu
Theoretical Computer Science (TCS), 2014
82014
Binding in nominal equational logic
R Clouston
Mathematical Foundations of Programming Semantics (MFPS) 265, 259-276, 2010
82010
Closed terms (unpublished notes)
R Clouston
8*2007
Nominal Lawvere Theories: A Category Theoretic Account of Equational Theories with Names
R Clouston
72013
Sistem, işlemi şu anda gerçekleştiremiyor. Daha sonra yeniden deneyin.
Makaleler 1–20