A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Versatile event correlation with algebraic effects
2018
Proceedings of the ACM on Programming Languages
Preserved Fulltext
We present the first language design to uniformly express variants of n-way joins over asynchronous event streams from different domains, e.g., stream-relational algebra, event processing, reactive and ...
Alongside a formal semantics for joining and prototypes in Koka and multicore OCaml, we contribute a systematic comparison of the covered domains and features. ...
That is, if the correlation computation receives the next event from left, it will not process further left events until the next right event, and vice versa. ...
doi:10.1145/3236762
dblp:journals/pacmpl/BracevacASEEM18
fatcat:nuu63sxv2rbrnirv46nly5oicu
A history of Haskell
2007
Proceedings of the third ACM SIGPLAN conference on History of programming languages - HOPL III
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
We would also like to give our particular thanks to Bernie Pope and Don Stewart, who prepared the time-line given in Figure 2 . ...
Here they are, with their affiliations during the lifetime of the committee, and identifying those who served as Editor for some iteration of the language: Arvind (MIT), Lennart Augustsson (Chalmers University ...
The Foreign Function Interface One feature that very many applications need is the ability to call procedures written in some other language from Haskell, and preferably vice versa. ...
doi:10.1145/1238844.1238856
dblp:conf/hopl/HudakHJW07
fatcat:7i7s3ivrkzhotgoyvjnxcjglxu
Dala: A Simple Capability-Based Dynamic Language Design For Data Race-Freedom
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
These theorems guarantee data race-freedom when using safe capabilities and show that the addition of capabilities is semantics preserving modulo permission and cast errors. ...
To enforce data-race freedom, these languages either deep copy objects during actor (thread) communication or proxy back to their owning thread. ...
We use this trace to replay the reductions on the capability stripped (unsafe) program (and vice versa), showing two programs reduce to the same terminal configuration modulo cast errors and permission ...
arXiv:2109.07541v1
fatcat:lwiyuzidibe5voq2s6kfsecxya
Automatic Reasoning Techniques for Non-Serializable Data-Intensive Applications
2019
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
It introduces new language abstractions, program logics, reasoning methods, and automated verification and synthesis techniques that collectively allow programmers to reason about non-serializable data-intensive ...
Given the serious practical implications of safety violations in data-intensive applications, there is a pressing need to extend the state-of-the-art in program verification to reach non- serializable ...
This is nonetheless sound due to inductive reasoning: if φ is preserved by every step of R, then φ is preserved by R * , and vice-versa. ...
doi:10.25394/pgs.8977562
fatcat:dz5l62mq7zdjxg6xn2axrlpel4
LIPIcs, Volume 6, RTA'10, Complete Volume
[article]
2013
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
I am also grateful for the valuable comments of the anonymous referees.
Acknowledgments The authors are grateful to the anonymous referees for various useful hints and suggestions. Acknowledgments. ...
Acknowledgments The author thanks Yoshihito Toyama, Nao Hirokawa, Dominik Klein and anonymous referees for their helpful comments. This work was partially supported by a grant from JSPS No. 20500002. ...
In the future, we plan to extend the same concepts used here to other programming languages, potentially Java or OCaml. ...
doi:10.4230/lipics.rta.2010
fatcat:7jekc33355dzro7cl46aq2d674
9th International Conference on Types for Proofs and Programs LIPIcs-Leibniz International Proceedings in Informatics
2013
unpublished
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The 19th International Conference on Types for Proofs and Programs (TYPES 2013) was held in Toulouse, France from April 22 to 26, 2013, consisting of the main conference and several satellite events. ...
The following institutions helped with funding and/or in providing lecture halls and services that TYPES 2013 could take place (in alphabetic order): ...
We want to thank Alexander Kreuzer and Paulo Oliva for their useful comments and suggestions.
References Acknowledgments. ...
fatcat:4uii2lg7hrdvbosn2ar2ljgnhm
Verified and Verifiable Computation with STV Algorithms
[article]
2019
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We minimise the trusted base in the correctness of the tools synthesised by using the Coq and HOL4 theorem provers and the ecosystem of CakeML as the technical basis. ...
Although technology exists to enhance the situation by building significantly more transparent, trustworthy, reliable vote counting tools, in practice these technologies are ignored. ...
to other PR systems, consequences of adapting STV for the practice of politics in elections and voting, and the strategic effects of STV system. ...
doi:10.25911/5f58affacfc58
fatcat:6povdfeysrfq3kknbeme4tjuy4
An infrastructure for tractable verification of JavaScript programs
2018
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
However, it has hardly been used to reason about programs written in dynamic languages in general, and JavaScript in particular. ...
This frontend includes a well-tested compiler from JavaScript code to JSIL code, a translator from JavaScript Logic to JSIL Logic, and well-tested JSIL reference implementations and verified axiomatic ...
type of the property (data to accessor and vice versa); [G] and [S] play a role similar to getters and setters of Java and provide property encapsulation. ...
doi:10.25560/59355
fatcat:mqmol5yutjcarhgiotv7vouvsu