Gilad Bracha

Gilad Bracha is a software engineer at F5 Networks, and formerly at Google, where he was on the Dart programming language team.[1][2][3] He is creator of the Newspeak language, and co-author of the second and third editions of the Java Language Specification,[4] and a major contributor to the second edition of the Java Virtual Machine Specification.[5]

Gilad Bracha
Gilad Bracha 2006
Alma materUniversity of Utah
AwardsSenior Dahl–Nygaard Prize (2017)
Scientific career
FieldsComputer science
InstitutionsAnimorphic Systems
Sun Microsystems
Cadence Design Systems
Google
F5 Networks
ThesisThe Programming Language 'Jigsaw': Mixins, Modularity and Multiple Inheritance (1991)
Doctoral advisorGary Lindstrom
Websitewww.bracha.org

Between 1994 and 1997, he worked on the Smalltalk system developed by Animorphic Systems,[6] a company that was bought by Sun in 1997. From 1997 to 2006, he worked at Sun Microsystems as computational theologist and, as of 2005, distinguished engineer, on various aspects of the specification and implementation of Java.[6] Following that, he was distinguished engineer at Cadence Design Systems from 2006 to 2009, where he led a team of developers designing and implementing Newspeak.[6]

Bracha received his B.Sc. in mathematics and computer science from Ben Gurion University in Israel and his Ph.D. in computer science from the University of Utah.[7] Bracha won the Senior Dahl–Nygaard Prize in 2017.

BGGA closures

In 2006, Bracha, with Neal Gafter, James Gosling, and Peter von der Ahé (collectively BGGA), drafted a specification for adding closures to the Java language, version 6.[8] The proposal has been criticized by Joshua Bloch on terms of being needlessly complex (adding function types and non-local returns) while providing little benefit for the average Java programmer over other simpler proposals.[9] Closures were added to Java 8, but based on a different proposal than the BGGA one.

Pluggable type systems

Bracha proposed that choice of type system be made independent of choice of language; that a type system should be a module that can be "plugged" into a language as needed. He believes this is advantageous, because what he calls mandatory type systems make languages less expressive and code more fragile.[10] The requirement that types do not affect the semantics of the language is challenging to fulfill; for example, constructs like type-based overloading are disallowed.

In practice, pluggable type systems are variously called optional typing, type hinting, type annotations, or gradual type checking. They tend to be constructed by adding a static type system to an extant dynamically typed language without changing its semantics and usually its syntax. Examples include Smalltalk,[11] Python 3,[12][13] Ruby,[14] Clojure,[15] and PHP 5.[16] For most of the languages there is only one implementation of the type system. The exception is Python 3 where the type system is truly pluggable, because there are several implementations and the programmer can use the one that is the best fit. The only language designed with a pluggable type system from the start is Newspeak. Java 8 provides the ability to extend the type system, but does not allow flexibility in the basics of the type system, such as choosing between static and dynamic typing.[17]

References

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.