850 citations
- University of OxfordGB179 papers
- University of ManchesterGB178 papers
- Tsinghua UniversityCN174 papers
- University of Chinese Academy of SciencesCN170 papers
- Istituto Nazionale di Fisica Nucleare, Laboratori Nazionali di FrascatiIT165 papers
- Shandong UniversityCN165 papers
- University of Science and Technology of ChinaCN165 papers
- Uppsala UniversitySE163 papers
- University of TarapacáCL162 papers
- Johannes Gutenberg University MainzDE159 papers
- Justus-Liebig-Universität GießenDE158 papers
- Nanjing UniversityCN156 papers
8 papers · 1 filter
Gradual Guarantee via Step-Indexed Logical Relations in Agda
Jeremy G. Siek
The gradual guarantee is an important litmus test for gradually typed languages, that is, languages that enable a mixture of static and dynamic typing. The gradual guarantee states…
Forward Build Systems, Formally
Sarah Spall, Neil Mitchell, Sam Tobin-Hochstadt
Build systems are a fundamental part of software construction, but their correctness has received comparatively little attention, relative to more prominent parts of the toolchain.…
Sound, Fine-Grained Traversal Fusion for Heterogeneous Trees - Extended Version
Laith Sakka, Kirshanthan Sundararajah, Ryan R. Newton +1
Applications in many domains are based on a series of traversals of tree structures, and fusing these traversals together to reduce the total number of passes over the tree is a co…
Soft Contract Verification for Higher-Order Stateful Programs
Phuc C. Nguyen, Thomas Gilray, Sam Tobin-Hochstadt +1
Software contracts allow programmers to state rich program properties using the full expressive power of an object language. However, since they are enforced at runtime, monitoring…
Linear Haskell: practical linearity in a higher-order polymorphic language
Jean-Philippe Bernardy, Mathieu Boespflug, Ryan R. Newton +2
Linear type systems have a long and storied history, but not a clear path forward to integrate with existing languages such as OCaml or Haskell. In this paper, we study a linear ty…
Adaptive Lock-Free Data Structures in Haskell: A General Method for Concurrent Implementation Swapping
Chao-Hong Chen, Vikraman Choudhury, Ryan R. Newton
A key part of implementing high-level languages is providing built-in and default data structures. Yet selecting good defaults is hard. A mutable data structure's workload is not k…