Universality and semicomputability for nondeterministic programming languages over abstract algebras

DOI10.1016/J.JLAP.2006.09.001zbMath1106.68040OpenAlexW1983544092MaRDI QIDQ864513

Wei Jiang, Yuan Wang, Jeffery Zucker

Publication date: 9 February 2007

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2006.09.001

zbMATH Keywords

nondeterminismguarded commandsabstract computabilitycomputation on abstract data typesmany-sorted algebrasrandom assignments

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Abstract data types; algebraic specification (68Q65) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Unnamed Item
• Computation by `While' programs on topological partial algebras
• Computable total functions on metric algebras, universal algebraic specifications and dynamical systems
• On folk theorems
• Programming as a Discipline of Mathematical Nature
• Abstract versus concrete computation on metric partial algebras
• On Computable Numbers, with an Application to the Entscheidungsproblem

This page was built for publication: Universality and semicomputability for nondeterministic programming languages over abstract algebras