A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Building embedded systems with embedded DSLs
2014
Proceedings of the 19th ACM SIGPLAN international conference on Functional programming - ICFP '14
Preserved Fulltext
This is the story of how EDSLs provided the productivity and safety gains to do large-scale low-level embedded programming and lessons we learned in doing so. ...
The autopilot is approximately 50k lines of C code generated from 10k lines of EDSL code and includes control laws, mode logic, encrypted communications system, and device drivers. ...
Joe Kiniry and Adam Foltzer, and the anonymous reviewers provided helpful comments on earlier drafts of the paper. ...
doi:10.1145/2628136.2628146
dblp:conf/icfp/HickeyPEBL14
fatcat:z2a7dkk66jbc3kcdimjjhqul34
A relational logic for higher-order programs
2019
Journal of functional programming
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.
one of the two terms. ...
AbstractRelational program verification is a variant of program verification where one can reason about two programs and as a special case about two executions of a single program on different inputs. ...
In Proceedings of the 19th ACM SIGPLAN international conference on Functional programming, Gothenburg, Sweden, September 1-3, 2014, Johan Jeuring and Manuel M. T. Chakravarty (Eds.). ACM, 269-282. ...
doi:10.1017/s0956796819000145
fatcat:yxlwrfjjevgpxmo5ulbie5gsn4
A Relational Logic for Higher-Order Programs
[article]
2017
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 2020; you can also visit the original URL.
The file type is application/pdf.
contemplate one of the two terms. ...
Relational program verification is a variant of program verification where one can reason about two programs and as a special case about two executions of a single program on different inputs. ...
In Proceedings of the 19th ACM SIGPLAN international conference on Functional programming, Gothenburg, Sweden, September 1-3, 2014, Johan Jeuring and Manuel M. T. Chakravarty (Eds.). ACM, 269-282. ...
arXiv:1703.05042v1
fatcat:o6w2un7m3zfrndpj2lagsc7zom
A relational framework for higher-order shape analysis
2014
Proceedings of the 19th ACM SIGPLAN international conference on Functional programming - ICFP '14
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 2017; you can also visit the original URL.
The file type is application/pdf.
functions. ...
Our approach is based on the observation that structural properties of such datatypes can often be naturally expressed as inductively-defined relations over the recursive structure evident in their definitions ...
This work is supported by the National Science Foundation under grants CCF-1216613 and CCF-1318227. ...
doi:10.1145/2628136.2628159
dblp:conf/icfp/KakiJ14
fatcat:ntcadei36vhzrptsywef6hwqmi
Folding domain-specific languages
2014
Proceedings of the 19th ACM SIGPLAN international conference on Functional programming - ICFP '14
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 2017; you can also visit the original URL.
The file type is application/pdf.
This embedding may be deep or shallow, depending on whether terms in the language construct syntactic or semantic representations. ...
The deep and shallow styles are closely related, and intimately connected to folds; in this paper, we explore that connection. ...
This work has been funded by EPSRC grant number EP/J010995/1, on Unifying Theories of Generic Programming. ...
doi:10.1145/2628136.2628138
dblp:conf/icfp/GibbonsW14
fatcat:wuai7z3xbbhlfpef3xquidmdzi
SeLINQ
2014
Proceedings of the 19th ACM SIGPLAN international conference on Functional programming - ICFP '14
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 2014; you can also visit the original URL.
The file type is application/pdf.
Because both the host language and the embedded query languages are functional F#-like languages, we are able to leverage information-flow enforcement for functional languages to obtain information-flow ...
Key enabler of the uniform treatment is recent work by Cheney et al., which studies database manipulation via an embedded language-integrated query language (with Microsoft's LINQ on the backend). ...
This work was funded by the European Community under the ProSecu-ToR and WebSand projects and the Swedish research agencies SSF and VR. ...
doi:10.1145/2628136.2628151
dblp:conf/icfp/SchoepeHS14
fatcat:lxkbj65kt5bfngul3z3p6th4n4
Pattern matching without K
2014
Proceedings of the 19th ACM SIGPLAN international conference on Functional programming - ICFP '14
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 2017; you can also visit the original URL.
The file type is application/pdf.
It is reminiscent of both pattern matching in functional languages and case analysis in on-paper mathematics. ...
The source of this incompatibility is the reliance of dependent pattern matching on the so-called K axiom -also known as the uniqueness of identity proofs -which is inadmissible in HoTT. ...
ICFP '14, September 1-6, 2014, Gothenburg, Sweden. Copyright © 2014 ACM 978-1-4503-2873-9 /14/09. . . $15.00. http://dx.doi.org/10. 1145/2628136.2628139 clauses. ...
doi:10.1145/2628136.2628139
dblp:conf/icfp/CockxDP14
fatcat:xngxnlxw3jc55dxr6hx7abdgpq
Safe zero-cost coercions for Haskell
2014
Proceedings of the 19th ACM SIGPLAN international conference on Functional programming - ICFP '14
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 2015; you can also visit the original URL.
The file type is application/pdf.
We prove type safety in the presence of these conversions and have implemented our work in GHC. • We describe the design of safe coercions (Section 2), which introduces the function coerce :: Coercible ...
This function performs a zero-cost conversion between two types a and b that have the same representation. The crucial question becomes ...
This material is based upon work supported by the National Science Foundation under grant nos. CCF-1116620 and CCF-1319880. The first author was supported by the Deutsche Telekom Stiftung. ...
doi:10.1145/2628136.2628141
dblp:conf/icfp/BreitnerEJW14
fatcat:fh445cf5zrcxdedft4ziy7mmfq
Maximal sharing in the Lambda calculus with letrec
2014
Proceedings of the 19th ACM SIGPLAN international conference on Functional programming - ICFP '14
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 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Compactness of the term graphs can then be compared via functional bisimulation. ...
We show how a maximal degree of sharing can be obtained for programs expressed as terms in the lambda calculus with letrec. ...
We also thank the anonymous reviewers for their comments, and a number of stimulating questions. ...
doi:10.1145/2628136.2628148
dblp:conf/icfp/GrabmayerR14
fatcat:7hv2qsgk6jcvljqyk535fwfqwa
Coeffects
2014
Proceedings of the 19th ACM SIGPLAN international conference on Functional programming - ICFP '14
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 2016; you can also visit the original URL.
The file type is application/pdf.
The notion of context in functional languages no longer refers just to variables in scope. ...
The examples presented in this paper are based on analysis of established language features (liveness, linear logics, dataflow, dynamic scoping) and we argue that such context-aware properties will also ...
Acknowledgments Thanks are due to Marco Gaboardi, Dan Ghica, Marcelo Fiore, and Tarmo Uustalu for discussions on this work. We thank the anonymous reviewers for their comments and suggestions. ...
doi:10.1145/2628136.2628160
dblp:conf/icfp/PetricekOM14
fatcat:bc3f2kyhg5hatkbb3hxuwgkv4i
Useful Open Call-by-Need
[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.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2021 pre-print arXiv:2107.06591v1 fatcat:yj6kssn3vvg2heaiqzo4u4o2x4
We isolate the key involved concepts and prove the correctness and the completeness of useful sharing in this setting. ...
This paper studies useful sharing, which is a sophisticated optimization for lambda-calculi, in the context of call-by-need evaluation in presence of open terms. ...
Chakravarty, edi-
tors, Proceedings of the 19th ACM SIGPLAN international conference on
Functional programming, Gothenburg, Sweden, September 1-3, 2014, pages
363-376. ...
arXiv:2107.06591v2
fatcat:6ytlutfryvbzbczftmkqfmtway
Strong Bisimulation for Control Operators
[article]
2019
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 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The purpose of this paper is to identify programs with control operators whose reduction semantics are in exact correspondence. ...
Our result builds on two fundamental ingredients: (1) factorization of λμ-reduction into multiplicative and exponential steps by means of explicit term operators of Λ M, and (2) translation of Λ M-terms ...
This work was partially supported by LIA INFINIS, and the ECOS-Sud program PA17C01. ...
arXiv:1906.09370v2
fatcat:zumswhnbz5cmfcrh2rpk3h7uz4