Full abstraction and limiting completeness in equational languages

DOI10.1016/0304-3975(89)90139-4zbMath0674.68048OpenAlexW2063982351MaRDI QIDQ1121676

Satish R. Thatte

Publication date: 1989

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

Full work available at URL: http://hdl.handle.net/2027.42/27882

zbMATH Keywords

full abstractionequational languageslimiting completeness

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) General topics in the theory of software (68N01)

Related Items

Generalization of final algebra semantics by relativization ⋮ Approximation and normalization results for typeable term rewriting systems ⋮ Normalization, approximation, and semantics for combinator systems

Uses Software

• Miranda

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A refinement of strong sequentiality for term rewriting with constructors
• Implementing first-order rewriting with constructor systems
• Computing in systems described by equations
• LCF considered as a programming language
• Fully abstract models of typed \(\lambda\)-calculi
• Operational and Semantic Equivalence Between Recursive Programs
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Continuous Data Types
• Programming with Equations
• The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
• Initial Algebra Semantics and Continuous Algebras
• Approximate Reduction and Lambda Calculus Models