Automata Mista

Abstract. We present a general methodology for non-deterministic programming based on pure functional programming. We construct families of automata constructions which are used as finite-state process descriptions. We use as algorithmic description language Pidgin ML, a core applicative subset of Objective Caml. Dedicated to Zohar Manna for his 26 th birthday

• Type: Conference
• Year: 2003
• Where: BIRTHDAY
• Authors: Gérard P. Huet
• Keywords: Applied Computing, BIRTHDAY 2003, Core Applicative Subset, Non-deterministic Programming, Pure Functional Programming