scientific article

zbMath0563.68004MaRDI QIDQ3677139

John C. Reynolds

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

semanticsfunctional languagesubtypestype inference rulesgeneric operatorspolymorphic let constructsecond-order typed lambda calculustype deduction systemtype structure of programming languages

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items (12)

Inductively defined types in the Calculus of Constructions ⋮ Polymorphic type inference with overloading and subtyping ⋮ Algebraic domains of natural transformations ⋮ On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory ⋮ Algebraic processing of programming languages ⋮ Meta-circular interpreter for a strongly typed language ⋮ Type inference with subtypes ⋮ Subtyping can have a simple semantics ⋮ Metacircularity in the polymorphic \(\lambda\)-calculus ⋮ Computational interpretations of linear logic ⋮ Extensional models for polymorphism ⋮ Type inference with recursive types: Syntax and semantics

This page was built for publication: