Full abstraction and recursion
From MaRDI portal
Recommendations
Cites work
- A simple language supporting angelic nondeterminism and parallel composition
- A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
- Algebraic and fixed point equations over inverse limits of algebras
- Algebras, polynomials and programs
- An application of lattice theory to knowledge representation
- Countable nondeterminism and random assignment
- scientific article; zbMATH DE number 3958712 (Why is no real title available?)
- scientific article; zbMATH DE number 3707731 (Why is no real title available?)
- scientific article; zbMATH DE number 17698 (Why is no real title available?)
- scientific article; zbMATH DE number 48630 (Why is no real title available?)
- scientific article; zbMATH DE number 48723 (Why is no real title available?)
- scientific article; zbMATH DE number 3280068 (Why is no real title available?)
- Non-well-founded sets modeled as ideal fixed points
- Process Algebra
- Readies and Failures in the Algebra of Communicating Processes
- WHEN IS A CATEGORY OF MANY-SORTED ALGEBRAS CARTESIAN CLOSED?
Cited in
(5)
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)