Full abstraction and recursion
type: Item
instance of: scholarly article
title: Full abstraction and recursion
zbMATH Open document ID: 0878.68033
DOI: 10.1016/0304-3975(95)00052-X
author: Michael Mislove
author: Frank J. Oles
published in: Theoretical Computer Science
publication date: 1997-09-09T00:00:00Z
Mathematics Subject Classification ID: 68N15
zbMATH DE Number: 1058310
zbMATH Keywords: semantic models for a programming language
MaRDI profile type: Publication
cites work: Countable nondeterminism and random assignment
cites work: Process Algebra
cites work: Q3899466
cites work: Q3727367
cites work: Readies and Failures in the Algebra of Communicating Processes
cites work: Q3997571
cites work: Q5565113
cites work: Q3997501
cites work: A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
cites work: Q3975029
cites work: Non-well-founded sets modeled as ideal fixed points
cites work: A simple language supporting angelic nondeterminism and parallel composition
cites work: An application of lattice theory to knowledge representation
cites work: WHEN IS A CATEGORY OF MANY-SORTED ALGEBRAS CARTESIAN CLOSED?
cites work: Algebraic and fixed point equations over inverse limits of algebras
cites work: Algebras, polynomials and programs
description: scientific article; zbMATH DE number 1058310