Write it recursively

From MaRDI portal

Revision as of 15:53, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5178762

Jump to:navigation, search

DOI10.1145/1411204.1411229zbMath1323.68422OpenAlexW4238835188MaRDI QIDQ5178762

Masato Takeichi, Akimasa Morihata, Kiminori Matsuzaki

Publication date: 16 March 2015

Published in: Proceedings of the 13th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1411204.1411229

zbMATH Keywords

program transformation finite state automaton recursive function optimal path query

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

A short cut to optimal sequences

This page was built for publication: Write it recursively

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5178762&oldid=19744490"