Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Positive Supercompilation for a Higher-Order Call-By-Value Language
Saved in:
| Published in: | Logical Methods in Computer Science |
|---|---|
| Format: | Online Article RSS Article |
| Published: |
2010
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
Similar Items: Positive Supercompilation for a Higher-Order Call-By-Value Language
- Galois connecting call-by-value and call-by-name
- Higher Order Automatic Differentiation of Higher Order Functions
- Modular coinduction up-to for higher-order languages via first-order transition systems
- A categorical framework for congruence of applicative bisimilarity in higher-order languages
- Probabilistic call by push value
- Call-by-Value and Call-by-Name Dual Calculi with Inductive and Coinductive Types