embedded functional programming in hume.pptVIP

15 February 2007 IASTED Software Engineering 2007, Innsbruck Embedded Functional Programming in Hume Gergely Patai patai@iit.bme.hu Péter Hanák hanak@iit.bme.hu Budapest University of Technology and Economics Department of Control Engineering and Information Technology Outline Introducing Hume Example: lift control Example: light measurement Conclusions The Hume language is developed at University of St Andrews and Heriot-Watt University in Scotland within the EmBounded Project (IST-510255). Hume overview An experimental functionally based language for embedded systems Pure functions: no side effects Inherently parallel Visual program structure Static space-time guarantees Verifiable properties Increased dependability Viable on low-end platforms Hume example: counter program stream display to std_out; type integer = int 32; inc x = x+1; box counter in (n::integer) out (n’::integer, nout::integer) match n - (inc n, n); wire counter (counter.n’ initially 0) (counter.n, display); Hume basics Hume programs are ‘boxes’ connected with ‘wires’ Wires: are mailboxes that can hold one piece of data at a time each connects strictly one output to one input statically typed Boxes: map their inputs to their outputs with a pure function (combinational network) the function consists of rules, exactly one of which is chosen by pattern matching on the input if some outgoing wires needed by the rule are occupied, the result is buffered until the wire is freed up by its consumer Supersteps: global consume–produce cycles Execution alternatives Source-level interpreter HAM (Hume Abstract Machine) interpreter Hume → HAM assembly compilation Optional transformation to bytecode Native code HAM → C conversion (macro expansion) Compiled with a C compiler, linked to a lightweight runtime system (RTS) No endianness issues, no malloc, no threads Lift control Task: single-shaft lift simulation Hardware: mitmót ARM7 (32-bit) @ 54MHz(Philips LPC2106) 128k flash, 64k RAM OS: