Full abstraction and recursion

DOI10.1016/0304-3975(95)00052-XzbMATH Open0878.68033MaRDI QIDQ1365671FDOQ1365671

Authors: Michael Mislove, Frank J. Oles 

Publication date: 9 September 1997

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

Recommendations

• scientific article; zbMATH DE number 3976319
• scientific article; zbMATH DE number 194122
• Three inadequate models
• Fully abstract denotational models for nonuniform concurrent languages

zbMATH Keywords

semantic models for a programming language

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Cites Work

• A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
• Countable nondeterminism and random assignment
• Process Algebra
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Non-well-founded sets modeled as ideal fixed points
• Algebraic and fixed point equations over inverse limits of algebras
• A simple language supporting angelic nondeterminism and parallel composition
• An application of lattice theory to knowledge representation
• WHEN IS A CATEGORY OF MANY-SORTED ALGEBRAS CARTESIAN CLOSED?
• Algebras, polynomials and programs
• Title not available (Why is that?)
• Readies and Failures in the Algebra of Communicating Processes

Cited In (5)

• A truly concurrent semantics for a process algebra using resource pomsets
• Abstract recursive utility
• Topology, domain theory and theoretical computer science
• Full Abstraction and the Context Lemma
• Fixed points without completeness

This page was built for publication: Full abstraction and recursion

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