scientific article; zbMATH DE number 3566824
From MaRDI portal
Publication:4138713
zbMATH Open0364.02018MaRDI QIDQ4138713FDOQ4138713
Publication date: 1976
Title of this publication is not available (Why is that?)
General topics in the theory of software (68N01) Combinatory logic and lambda calculus (03B40) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Cited In (12)
- PASCAL in LCF: Semantics and examples of proof
- A mathematical semantics for a nondeterministic typed lambda-calculus
- Concrete domains
- LCF considered as a programming language
- Computability concepts for programming language semantics
- The IO- and OI-hierarchies
- Expressive power of typed and type-free programming languages
- Title not available (Why is that?)
- A theory of type polymorphism in programming
- Completeness results for the equivalence of recursive schemas
- On some classes of interpretations
- Program transformations and algebraic semantics
Uses Software
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 Q4138713)
