Type reconstruction in Fω
DOI10.1017/S0960129597002302zbMATH Open0883.03044OpenAlexW2010240397MaRDI QIDQ4347376FDOQ4347376
Authors: Paweł Urzyczyn 
Publication date: 24 March 1998
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129597002302
Recommendations
- scientific article; zbMATH DE number 512796
- Type reconstruction in finite rank fragments of the second-order \(\lambda\)-calculus
- Type reconstruction for the linear \(\pi\)-calculus with composite regular types
- Type reconstruction for the linear \(\pi \)-calculus with composite and equi-recursive types
- Type Reconstruction for General Refinement Types
- scientific article; zbMATH DE number 5994829
- Towards a typed omega algebra
- The strict \(\omega\)-groupoid interpretation of type theory
- Transfinite constructions in classical type theory
- Type reconstruction with recursive types and atomic subtyping
partial recursive functionCurry styleGirard's calculus \(F_ \omega\)strongly normalizable termtype assignment system for pure lambda termstype reconstruction problem
Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Metamathematics of constructive systems (03F50)
Cited In (7)
- Title not available (Why is that?)
- Typability and type checking in System F are equivalent and undecidable
- Principality and type inference for intersection types using expansion variables
- Title not available (Why is that?)
- A typed lambda calculus with intersection types
- Title not available (Why is that?)
- Alpha-conversion and typability
This page was built for publication: Type reconstruction in Fω
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4347376)
