FSM-Hume is finite state

Abstract Hume is a domain-specific programming language targeting resourcebounded computations. It is based on generalised concurrent bounded automata, controlled by transitions characterised by pattern matching on inputs and recursive function generation of outputs. Here we discuss the design of FSM-Hume, a strict finite state subset of Hume, and suggest that it is indeed classically finite state.

• Type: Conference
• Year: 2003
• Where: SFP
• Authors: Greg Michaelson, Kevin Hammond, Jocelyn Sérot
• Keywords: Abstract Hume, Concurrent Bounded Automata, Programming Languages, Recursive Function Generation, SFP 2003