scientific article; zbMATH DE number 3566824

MaRDI QIDQ4138713zbMATH OpenFDO

Authors Robin Milner

Publication date 1976

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) General topics in the theory of software (68N01)

Cited in

(12)

• A mathematical semantics for a nondeterministic typed lambda-calculus
• The IO- and OI-hierarchies
• Completeness results for the equivalence of recursive schemas
• Computability concepts for programming language semantics
• PASCAL in LCF: Semantics and examples of proof
• LCF considered as a programming language
• A theory of type polymorphism in programming
• On some classes of interpretations
• Program transformations and algebraic semantics
• Concrete domains
• scientific article; zbMATH DE number 3548479 (Why is no real title available?)
• Expressive power of typed and type-free programming languages

Describes a project that uses

Uses Software

• LCF

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)