Semantic types: a fresh look at the ideal model for types

DOI10.1145/964001.964006zbMATH Open1325.68072OpenAlexW2034043336MaRDI QIDQ3452249FDOQ3452249

Jérôme Vouillon, Paul-André Melliès

Publication date: 11 November 2015

Published in: Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/964001.964006

Recommendations

• An ideal model for recursive polymorphic types
• FAITHFUL IDEAL MODELS FOR RECURSIVE POLYMORPHIC TYPES
• scientific article; zbMATH DE number 4180813
• Topological Completeness in an Ideal Model for Polymorphic Types
• scientific article; zbMATH DE number 4126291

zbMATH Keywords

realizabilitypolymorphismsubtypingrecursive typesideal modelinductive/coinductive principle

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Cited In (15)

• Title not available (Why is that?)
• Topological Completeness in an Ideal Model for Polymorphic Types
• An ideal model for recursive polymorphic types
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility
• Syntactic logical relations for polymorphic and recursive types
• A solution to the PoplMark challenge based on de Bruijn indices
• Well-founded recursion with copatterns and sized types
• On the Values of Reducibility Candidates
• FAITHFUL IDEAL MODELS FOR RECURSIVE POLYMORPHIC TYPES

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)