Semantic essence of AsmL
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1670469 (Why is no real title available?)
- scientific article; zbMATH DE number 3833274 (Why is no real title available?)
- scientific article; zbMATH DE number 4035108 (Why is no real title available?)
- scientific article; zbMATH DE number 42431 (Why is no real title available?)
- scientific article; zbMATH DE number 234014 (Why is no real title available?)
- Choiceless polynomial time
- Evolving Algebras 1993: Lipari Guide
- Ordinary interactive small-step algorithms, II
- Sequential abstract-state machines capture sequential algorithms
- Types and programing languages
Cited in
(8)- Formal Methods for Components and Objects
- Software science view on quantum circuit algorithms
- Can abstract state machines be useful in language theory?
- A Verified AsmL Implementation of Belief Revision
- scientific article; zbMATH DE number 2186289 (Why is no real title available?)
- AsmL
- A High-Level Implementation of a System for Automated Reasoning with Default Rules (System Description)
- Play to Test
This page was built for publication: Semantic essence of AsmL
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2571205)