The finite state-ness of FSM-Hume. - Archive ouverte HAL Access content directly
Book Sections Year : 2004

The finite state-ness of FSM-Hume.

G. Michaelson
  • Function : Author
K. Hammond
  • Function : Author


Hume is a domain-specific programming language targeting resource- bounded computations, such as real-time embedded systems. It is novel in being based on generalised concurrent bounded automata, controlled by transitions characterised by pattern matching on inputs and recursive function generation of outputs. FSM-Hume is a strict finite state subset of Hume, where symbols are constrained to fixed size types and transition functions are non-recursive. Here we discuss the design of FSM-Hume and show that it is indeed classically finite state.
No file

Dates and versions

hal-00103221 , version 1 (03-10-2006)


  • HAL Id : hal-00103221 , version 1


G. Michaelson, K. Hammond, Jocelyn Serot. The finite state-ness of FSM-Hume.. S. Gilmore. Trends in Functional Programming, Volume 4, Intellect, pp.19-28, 2004. ⟨hal-00103221⟩


59 View
0 Download


Gmail Facebook Twitter LinkedIn More