Comparing cubes of typed and type assignment systems
From MaRDI portal
Publication:1365249
DOI10.1016/S0168-0072(96)00036-XzbMATH Open0952.03010MaRDI QIDQ1365249FDOQ1365249
Luigi Liquori, Steffen Van Bakel, Paweł Urzyczyn, Simona Ronchi Della Rocca
Publication date: 23 October 1997
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Recommendations
Cites Work
- A theory of type polymorphism in programming
- The system \({\mathcal F}\) of variable types, fifteen years later
- A filter lambda model and the completeness of type assignment
- The calculus of constructions
- Progress report on generalized functionality
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Functionality in Combinatory Logic
- Introduction to generalized type systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- G‐Stratification is Equivalent to F‐Stratification
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
Uses Software
This page was built for publication: Comparing cubes of typed and type assignment systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1365249)