On some classes of interpretations

DOI10.1016/0022-0000(78)90016-8zbMath0392.68009OpenAlexW2066126160MaRDI QIDQ1251892

Irène Guessarian

Publication date: 1978

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(78)90016-8

zbMATH Keywords

Classes of Interpretations

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Related Items (12)

Equivalences and transformations of regular systems - applications to recursive program schemes and grammars ⋮ Unnamed Item ⋮ The equational logic of fixed points ⋮ Varieties of chain-complete algebras ⋮ A complete logic for reasoning about programs via nonstandard model theory. I ⋮ Infinite trees in normal form and recursive equations having a unique solution ⋮ Program transformations and algebraic semantics ⋮ A unifying theorem for algebraic semantics and dynamic logics ⋮ Recursion induction principle revisited ⋮ Implementation of data types by algebraic methods ⋮ Fundamental properties of infinite trees ⋮ Axiomatisation des tests

Uses Software

• LCF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A representation of trees by languages. II
• Finiteness is mu-ineffable
• Decidable Properties of Monadic Functional Schemas
• Bases for Chain-complete Posets
• Initial Algebra Semantics and Continuous Algebras
• Generalized Program Schemas
• Proving Properties of Programs by Structural Induction
• Another recursion induction principle

This page was built for publication: On some classes of interpretations