scientific article; zbMATH DE number 3566824

MaRDI QIDQ4138713zbMATH OpenFDO

Authors Robin Milner

Publication date 1976

Mathematics Subject Classification ID

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
• scientific article; zbMATH DE number 3548479 (Why is no real title available?)
• 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

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)