scientific article; zbMATH DE number 4051569
From MaRDI portal
Publication:3787979
zbMATH Open0645.03014MaRDI QIDQ3787979FDOQ3787979
Authors: Mitchell Wand 
Publication date: 1987
Title of this publication is not available (Why is that?)
Recommendations
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)
Cited In (26)
- Type inference with recursive types: Syntax and semantics
- Formal verification of algorithm \(\mathcal{W}\): the monomorphic case
- Correcting type errors in the Curry system
- Introduction to Type Theory
- The correctness of Newman's typability algorithm and some of its extensions
- A mechanized textbook proof of a type unification algorithm
- Type inference in polymorphic type discipline
- An analysis of the Core-ML language: Expressive power and type reconstruction
- Title not available (Why is that?)
- On the type correctness of polymorphic \(\lambda\)-terms. I
- Unsolvability of type correctness problem for functional programs
- Type inference with subtypes
- Two algorithms in search of a type-system
- Simplifying subtyping constraints: a theory
- Simply typed convertibility is \textsc{Tower}-complete even for safe lambda-terms
- Threshold voting leads to type-revelation
- Type Inference for Rank 2 Gradual Intersection Types
- Title not available (Why is that?)
- Type inference for rank-2 intersection types using set unification
- Backward type inference for XML queries
- Operations on records (extended abstract)
- Disjoint polymorphism
- Derivation and inference of higher-order strictness types
- M. H. Newman's Typability Algorithm for Lambda-calculus
- Safety analysis versus type inference for partial types
- Type reconstruction with recursive types and atomic subtyping
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 Q3787979)
