Partial evaluation and \(\omega\)-completeness of algebraic specifications

DOI10.1016/0304-3975(86)90173-8zbMath0606.68017OpenAlexW2037081226MaRDI QIDQ1084849

Jan Heering

Publication date: 1986

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

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

zbMATH Keywords

equational logicincomplete informationpartial evaluationterm rewriting systemsinitial algebra specification

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (11)

Axiomatizing recursion-free, regular monitors ⋮ Algebraic specifications of computable and semicomputable data types ⋮ Annotated bibliography on partial evaluation and mixed computation ⋮ Une charpente de semi-unification ⋮ On finite alphabets and infinite bases ⋮ A calculus for four-valued sequential logic ⋮ Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness ⋮ On algebraic specifications of computable algebras with the discriminator technique ⋮ Algebra and theory of order-deterministic pomsets ⋮ An investigation of Jones optimality and BTI-universal specializers ⋮ Which data types have \(\omega\)-complete initial algebra specifications?

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proofs by induction in equational theories with constructors
• The lambda calculus, its syntax and semantics
• Mixed computation: potential applications and problems for study
• Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
• The λ-calculus is ω-incomplete
• The Logic of Equality
• Identities in Two-Valued Calculi
• Identities in Finite Algebras

This page was built for publication: Partial evaluation and \(\omega\)-completeness of algebraic specifications