Content deleted Content added
m compound modifier |
|||
| (86 intermediate revisions by 31 users not shown) | |||
Line 1:
{{Short description|Functional programming language}}
{{Use dmy dates|date=June 2023}}
{{Use British English|date=June 2023}}
{{More citations needed|date=April 2022}}
{{Infobox programming language
| name = Hume
| logo = <!-- Filename only -->
| logo caption =
| screenshot = <!-- Filename only -->
| screenshot caption =
| sampleCode =
| paradigm = [[Functional programming|Functional]]
| family = [[Haskell]]
| designer = Greg Michaelson<br/>Andrew Ireland<br/>Andy Wallace
| developers = [[University of St Andrews]]<br/>[[Heriot-Watt University]]
| released = {{Start date and age|2000}}
| latest release version = 0.8
| latest release date = {{Start date and age|2008|04|25|df=yes}}
| typing = [[Type inference|Inferred]], [[Static typing|static]], [[Strong and weak typing|strong]]
| scope =
| programming language =
| platform = [[IA-32]], [[PowerPC]]
| operating system = [[macOS]], [[Red Hat]] [[Linux]]
| license =
| file ext =
| file format = <!-- or: | file formats = -->
| website = <!-- {{URL|www.example.com}} -->
| implementations =
| dialects =
| influenced by = [[Haskell]]
| influenced =
}}
[[File:HumeStatue-Edinburgh2006.jpg|thumb|Hume Statue in Edinburgh]]
'''Hume''' is a functionally based programming language developed at the [[University of St Andrews]] and [[Heriot-Watt University]] in [[Scotland]] since the year 2000. The language name is both an acronym meaning 'Higher-order Unified Meta-Environment' and an honorific to the 18th-century philosopher [[David Hume]]. It targets [[real-time computing]] [[embedded system]]s, aiming to produce a design that is both highly abstract, and yet allows precise extraction of time and space execution costs. This allows guaranteeing the bounded time and space demands of executing programs.
Hume combines [[functional programming]] ideas with ideas from [[finite-state automata]]. Automata are used to structure communicating programs into a series of "boxes", where each box maps [[Input/output|inputs to outputs]] in a [[pure function|purely functional]] way using high-level pattern-matching. It is structured as a series of levels, each of which exposes different machine properties.
== Design model ==
The Hume language design attempts to maintain the essential properties and features required by the embedded systems ___domain (especially for transparent time and space costing) whilst incorporating as high a level of program abstraction as possible. It aims to target applications ranging from simple [[microcontroller]]s to complex real-time systems such as [[smartphone]]s. This ambitious goal requires incorporating both low-level notions such as [[interrupt]] handling, and high-level ones of [[data structure]] abstraction etc. Such systems are programmed in widely differing ways, but the language design should accommodate such varying requirements.
Hume is a three-layer language: an outer (static) declaration/[[metaprogramming]] layer, an intermediate coordination layer describing a static layout of dynamic processes and the associated devices, and an inner layer describing each process as a (dynamic) mapping from patterns to expressions. The inner layer is stateless and purely functional.
Rather than attempting to apply cost modeling and correctness proving technology to an existing language framework either directly or by altering a more general language (as with e.g., [[RTSJ]]), the approach taken by the Hume designers is to design Hume in such a way that formal models and proofs can definitely be constructed. Hume is structured as a series of overlapping language levels, where each level adds expressibility to the expression semantics, but either loses some desirable property or increases the technical difficulty of providing formal correctness/cost models.<ref>{{Cite book |last=Eekelen |first=Marko Van |date=2007 |url=https://books.google.com/books?id=p0yV1sHLubcC |title=Trends in Functional Programming |publisher=Intellect Books |isbn=978-1-84150-176-5 |pages=198 |language=en}}</ref>
==
The interpreter and compiler versions differ a bit.
* the interpreter (concept prover) admits timeout and custom exceptions.
* the compiler admits heap and stack cost bounding but exceptions only print the exception name.
The coordination system wires ''boxes'' in a [[dataflow programming]] style.
The expression language is [[Haskell]]-like.
The message passing concurrency system remembers [[JoCaml]]'s [[join-pattern]]s or [[Polyphonic C Sharp]] [[Chord (concurrency)|chords]], but with all channels asynchronous.
There is a scheduler built-in that continuously checks pattern-matching through all boxes in turn, putting on hold the boxes that cannot copy outputs to busy input destinations.
== Examples ==
=== Vending machine ===
<syntaxhighlight lang="haskell">
data Coins = Nickel | Dime | Fake;
data Drinks = Coffee | Tea;
data Buttons = BCoffee | BTea | BCancel;
type Int = int 32 ;
exception EFakeCoin :: (Int, string) ;
show v = v as string ;
box coffee
in ( coin :: Coins, button :: Buttons, value :: Int ) -- input channels
out ( drink_outp :: string, value’ :: Int
, refund_outp :: string, display :: string) -- named outputs
within 500KB (400B) -- max heap ( max stack) cost bounding
handles EFakeCoin, TimeOut, HeapOverflow, StackOverflow
match
-- * wildcards for unfilled outputs, and unconsumed inputs
( my_coin, *, v) {- ''join-pattern'' equivalent: coin(my_coin) & value(v) -}
-> let v’ = incrementCredit my_coin v
in ( *, v’, *, show v’)
-- time bounding (''within x time-unit'') raises TimeOut ()
| ( *, BCoffee, v) {- ''join-pattern'' equivalent: button(BCoffee) & value(v) -}
-> (vend Coffee 10 v) within 30s
| ( *, BTea, v) -> (vend Tea 5 v) within 30s
| ( *, BCancel, v) -> let refund u = "Refund " ++ show u ++ "\n"
in ( *, 0, refund v, *)
handle
EFakeCoin (v, msg) -> ( *, v , *, msg)
| TimeOut () -> (*, *, *, "maybe content exhausted, call service!")
| HeapOverflow () -> (*, *, *, "error: heap limit exceeded")
| StackOverflow () -> (*, *, *, "error: stack limit exceeded")
;
incrementCredit coin v =
case coin of
Nickel -> v + 5
Dime -> v + 10
Fake -> raise EFakeCoin (v, "coin rejected")
;
vend drink cost v =
if v >= cost
then ( serve drink, v - cost, *, "your drink")
else ( *, v, *, "money is short of " ++ show (cost - v))
;
serve drink = case drink of
Coffee -> "Coffee\n"
Tea -> "Tea\n"
;
box control
in (c :: char)
out (coin :: Coins, button:: Buttons)
match
'n' -> (Nickel, *)
| 'd' -> (Dime, *)
| 'f' -> (Fake, *)
| 'c' -> (*, BCoffee)
| 't' -> (*, BTea)
| 'x' -> (*, BCancel)
| _ -> (*, *)
;
stream console_outp to "std_out" ;
stream console_inp from "std_in" ;
-- dataflow
wire coffee
-- inputs (channel origins)
(control.coin, control.button, coffee.value’ initially 0) --
-- outputs destinations
(console_outp, coffee.value, console_outp, console_outp)
;
wire control
(console_inp)
(coffee.coin, coffee.button)
;
</syntaxhighlight>
==References==
{{Reflist}}
==Further reading==
*{{cite web |first1=Gergely |last1=Patai |first2=Peter |last2=Hanak |year=2007 |title=Embedded Functional Programming in Hume |url=http://sgate.emt.bme.hu/documents/patai/publications/PataiHanakSE2007.pdf |archive-url=https://web.archive.org/web/20161223080800/http://sgate.emt.bme.hu/documents/patai/publications/PataiHanakSE2007.pdf |archive-date=2016-12-23}}
== External links ==
* [https://web.archive.org/web/20120722084226/http://www-fp.cs.st-andrews.ac.uk/hume/index.shtml The Hume Programming Language web site]
* [http://www.macs.hw.ac.uk/~greg/hume/ The Hume Project at Heriot-Watt University]
* [https://web.archive.org/web/20190403192341/https://www.embounded.org/ EmBounded project], certifies resource-bounded code in Hume
* [https://glew.org/damp2006/Hume-Multicore.pdf Hume and Multicore]
{{Haskell programming}}
[[Category:Haskell programming language family]]
[[Category:Functional languages]]
[[Category:Systems programming languages]]
[[Category:Embedded systems]]
[[Category:Articles with example code]]
| |||