A category theory for programming languages
From MaRDI portal
Publication:4772150
DOI10.1007/BF01795949zbMath0284.68006OpenAlexW2063434813MaRDI QIDQ4772150
Publication date: 1974
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01795949
Cites Work
- Completions of categories. Seminar lectures given 1966 in Zürich
- On some properties of the free monoids with applications to automata theory
- Characterization of families of rank 3 permutation groups by the subdegrees. I
- Recursive functions of symbolic expressions and their computation by machine, Part I
- Correspondence between ALGOL 60 and Church's Lambda-notation
- Derivatives of Regular Expressions
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A category theory for programming languages