scientific article
From MaRDI portal
Publication:3787979
zbMath0645.03014MaRDI QIDQ3787979
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
correctnesstyped \(\lambda \)-calculusalgorithm for solving the classical type-inference problemcorrect types
Specification and verification (program logics, model checking, etc.) (68Q60) Combinatory logic and lambda calculus (03B40)
Related Items (14)
Operations on records ⋮ Type reconstruction with recursive types and atomic subtyping ⋮ Backward type inference for XML queries ⋮ Type Inference for Rank 2 Gradual Intersection Types ⋮ Type inference for rank-2 intersection types using set unification ⋮ Type inference with subtypes ⋮ Disjoint Polymorphism ⋮ An analysis of the Core-ML language: Expressive power and type reconstruction ⋮ Derivation and inference of higher-order strictness types ⋮ Safety analysis versus type inference for partial types ⋮ The correctness of Newman's typability algorithm and some of its extensions ⋮ Introduction to Type Theory ⋮ Type inference with recursive types: Syntax and semantics ⋮ Simplifying subtyping constraints: a theory
This page was built for publication:
