Editing E (programming language) (section)

{{Short description|none}} <!-- "none" is preferred when the title is sufficiently descriptive; see [[WP:SDNONE]] -->
{{Distinguish|AmigaE|e (verification language)|GNU E|Easy Programming Language}}
{{Infobox programming language
|name = E
|logo =
|paradigm = [[Multi-paradigm programming language|Multi-paradigm]]: [[Object-oriented programming|object-oriented]], [[message passing]]
|designer = [[Mark S. Miller]]
|developer =
|released = {{Start date and age|1997}}
|latest release version =
|latest release date =
|typing = [[strong typing|Strong]], [[dynamic typing|dynamic]]
|implementations = E-on-Java, E-on-CL
|influenced =[[Pony (programming language)|Pony]]
|operating system = [[Cross-platform]]
|license = Portions in different [[Free-software license|free licenses]]
|website = {{URL|erights.org}}
|influenced_by = [[Joule (programming language)|Joule]], [http://erights.org/history/original-e/ Original-E], [[Java (programming language)|Java]]
}}

'''E''' is an [[object-oriented programming]] language for [[computer security|secure]] [[distributed computing]], created by [[Mark S. Miller]],<ref>{{cite web |last=Handy |first=Alex |title=The future of software security |url=https://sdtimes.com/botnets/future-software-security/ |website=SD Times |date=14 November 2016}}</ref> [[Dan Bornstein]], [[Douglas Crockford]],<ref>{{cite book |last=Seibel |first=Peter |title=Coders at Work: Reflections on the Craft of Programming |url=https://books.google.com/books?id=2kMIqdfyT8kC&q=electric+communities+e+programming+language |publisher=Apress |pages=95–96 |language=en |date=21 December 2009|isbn=9781430219491 }}</ref> [[Chip Morningstar]]<ref>{{cite web |title=E's History |url=http://www.erights.org/history/ |website=www.erights.org}}</ref> and others at Electric Communities in 1997. E is mainly descended from the concurrent language [[Joule (programming language)|Joule]] and from Original-E, a set of extensions to Java for secure distributed programming. E combines [[Message (computer science)|message]]-based computation with [[Java (programming language)|Java]]-like syntax. A [[concurrent programming|concurrency]] model based on [[event-driven programming|event loops]] and [[promise (programming)|promises]] ensures that [[Deadlock (computer science)|deadlock]] can never occur.<ref>{{cite journal |last1=Miller |first1=Mark S. |last2=Tribble |first2=E. Dean |last3=Shapiro |first3=Jonathan |title=Concurrency Among Strangers |journal=Trustworthy Global Computing |series=Lecture Notes in Computer Science |date=2005 |volume=3705 |pages=195–229 |doi=10.1007/11580850_12 |bibcode=2005LNCS.3705..195M |isbn=978-3-540-30007-6 |url=https://agoric.com/assets/pdf/papers/concurrency-among-strangers.pdf |access-date=2021-03-05 |archive-date=2022-03-31 |archive-url=https://web.archive.org/web/20220331013428/https://agoric.com/assets/pdf/papers/concurrency-among-strangers.pdf |url-status=dead }}</ref>