Full abstraction and recursion

DOI10.1016/0304-3975(95)00052-XzbMath0878.68033MaRDI QIDQ1365671

Frank J. Oles, Michael W. Mislove

Publication date: 9 September 1997

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

zbMATH Keywords

semantic models for a programming language

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Related Items

Fixed points without completeness ⋮ Topology, domain theory and theoretical computer science ⋮ A truly concurrent semantics for a process algebra using resource pomsets

Cites Work

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

This page was built for publication: Full abstraction and recursion