The finite state-ness of FSM-Hume.

Abstract : 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.
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00103221
Contributor : Jocelyn Serot <>
Submitted on : Tuesday, October 3, 2006 - 4:45:20 PM
Last modification on : Thursday, April 25, 2019 - 1:33:53 AM

Identifiers

  • HAL Id : hal-00103221, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

84