Proceedings of the ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation 2012
DOI: 10.1145/2103746.2103766
|View full text |Cite
|
Sign up to set email alerts
|

The interaction of contracts and laziness

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
13
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(13 citation statements)
references
References 18 publications
0
13
0
Order By: Relevance
“…However, with that choice our contracts are neither partial identities, nor idempotent (the properties of Figure 4 are unaffected). The reason is that contracts such as For related reasons other works [1,8] restricted the definitions of contracts such that a contract can never introduce ⊥ itself. However, the desirable freedom to use the whole language to define contracts and the fact that we are just defining a library makes this an impractical choice.…”
Section: Distinct Contract Exceptionsmentioning
confidence: 99%
See 1 more Smart Citation
“…However, with that choice our contracts are neither partial identities, nor idempotent (the properties of Figure 4 are unaffected). The reason is that contracts such as For related reasons other works [1,8] restricted the definitions of contracts such that a contract can never introduce ⊥ itself. However, the desirable freedom to use the whole language to define contracts and the fact that we are just defining a library makes this an impractical choice.…”
Section: Distinct Contract Exceptionsmentioning
confidence: 99%
“…Comparing Contracts Degen, Thiemann and Wehr [7,8] classify existing contract systems for Haskell as eager (straight translation of [12]), semi-eager [19] and lazy [3][4][5]. They check whether the systems meet their desirable properties of meaning preservation and completeness.…”
Section: =[-3]mentioning
confidence: 99%
“…Degen, Thiemann and Wehr [7,8] classify existing contract systems for Haskell as eager (straight translation of [12]), semi-eager [19] and lazy [3][4][5]. They check whether the systems meet their desirable properties of meaning preservation and completeness.…”
Section: Comparing Contractsmentioning
confidence: 99%
“…A APPENDIX This appendix presents two alternative higher-order approaches, called co-natural and forgetful, and their logical implications. Co-natural enforces all non-base types with monitors [Degen et al 2012;Findler et al 2007]. Forgetful limits each value to at most one monitor [Greenberg 2015].…”
mentioning
confidence: 99%