Defines quantum cpos via discrete quantization and shows they possess categorical properties analogous to classical cpos, making them suitable for models of quantum programming languages.
Moggi, Computational lambda-calculus and monads , Proceedings of the Fourth Annual Symposium on Logic in Computer Science (1989), 14–23
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math-ph 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Categories of quantum cpos
Defines quantum cpos via discrete quantization and shows they possess categorical properties analogous to classical cpos, making them suitable for models of quantum programming languages.