Theory of symbolic expressions. I

DOI10.1016/0304-3975(83)90137-8zbMath0535.68013OpenAlexW1990946967MaRDI QIDQ791311

Masahiko Sato

Publication date: 1983

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(83)90137-8

zbMATH Keywords

theory of computationmodels of computationsemantics of programming languagessymbolic expressions

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65) Recursively (computably) enumerable sets and degrees (03D25)

Related Items (4)

Constructive system for automatic program synthesis ⋮ External and internal syntax of the \(\lambda \)-calculus ⋮ Viewing \({\lambda}\)-terms through maps ⋮ Extracting Lisp programs from constructive proofs: A formal theory of constructive mathematics based on Lisp

Cites Work

• Theory of Formal Systems. (AM-47)
• Recursive functions of symbolic expressions and their computation by machine, Part I
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Theory of symbolic expressions. I