Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2310.15915 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929268331642880 |
|---|---|
| author | Smith, Scott Zhang, Robert |
| author_facet | Smith, Scott Zhang, Robert |
| contents | This paper develops a novel minimal-state operational semantics for higher-order functional languages that uses only the call stack and a source program point or a lexical level as the complete state information: there is no environment, no substitution, no continuation, etc. We prove this form of operational semantics equivalent to standard presentations.
We then show how this approach can open the door to potential new applications: we define a program analysis as a direct finitization of this operational semantics. The program analysis that naturally emerges has a number of novel and interesting properties compared to standard program analyses for higher-order programs: for example, it can infer recurrences and does not need value widening. We both give a formal definition of the analysis and describe our current implementation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2310_15915 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | A Pure Demand Operational Semantics with Applications to Program Analysis Smith, Scott Zhang, Robert Programming Languages This paper develops a novel minimal-state operational semantics for higher-order functional languages that uses only the call stack and a source program point or a lexical level as the complete state information: there is no environment, no substitution, no continuation, etc. We prove this form of operational semantics equivalent to standard presentations. We then show how this approach can open the door to potential new applications: we define a program analysis as a direct finitization of this operational semantics. The program analysis that naturally emerges has a number of novel and interesting properties compared to standard program analyses for higher-order programs: for example, it can infer recurrences and does not need value widening. We both give a formal definition of the analysis and describe our current implementation. |
| title | A Pure Demand Operational Semantics with Applications to Program Analysis |
| topic | Programming Languages |
| url | https://arxiv.org/abs/2310.15915 |