23 citations · 52 across the 29 of their papers we have counts for
4 papers · 1 filter
Bringing Algebraic Hierarchical Decompositions to Concatenative Functional Languages
Attila Egri-Nagy
Programming languages tend to evolve over time to use more and more concepts from theoretical computer science. Still, there is a gap between programming and pure mathematics. Not…
Computational Exploration of Finite Semigroupoids
Attila Egri-Nagy, Chrystopher L. Nehaniv
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but…
Representation Independent Decompositions of Computation
Attila Egri-Nagy, Chrystopher L. Nehaniv
Constructing complex computation from simpler building blocks is a defining problem of computer science. In algebraic automata theory, we represent computing devices as semigroups.…
On Constructing Finite Automata by Relational Programming
Attila Egri-Nagy, Chrystopher L. Nehaniv
We consider ways to construct a transducer for a given set of input word to output symbol pairs. This is motivated by the need for representing game playing programs in a low-level…