Scala Implicits Are Everywhere a Large-Scale Study of the Use of Scala Implicits in the Wild
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Safe, Flexible Aliasing with Deferred Borrows Chris Fallin Mozilla1, Mountain View, CA, USA [email protected]
Safe, Flexible Aliasing with Deferred Borrows Chris Fallin Mozilla1, Mountain View, CA, USA [email protected] Abstract In recent years, programming-language support for static memory safety has developed significantly. In particular, borrowing and ownership systems, such as the one pioneered by the Rust language, require the programmer to abide by certain aliasing restrictions but in return guarantee that no unsafe aliasing can ever occur. This allows parallel code to be written, or existing code to be parallelized, safely and easily, and the aliasing restrictions also statically prevent a whole class of bugs such as iterator invalidation. Borrowing is easy to reason about because it matches the intuitive ownership-passing conventions often used in systems languages. Unfortunately, a borrowing-based system can sometimes be too restrictive. Because borrows enforce aliasing rules for their entire lifetimes, they cannot be used to implement some common patterns that pointers would allow. Programs often use pseudo-pointers, such as indices into an array of nodes or objects, instead, which can be error-prone: the program is still memory-safe by construction, but it is not logically memory-safe, because an object access may reach the wrong object. In this work, we propose deferred borrows, which provide the type-safety benefits of borrows without the constraints on usage patterns that they otherwise impose. Deferred borrows work by encapsulating enough state at creation time to perform the actual borrow later, while statically guaranteeing that the eventual borrow will reach the same object it would have otherwise. The static guarantee is made with a path-dependent type tying the deferred borrow to the container (struct, vector, etc.) of the borrowed object. -
The Rust Programming Language
The Rust Programming Language The Rust Programming Language The Rust Project Developpers The Rust Programming Language, © The Rust Project Developpers. Contents I Introduction 7 1 The Rust Programming Language 9 II Getting Started 11 1 Getting Started 13 2 Installing Rust 15 3 Hello, world! 17 4 Hello, Cargo! 21 5 Closing Thoughts 25 III Tutorial: Guessing Games 27 1 Guessing Game 29 2 Set up 31 3 Processing a Guess 33 4 Generating a secret number 37 5 Comparing guesses 41 6 Looping 45 7 Complete! 49 IV Syntax and Semantics 51 1 Syntax and Semantics 53 V Effective Rust 159 1 Effective Rust 161 VI Appendix 243 1 Glossary 245 2 Syntax Index 247 3 Bibliography 253 6 Part I Introduction Chapter 1 The Rust Programming Language Welcome! This book will teach you about the Rust Programming Language. Rust is a systems programming language focused on three goals: safety, speed, and concurrency. It maintains these goals without having a garbage collector, making it a useful language for a number of use cases other languages aren’t good at: embedding in other languages, programs with specific space and time requirements, and writing low-level code, like device drivers and operating systems. It improves on current languages targeting this space by having a number of compile-time safety checks that produce no runtime overhead, while eliminating all data races. Rust also aims to achieve ‘zero-cost abstractions’ even though some of these abstractions feel like those of a high-level language. Even then, Rust still allows precise control like a low-level language would. -
Levity Polymorphism Richard A
Bryn Mawr College Scholarship, Research, and Creative Work at Bryn Mawr College Computer Science Faculty Research and Computer Science Scholarship 2017 Levity Polymorphism Richard A. Eisenberg Bryn Mawr College, [email protected] Simon Peyton Jones Microsoft Research, Cambridge, [email protected] Let us know how access to this document benefits ouy . Follow this and additional works at: http://repository.brynmawr.edu/compsci_pubs Part of the Programming Languages and Compilers Commons Custom Citation R.A. Eisenberg and S. Peyton Jones 2017. "Levity Polymorphism." Proceeding PLDI 2017 Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation: 525-539. This paper is posted at Scholarship, Research, and Creative Work at Bryn Mawr College. http://repository.brynmawr.edu/compsci_pubs/69 For more information, please contact [email protected]. Levity Polymorphism Richard A. Eisenberg Simon Peyton Jones Bryn Mawr College, Bryn Mawr, PA, USA Microsoft Research, Cambridge, UK [email protected] [email protected] Abstract solves the problem, but it is terribly slow (Section 2.1). Thus Parametric polymorphism is one of the linchpins of modern motivated, most polymorphic languages also support some typed programming, but it comes with a real performance form of unboxed values that are represented not by a pointer penalty. We describe this penalty; offer a principled way to but by the value itself. For example, the Glasgow Haskell reason about it (kinds as calling conventions); and propose Compiler (GHC), a state of the art optimizing compiler for levity polymorphism. This new form of polymorphism allows Haskell, has supported unboxed values for decades. abstractions over calling conventions; we detail and verify But unboxed values come at the price of convenience restrictions that are necessary in order to compile levity- and re-use (Section 3). -
X10 Language Specification
X10 Language Specification Version 2.5 Vijay Saraswat, Bard Bloom, Igor Peshansky, Olivier Tardieu, and David Grove Please send comments to [email protected] December 3, 2014 This report provides a description of the programming language X10. X10 is a class- based object-oriented programming language designed for high-performance, high- productivity computing on high-end computers supporting ≈ 105 hardware threads and ≈ 1015 operations per second. X10 is based on state-of-the-art object-oriented programming languages and deviates from them only as necessary to support its design goals. The language is intended to have a simple and clear semantics and be readily accessible to mainstream OO pro- grammers. It is intended to support a wide variety of concurrent programming idioms. The X10 design team consists of David Cunningham, David Grove, Ben Herta, Vijay Saraswat, Avraham Shinnar, Mikio Takeuchi, Olivier Tardieu. Past members include Shivali Agarwal, Bowen Alpern, David Bacon, Raj Barik, Ganesh Bikshandi, Bob Blainey, Bard Bloom, Philippe Charles, Perry Cheng, Christopher Donawa, Julian Dolby, Kemal Ebcioglu,˘ Stephen Fink, Robert Fuhrer, Patrick Gallop, Christian Grothoff, Hiroshi Horii, Kiyokuni Kawachiya, Allan Kielstra, Sreedhar Ko- dali, Sriram Krishnamoorthy, Yan Li, Bruce Lucas, Yuki Makino, Nathaniel Nystrom, Igor Peshansky, Vivek Sarkar, Armando Solar-Lezama, S. Alexander Spoon, Toshio Suganuma, Sayantan Sur, Toyotaro Suzumura, Christoph von Praun, Leena Unnikrish- nan, Pradeep Varma, Krishna Nandivada Venkata, Jan Vitek, Hai Chuan Wang, Tong Wen, Salikh Zakirov, and Yoav Zibin. For extended discussions and support we would like to thank: Gheorghe Almasi, Robert Blackmore, Rob O’Callahan, Calin Cascaval, Norman Cohen, Elmootaz El- nozahy, John Field, Kevin Gildea, Chulho Kim, Orren Krieger, Doug Lea, John Mc- Calpin, Paul McKenney, Josh Milthorpe, Andrew Myers, Filip Pizlo, Ram Rajamony, R. -
Unification of Compile-Time and Runtime Metaprogramming in Scala
Unification of Compile-Time and Runtime Metaprogramming in Scala THÈSE NO 7159 (2017) PRÉSENTÉE LE 6 MARS 2017 À LA FACULTÉ INFORMATIQUE ET COMMUNICATIONS LABORATOIRE DE MÉTHODES DE PROGRAMMATION 1 PROGRAMME DOCTORAL EN INFORMATIQUE ET COMMUNICATIONS ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE POUR L'OBTENTION DU GRADE DE DOCTEUR ÈS SCIENCES PAR Eugene BURMAKO acceptée sur proposition du jury: Prof. J. R. Larus, président du jury Prof. M. Odersky, directeur de thèse Dr D. Syme, rapporteur Prof. S. Tobin-Hochstadt, rapporteur Prof. V. Kuncak, rapporteur Suisse 2017 To future travels. Acknowledgements I would like to heartily thank my advisor Martin Odersky for believing in my vision and trusting me with the autonomy to explore its avenues. It was astonishing to see my work shipped as part of a programming language used by hundreds of thousands of developers, and it would not have been possible without Martin’s encouragement and support. It is my pleasure to thank the members of my thesis jury, Viktor Kunčak, James Larus, Don Syme and Sam Tobin-Hochstadt for their time and insightful comments. I am grateful to my colleagues at EPFL and students whom I supervised during my PhD studies. We hacked many fun things and shared many good times together. My special thanks goes to Denys Shabalin whose relentless passion for excellence shaped our numerous joint projects. A lot of the ideas described in this dissertation were born from discussions and collaborations with Denys. I am continuously humbled by the privilege of being part of the Scala community. During my time at EPFL, I had the chance to work together with Scala enthusiasts all over the world, and that was an amazing experience. -
Practical Type Inference for Arbitrary-Rank Types
Under consideration for publication in J. Functional Programming 1 Practical type inference for arbitrary-rank types 31 July 2007 Simon Peyton Jones Microsoft Research Dimitrios Vytiniotis University of Pennsylvania Stephanie Weirich University of Pennsylvania Mark Shields Microsoft Abstract Haskell’s popularity has driven the need for ever more expressive type system features, most of which threaten the decidability and practicality of Damas-Milner type inference. One such feature is the ability to write functions with higher-rank types—that is, functions that take polymorphic functions as their arguments. Complete type inference is known to be undecidable for higher-rank (impredicative) type systems, but in practice programmers are more than willing to add type annotations to guide the type inference engine, and to document their code. However, the choice of just what annotations are required, and what changes are required in the type system and its inference algorithm, has been an ongoing topic of research. We take as our starting point a λ-calculus proposed by Odersky and L¨aufer. Their sys- tem supports arbitrary-rank polymorphism through the exploitation of type annotations on λ-bound arguments and arbitrary sub-terms. Though elegant, and more convenient than some other proposals, Odersky and L¨aufer’s system requires many annotations. We show how to use local type inference (invented by Pierce and Turner) to greatly reduce the annotation burden, to the point where higher-rank types become eminently usable. Higher-rank types have a very modest impact on type inference. We substantiate this claim in a very concrete way, by presenting a complete type-inference engine, written in Haskell, for a traditional Damas-Milner type system, and then showing how to extend it for higher-rank types.