Full abstraction and limiting completeness in equational languages

DOI10.1016/0304-3975(89)90139-4zbMATH Open0674.68048OpenAlexW2063982351MaRDI QIDQ1121676FDOQ1121676

Authors: 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

Recommendations

• scientific article; zbMATH DE number 194122
• scientific article; zbMATH DE number 3976319
• scientific article; zbMATH DE number 1523049
• Full abstraction and expressive completeness for FP
• General conditions for full abstraction

zbMATH Keywords

full abstractionequational languageslimiting completeness

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

• Full abstraction, totality and PCF
• Normalization, approximation, and semantics for combinator systems
• An universal termination condition for solving goals in equational languages
• Generalization of final algebra semantics by relativization
• General conditions for full abstraction
• Approximation and normalization results for typeable term rewriting systems
• Full abstraction and the Context Lemma (preliminary report)
• Full Abstraction and the Context Lemma

Uses Software

• Miranda

This page was built for publication: Full abstraction and limiting completeness in equational languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121676)