Realizability: a historical essay
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
A uniform approach to domain theory in realizability models
Mathematical Structures in Computer Science
Modular correspondence between dependent type theories and categories including pretopoi and topoi
Mathematical Structures in Computer Science
Reflection Into Models of Finite Decidable FP-sketches in an Arithmetic Universe
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Synthetic Domain Theory and Models of Linear Abadi & Plotkin Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Relating coalgebraic notions of bisimulation: with applications to name-passing process calculi
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |