Cost-sensitive computational adequacy of higher-order recursion in synthetic domain theory
We study a cost-aware programming language for higher-order recursion dubbed $\textbf{PCF}_\mathsf{cost}$ in the setting of synthetic domain theory (SDT). Our main contribution relates the denotational cost semantics of $\textbf{PCF}_\mathsf{cost}$ to its computational cost semantics, a new kind of...
Saved in:
| Published in: | Electronic Notes in Theoretical Informatics and Computer Science Vol. 4 - Proceedings of... |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
11.12.2024
|
| ISSN: | 2969-2431, 2969-2431 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!