More on advice on structuring compilers and proving them correct
DOI10.1016/0304-3975(81)90080-3zbMATH Open0468.68007OpenAlexW1984841973WikidataQ122858403 ScholiaQ122858403MaRDI QIDQ1156472FDOQ1156472
Authors: James W. Thatcher, Eric G. Wagner, Jesse B. Wright 
Publication date: 1981
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(81)90080-3
General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)
Cites Work
- Title not available (Why is that?)
- Initial Algebra Semantics and Continuous Algebras
- Title not available (Why is that?)
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
- Heterogeneous algebras
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algebra automata I: Parallel programming as a prolegomena to the categorical approach
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel realization of systems, using factorizations and quotients in categories
- A semantically meaningful characterization of reducible flowchart schemes
- Title not available (Why is that?)
- Proving a compiler correct: A simple approach
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (11)
- Functional programming with combinators
- Formalization of universal algebra in Agda
- Classes of finite relations as initial abstract data types. I
- An algebraic approach to the design of compilers for object-oriented languages
- Two-level semantics and code generation
- From grammars and automata to algebras and coalgebras
- Semantics of algorithmic languages
- Proving the correctness of compiler optimisations based on a global analysis: a study of strictness analysis†
- Algebraic characterization of reducible flowcharts
- Initial semantics of logic specifications with negation
- Continuation semantics for flowgraph equations
This page was built for publication: More on advice on structuring compilers and proving them correct
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1156472)
