Semantic types: a fresh look at the ideal model for types
From MaRDI portal
Publication:3452249
Recommendations
Cited in
(16)- Topological Completeness in an Ideal Model for Polymorphic Types
- scientific article; zbMATH DE number 7561489 (Why is no real title available?)
- An ideal model for recursive polymorphic types
- scientific article; zbMATH DE number 4180813 (Why is no real title available?)
- Automata, Languages and Programming
- Type interaction models and the rule of six
- Extensional and Intensional Semantic Universes
- A System F with Call-by-Name Exceptions
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility
- Syntactic logical relations for polymorphic and recursive types
- Realisability semantics of parametric polymorphism, general references and recursive types
- A solution to the PoplMark challenge based on de Bruijn indices
- On the Values of Reducibility Candidates
- Well-founded recursion with copatterns and sized types
- FAITHFUL IDEAL MODELS FOR RECURSIVE POLYMORPHIC TYPES
- Ludics without designs. I: Triads
This page was built for publication: Semantic types: a fresh look at the ideal model for types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452249)