Full abstraction and limiting completeness in equational languages
From MaRDI portal
(Redirected from Publication:1121676)
Recommendations
Cites work
- scientific article; zbMATH DE number 3858394 (Why is no real title available?)
- scientific article; zbMATH DE number 3911679 (Why is no real title available?)
- scientific article; zbMATH DE number 3951980 (Why is no real title available?)
- scientific article; zbMATH DE number 3780545 (Why is no real title available?)
- scientific article; zbMATH DE number 3540387 (Why is no real title available?)
- A refinement of strong sequentiality for term rewriting with constructors
- Approximate Reduction and Lambda Calculus Models
- Computing in systems described by equations
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Continuous Data Types
- Fully abstract models of typed \(\lambda\)-calculi
- Implementing first-order rewriting with constructor systems
- Initial Algebra Semantics and Continuous Algebras
- LCF considered as a programming language
- Operational and Semantic Equivalence Between Recursive Programs
- Programming with Equations
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
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
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)
