scientific article; zbMATH DE number 3513288
From MaRDI portal
Publication:4092932
Cited in
(14)- A relative PCF-definability result for strongly stable functions and some corollaries
- scientific article; zbMATH DE number 1531361 (Why is no real title available?)
- Projecting sequential algorithms on strongly stable functions
- The IO- and OI-hierarchies
- Completeness results for the equivalence of recursive schemas
- Definition of the semantics of programming language constructs in terms of ?-calculus. I
- Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming
- An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus
- IO and OI. II
- A theory for nondeterminism, parallelism, communication, and concurrency
- IO and OI. I
- Adherences of languages
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- Program transformations and algebraic semantics
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4092932)
