An algebraic semantics approach to the effective resolution of type equations

DOI10.1016/0304-3975(86)90047-2zbMath0628.68010OpenAlexW2007008666MaRDI QIDQ1093359

Hassan Aït-Kaci

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)90047-2

zbMATH Keywords

latticeoperational semanticsalgebraic semanticsterm rewritingfan-out rewritinggraph-rewriting systemsKnowledge Base Languageleast fixed-point solutionssyntactic calculus of partially-ordered data type structuressyntax of record-like termssystems of type equationstype inheritancetype subsumption ordering

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)

Related Items

A fixed-point semantics for feature type systems, Feature automata and recognizable sets of feature trees, On Skolemization in constrained logics, Inheritance hierarchies: Semantics and unifications, Using powerdomains to generalize relational databases, Domains for logic programming, A complete and recursive feature theory, Another variation on the common subexpression problem, Order-sorted unification, Attributive concept descriptions with complements, Ordering constraints over feature trees expressed in second-order monadic logic., A feature constraint system for logic programming with entailment

Uses Software

• ML
• ALGOL 68
• Ada95

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamental properties of infinite trees
• CLU reference manual
• Algebraic semantics
• A theory of type polymorphism in programming
• Pascal. User manual and report
• A lattice-theoretical fixpoint theorem and its applications
• Login: a logic programming language with built-in inheritance
• On the Semantics of “Data Type”
• Fast Decision Procedures Based on Congruence Closure
• Variations on the Common Subexpression Problem
• Reasoning About Recursively Defined Data Structures
• Data Types as Lattices
• A Powerdomain Construction
• Initial Algebra Semantics and Continuous Algebras
• Minimal and Optimal Computations of Recursive Programs
• Logic and semantic networks
• A Machine-Oriented Logic Based on the Resolution Principle