Type reconstruction with recursive types and atomic subtyping
From MaRDI portal
Publication:5044773
Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)
Recommendations
Cites work
- Automata-theoretic techniques for modal logics of programs
- Fundamental properties of infinite trees
- scientific article; zbMATH DE number 4051569 (Why is no real title available?)
- scientific article; zbMATH DE number 4058828 (Why is no real title available?)
- scientific article; zbMATH DE number 3339435 (Why is no real title available?)
- Type inference with simple subtypes
Cited in
(10)- Some complexity bounds for subtype inequalities
- Type inference for variant object types
- A type system describing unboundedness
- Type reconstruction in Fω
- A Modular Type Reconstruction Algorithm
- Efficient recursive subtyping
- scientific article; zbMATH DE number 922624 (Why is no real title available?)
- scientific article; zbMATH DE number 7577586 (Why is no real title available?)
- Implementation of Functional Languages
- Automatic reconstruction of data types in the decompilation problem
This page was built for publication: Type reconstruction with recursive types and atomic subtyping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5044773)